train_terrorists — Madrid train bombing terrorists (2004)

Description

Network of the individuals involved in the bombing of commuter trains in Madrid on 11 March 2004, reconstructed by J. A. Rodríguez (University of Barcelona) from accounts in the two major Spanish daily newspapers (El País and El Mundo), and popularized by B. Hayes (2006). The individuals are the people suspected of having participated in the bombing and their relatives. Four kinds of ties were recorded: (1) trust–friendship (contact, kinship, links in the telephone center); (2) ties to Al Qaeda and to Osama Bin Laden; (3) co-participation in training camps and/or wars; (4) co-participation in previous terrorist attacks (11 September, Casablanca). The four relations were added together to give a "strength of connection" index from 1 to 4. The data were distributed by L. C. Freeman on his network data page at the University of California, Irvine (no longer online), from which this version was obtained via the Internet Archive.

An undirected edge (i, j) indicates a tie of at least one kind between individuals i and j. Six individuals have no ties, and are isolated nodes.

The network has the following properties:

Nodes: name, the name of the individual.
Edges: weight, the strength of the connection (the number of kinds of ties, from 1 to 4).

Tags

Social Offline Weighted Metadata

Citation

B. Hayes, "Connecting the Dots: Can the tools of graph theory and social-network studies unravel the next big plot?" American Scientist 94(5), 400-404 (2006) 10.1511/2006.61.3495 Sci-Hub

Upstream URL OK

https://web.archive.org/web/20210115130726/http://moreno.ss.uci.edu/data.html#train

Networks

Tip: hover over a column header for a description.

Column legend

$\left<k\right>$: Mean degree
$\sigma_k$: Standard deviation of the degrees
$\lambda_h$: Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$: Random walk mixing time
$r$: Degree assortativity
$c$: Global clustering coefficient
$\oslash$: (Pseudo-) diameter
$S$: Relative size of the largest component
NPs: Node properties
EPs: Edge properties

Name	Nodes	Edges	$\left<k\right>$	$\sigma_k$	$\lambda_h$	$\tau$	$r$	$c$	$\oslash$	$S$	Kind	Mode	NPs	EPs	gt	GraphML	GML	csv
train_terrorists	64	243	7.59	6.16	12.27	15.42	0.03	0.56	6	1.00	Undirected	Unipartite		weight	3 KiB	4 KiB	3 KiB	3 KiB

Ridiculograms^*

^* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.