Input data: Agent x Agent
Start time: Tue Oct 18 11:50:38 2011
Network Level Measures
Measure Value Row count 26.000 Column count 26.000 Link count 53.000 Density 0.082 Components of 1 node (isolates) 9 Components of 2 nodes (dyadic isolates) 0 Components of 3 or more nodes 1 Reciprocity 0.767 Characteristic path length 2.189 Clustering coefficient 0.323 Network levels (diameter) 4.000 Network fragmentation 0.582 Krackhardt connectedness 0.418 Krackhardt efficiency 0.883 Krackhardt hierarchy 0.504 Krackhardt upperboundedness 0.958 Degree centralization 0.193 Betweenness centralization 0.113 Closeness centralization 0.062 Eigenvector centralization 0.445 Reciprocal (symmetric)? No (76% of the links are reciprocal) Node Level Measures
Measure Min Max Avg Stddev Total degree centrality 0.000 0.260 0.082 0.081 Total degree centrality [Unscaled] 0.000 13.000 4.077 4.028 In-degree centrality 0.000 0.280 0.082 0.082 In-degree centrality [Unscaled] 0.000 7.000 2.038 2.047 Out-degree centrality 0.000 0.240 0.082 0.081 Out-degree centrality [Unscaled] 0.000 6.000 2.038 2.028 Eigenvector centrality 0.000 0.608 0.196 0.196 Eigenvector centrality [Unscaled] 0.000 0.430 0.139 0.138 Eigenvector centrality per component 0.000 0.281 0.091 0.091 Closeness centrality 0.038 0.087 0.058 0.017 Closeness centrality [Unscaled] 0.002 0.003 0.002 0.001 In-Closeness centrality 0.038 0.095 0.063 0.026 In-Closeness centrality [Unscaled] 0.002 0.004 0.003 0.001 Betweenness centrality 0.000 0.123 0.015 0.031 Betweenness centrality [Unscaled] 0.000 74.000 8.962 18.897 Hub centrality 0.000 0.718 0.155 0.230 Authority centrality 0.000 0.604 0.163 0.225 Information centrality 0.000 0.081 0.038 0.030 Information centrality [Unscaled] 0.000 1.509 0.713 0.565 Clique membership count 0.000 5.000 1.000 1.359 Simmelian ties 0.000 0.160 0.055 0.065 Simmelian ties [Unscaled] 0.000 4.000 1.385 1.619 Clustering coefficient 0.000 1.000 0.323 0.404 Key Nodes
This chart shows the Agent that is repeatedly top-ranked in the measures listed below. The value shown is the percentage of measures for which the Agent was ranked in the top three.
Total degree centrality
The Total Degree Centrality of a node is the normalized sum of its row and column degrees. Individuals or organizations who are "in the know" are those who are linked to many others and so, by virtue of their position have access to the ideas, thoughts, beliefs of many others. Individuals who are "in the know" are identified by degree centrality in the relevant social network. Those who are ranked high on this metrics have more connections to others in the same network. The scientific name of this measure is total degree centrality and it is calculated on the agent by agent matrices.
Input network: Agent x Agent (size: 26, density: 0.0815385)
Rank Agent Value Unscaled Context* 1 wadih_el-hage 0.260 13.000 3.325 2 mohamed_owhali 0.220 11.000 2.580 3 khalfan_mohamed 0.200 10.000 2.207 4 ahmed_ghailani 0.180 9.000 1.835 5 bin_laden 0.160 8.000 1.462 6 swedan_sheikh 0.160 8.000 1.462 7 mustafa_fadhil 0.160 8.000 1.462 8 fahid_msalam 0.160 8.000 1.462 9 abdullah_ahmed_abdullah 0.120 6.000 0.717 10 mohammed_odeh 0.100 5.000 0.344 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.082 Mean in random network: 0.082 Std.dev: 0.081 Std.dev in random network: 0.054 In-degree centrality
The In Degree Centrality of a node is its normalized in-degree. For any node, e.g. an individual or a resource, the in-links are the connections that the node of interest receives from other nodes. For example, imagine an agent by knowledge matrix then the number of in-links a piece of knowledge has is the number of agents that are connected to. The scientific name of this measure is in-degree and it is calculated on the agent by agent matrices.
Input network(s): Agent x Agent
Rank Agent Value Unscaled 1 wadih_el-hage 0.280 7.000 2 mohamed_owhali 0.240 6.000 3 khalfan_mohamed 0.160 4.000 4 bin_laden 0.160 4.000 5 ahmed_ghailani 0.160 4.000 6 swedan_sheikh 0.160 4.000 7 mustafa_fadhil 0.160 4.000 8 fahid_msalam 0.160 4.000 9 mohammed_odeh 0.120 3.000 10 abdullah_ahmed_abdullah 0.120 3.000 Out-degree centrality
For any node, e.g. an individual or a resource, the out-links are the connections that the node of interest sends to other nodes. For example, imagine an agent by knowledge matrix then the number of out-links an agent would have is the number of pieces of knowledge it is connected to. The scientific name of this measure is out-degree and it is calculated on the agent by agent matrices. Individuals or organizations who are high in most knowledge have more expertise or are associated with more types of knowledge than are others. If no sub-network connecting agents to knowledge exists, then this measure will not be calculated. The scientific name of this measure is out degree centrality and it is calculated on agent by knowledge matrices. Individuals or organizations who are high in "most resources" have more resources or are associated with more types of resources than are others. If no sub-network connecting agents to resources exists, then this measure will not be calculated. The scientific name of this measure is out degree centrality and it is calculated on agent by resource matrices.
Input network(s): Agent x Agent
Rank Agent Value Unscaled 1 khalfan_mohamed 0.240 6.000 2 wadih_el-hage 0.240 6.000 3 mohamed_owhali 0.200 5.000 4 ahmed_ghailani 0.200 5.000 5 bin_laden 0.160 4.000 6 swedan_sheikh 0.160 4.000 7 mustafa_fadhil 0.160 4.000 8 fahid_msalam 0.160 4.000 9 abdullah_ahmed_abdullah 0.120 3.000 10 mohammed_odeh 0.080 2.000 Eigenvector centrality
Calculates the principal eigenvector of the network. A node is central to the extent that its neighbors are central. Leaders of strong cliques are individuals who or organizations who are collected to others that are themselves highly connected to each other. In other words, if you have a clique then the individual most connected to others in the clique and other cliques, is the leader of the clique. Individuals or organizations who are connected to many otherwise isolated individuals or organizations will have a much lower score in this measure then those that are connected to groups that have many connections themselves. The scientific name of this measure is eigenvector centrality and it is calculated on agent by agent matrices.
Input network: Agent x Agent (size: 26, density: 0.0815385)
Rank Agent Value Unscaled Context* 1 khalfan_mohamed 0.608 0.430 0.895 2 mohamed_owhali 0.488 0.345 0.493 3 ahmed_ghailani 0.482 0.341 0.473 4 swedan_sheikh 0.446 0.316 0.352 5 mustafa_fadhil 0.446 0.316 0.352 6 fahid_msalam 0.446 0.316 0.352 7 mohammed_odeh 0.389 0.275 0.160 8 wadih_el-hage 0.386 0.273 0.149 9 bin_laden 0.263 0.186 -0.267 10 abdullah_ahmed_abdullah 0.247 0.175 -0.318 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.196 Mean in random network: 0.342 Std.dev: 0.196 Std.dev in random network: 0.297 Eigenvector centrality per component
Calculates the principal eigenvector of the network. A node is central to the extent that its neighbors are central. Each component is extracted as a separate network, Eigenvector Centrality is computed on it and scaled according to the component size. The scores are then combined into a single result vector.
Input network(s): Agent x Agent
Rank Agent Value 1 khalfan_mohamed 0.281 2 mohamed_owhali 0.226 3 ahmed_ghailani 0.223 4 swedan_sheikh 0.206 5 mustafa_fadhil 0.206 6 fahid_msalam 0.206 7 mohammed_odeh 0.180 8 wadih_el-hage 0.178 9 bin_laden 0.121 10 abdullah_ahmed_abdullah 0.114 Closeness centrality
The average closeness of a node to the other nodes in a network (also called out-closeness). Loosely, Closeness is the inverse of the average distance in the network from the node to all other nodes.
Input network: Agent x Agent (size: 26, density: 0.0815385)
Rank Agent Value Unscaled Context* 1 khalfan_mohamed 0.087 0.003 -3.093 2 ahmed_ghailani 0.086 0.003 -3.124 3 swedan_sheikh 0.084 0.003 -3.153 4 mustafa_fadhil 0.084 0.003 -3.153 5 fahid_msalam 0.084 0.003 -3.153 6 ahmed_the_german 0.063 0.003 -3.582 7 mohamed_owhali 0.062 0.002 -3.610 8 bin_laden 0.062 0.002 -3.613 9 wadih_el-hage 0.061 0.002 -3.617 10 mohammed_odeh 0.061 0.002 -3.620 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.058 Mean in random network: 0.239 Std.dev: 0.017 Std.dev in random network: 0.049 In-Closeness centrality
The average closeness of a node from the other nodes in a network. Loosely, Closeness is the inverse of the average distance in the network to the node and from all other nodes.
Input network(s): Agent x Agent
Rank Agent Value Unscaled 1 mohamed_owhali 0.095 0.004 2 wadih_el-hage 0.095 0.004 3 mohammed_odeh 0.095 0.004 4 bin_laden 0.094 0.004 5 fazul_mohammed 0.093 0.004 6 abdullah_ahmed_abdullah 0.091 0.004 7 abdal_rahmad 0.091 0.004 8 ali_mohamed 0.090 0.004 9 khalid_al-fawwaz 0.090 0.004 10 jihad_mohammed_ali 0.090 0.004 Betweenness centrality
The Betweenness Centrality of node v in a network is defined as: across all node pairs that have a shortest path containing v, the percentage that pass through v. Individuals or organizations that are potentially influential are positioned to broker connections between groups and to bring to bear the influence of one group on another or serve as a gatekeeper between groups. This agent occurs on many of the shortest paths between other agents. The scientific name of this measure is betweenness centrality and it is calculated on agent by agent matrices.
Input network: Agent x Agent (size: 26, density: 0.0815385)
Rank Agent Value Unscaled Context* 1 mohamed_owhali 0.123 74.000 0.284 2 wadih_el-hage 0.104 62.500 0.154 3 khalfan_mohamed 0.053 32.000 -0.190 4 bin_laden 0.036 21.500 -0.309 5 mohammed_odeh 0.026 15.500 -0.377 6 abdullah_ahmed_abdullah 0.020 12.000 -0.416 7 fazul_mohammed 0.013 8.000 -0.461 8 ahmed_ghailani 0.013 7.500 -0.467 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.015 Mean in random network: 0.081 Std.dev: 0.031 Std.dev in random network: 0.148 Hub centrality
A node is hub-central to the extent that its out-links are to nodes that have many in-links. Individuals or organizations that act as hubs are sending information to a wide range of others each of whom has many others reporting to them. Technically, an agent is hub-central if its out-links are to agents that have many other agents sending links to them. The scientific name of this measure is hub centrality and it is calculated on agent by agent matrices.
Input network(s): Agent x Agent
Rank Agent Value 1 khalfan_mohamed 0.718 2 ahmed_ghailani 0.624 3 swedan_sheikh 0.574 4 mustafa_fadhil 0.574 5 fahid_msalam 0.574 6 wadih_el-hage 0.176 7 abdullah_ahmed_abdullah 0.149 8 bin_laden 0.139 9 mohammed_odeh 0.102 10 abdal_rahmad 0.084 Authority centrality
A node is authority-central to the extent that its in-links are from nodes that have many out-links. Individuals or organizations that act as authorities are receiving information from a wide range of others each of whom sends information to a large number of others. Technically, an agent is authority-central if its in-links are from agents that have are sending links to many others. The scientific name of this measure is authority centrality and it is calculated on agent by agent matrices.
Input network(s): Agent x Agent
Rank Agent Value 1 swedan_sheikh 0.604 2 mustafa_fadhil 0.604 3 fahid_msalam 0.604 4 ahmed_ghailani 0.591 5 khalfan_mohamed 0.569 6 mohamed_owhali 0.307 7 mohammed_odeh 0.253 8 fazul_mohammed 0.194 9 wadih_el-hage 0.113 10 bin_laden 0.084 Information centrality
Calculate the Stephenson and Zelen information centrality measure for each node.
Input network(s): Agent x Agent
Rank Agent Value Unscaled 1 khalfan_mohamed 0.081 1.509 2 mohamed_owhali 0.081 1.497 3 wadih_el-hage 0.080 1.487 4 ahmed_ghailani 0.072 1.329 5 bin_laden 0.071 1.316 6 abdullah_ahmed_abdullah 0.066 1.218 7 mohammed_odeh 0.063 1.177 8 swedan_sheikh 0.060 1.112 9 mustafa_fadhil 0.060 1.112 10 fahid_msalam 0.060 1.112 Clique membership count
The number of distinct cliques to which each node belongs. Individuals or organizations who are high in number of cliques are those that belong to a large number of distinct cliques. A clique is defined as a group of three or more actors that have many connections to each other and relatively fewer connections to those in other groups. The scientific name of this measure is clique count and it is calculated on the agent by agent matrices.
Input network(s): Agent x Agent
Rank Agent Value 1 mohamed_owhali 5.000 2 wadih_el-hage 4.000 3 mohammed_odeh 3.000 4 bin_laden 3.000 5 khalfan_mohamed 2.000 6 abdullah_ahmed_abdullah 2.000 7 ali_mohamed 1.000 8 ahmed_ghailani 1.000 9 khalid_al-fawwaz 1.000 10 abdal_rahmad 1.000 Simmelian ties
The normalized number of Simmelian ties of each node.
Input network(s): Agent x Agent
Rank Agent Value Unscaled 1 khalfan_mohamed 0.160 4.000 2 ahmed_ghailani 0.160 4.000 3 swedan_sheikh 0.160 4.000 4 mustafa_fadhil 0.160 4.000 5 fahid_msalam 0.160 4.000 6 wadih_el-hage 0.120 3.000 7 bin_laden 0.120 3.000 8 mohamed_owhali 0.080 2.000 9 ali_mohamed 0.080 2.000 10 khalid_al-fawwaz 0.080 2.000 Clustering coefficient
Measures the degree of clustering in a network by averaging the clustering coefficient of each node, which is defined as the density of the node's ego network.
Input network(s): Agent x Agent
Rank Agent Value 1 ali_mohamed 1.000 2 khalid_al-fawwaz 1.000 3 abdal_rahmad 1.000 4 swedan_sheikh 1.000 5 mustafa_fadhil 1.000 6 fahid_msalam 1.000 7 ahmed_ghailani 0.600 8 khalfan_mohamed 0.433 9 bin_laden 0.417 10 mohammed_odeh 0.333 Key Nodes Table
This shows the top scoring nodes side-by-side for selected measures.
Rank Betweenness centrality Closeness centrality Eigenvector centrality Eigenvector centrality per component In-degree centrality In-Closeness centrality Out-degree centrality Total degree centrality 1 mohamed_owhali khalfan_mohamed khalfan_mohamed khalfan_mohamed wadih_el-hage mohamed_owhali khalfan_mohamed wadih_el-hage 2 wadih_el-hage ahmed_ghailani mohamed_owhali mohamed_owhali mohamed_owhali wadih_el-hage wadih_el-hage mohamed_owhali 3 khalfan_mohamed swedan_sheikh ahmed_ghailani ahmed_ghailani khalfan_mohamed mohammed_odeh mohamed_owhali khalfan_mohamed 4 bin_laden mustafa_fadhil swedan_sheikh swedan_sheikh bin_laden bin_laden ahmed_ghailani ahmed_ghailani 5 mohammed_odeh fahid_msalam mustafa_fadhil mustafa_fadhil ahmed_ghailani fazul_mohammed bin_laden bin_laden 6 abdullah_ahmed_abdullah ahmed_the_german fahid_msalam fahid_msalam swedan_sheikh abdullah_ahmed_abdullah swedan_sheikh swedan_sheikh 7 fazul_mohammed mohamed_owhali mohammed_odeh mohammed_odeh mustafa_fadhil abdal_rahmad mustafa_fadhil mustafa_fadhil 8 ahmed_ghailani bin_laden wadih_el-hage wadih_el-hage fahid_msalam ali_mohamed fahid_msalam fahid_msalam 9 ahmed_the_german wadih_el-hage bin_laden bin_laden mohammed_odeh khalid_al-fawwaz abdullah_ahmed_abdullah abdullah_ahmed_abdullah 10 ali_mohamed mohammed_odeh abdullah_ahmed_abdullah abdullah_ahmed_abdullah abdullah_ahmed_abdullah jihad_mohammed_ali mohammed_odeh mohammed_odeh