Standard Network Analysis: Agent x Agent

Standard Network Analysis: Agent x Agent

Input data: Agent x Agent

Start time: Tue Oct 18 11:55:21 2011

Return to table of contents

Network Level Measures

MeasureValue
Row count30.000
Column count30.000
Link count53.000
Density0.061
Components of 1 node (isolates)13
Components of 2 nodes (dyadic isolates)0
Components of 3 or more nodes1
Reciprocity0.767
Characteristic path length2.189
Clustering coefficient0.280
Network levels (diameter)4.000
Network fragmentation0.687
Krackhardt connectedness0.313
Krackhardt efficiency0.883
Krackhardt hierarchy0.504
Krackhardt upperboundedness1.000
Degree centralization0.175
Betweenness centralization0.084
Closeness centralization0.047
Eigenvector centralization0.469
Reciprocal (symmetric)?No (76% of the links are reciprocal)

Node Level Measures

MeasureMinMaxAvgStddev
Total degree centrality0.0000.2240.0610.069
Total degree centrality [Unscaled]0.00013.0003.5333.998
In-degree centrality0.0000.2070.0610.069
In-degree centrality [Unscaled]0.0006.0001.7672.011
Out-degree centrality0.0000.2410.0610.070
Out-degree centrality [Unscaled]0.0007.0001.7672.028
Eigenvector centrality0.0000.6080.1700.194
Eigenvector centrality [Unscaled]0.0000.4300.1200.137
Eigenvector centrality per component0.0000.2430.0680.078
Closeness centrality0.0330.0690.0470.016
Closeness centrality [Unscaled]0.0010.0020.0020.001
In-Closeness centrality0.0330.0650.0450.011
In-Closeness centrality [Unscaled]0.0010.0020.0020.000
Betweenness centrality0.0000.0910.0100.022
Betweenness centrality [Unscaled]0.00074.0007.76717.854
Hub centrality0.0000.6040.1410.216
Authority centrality0.0000.7180.1340.221
Information centrality0.0000.0990.0330.034
Information centrality [Unscaled]0.0001.6710.5620.570
Clique membership count0.0005.0000.8671.310
Simmelian ties0.0000.1380.0410.054
Simmelian ties [Unscaled]0.0004.0001.2001.579
Clustering coefficient0.0001.0000.2800.392

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: 30, density: 0.0609195)

RankAgentValueUnscaledContext*
1wadih_el-hage0.22413.0003.738
2mohamed_owhali0.19011.0002.948
3khalfan_mohamed0.17210.0002.553
4ahmed_ghailani0.1559.0002.158
5bin_laden0.1388.0001.764
6fahid_msalam0.1388.0001.764
7mustafa_fadhil0.1388.0001.764
8swedan_sheikh0.1388.0001.764
9abdullah_ahmed_abdullah0.1036.0000.974
10mohammed_odeh0.0865.0000.579

* Number of standard deviations from the mean of a random network of the same size and density

Mean: 0.061Mean in random network: 0.061
Std.dev: 0.069Std.dev in random network: 0.044

Back to top

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

RankAgentValueUnscaled
1khalfan_mohamed0.2076.000
2wadih_el-hage0.2076.000
3ahmed_ghailani0.1725.000
4mohamed_owhali0.1725.000
5bin_laden0.1384.000
6fahid_msalam0.1384.000
7mustafa_fadhil0.1384.000
8swedan_sheikh0.1384.000
9abdullah_ahmed_abdullah0.1033.000
10abdal_rahmad0.0692.000

Back to top

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

RankAgentValueUnscaled
1wadih_el-hage0.2417.000
2mohamed_owhali0.2076.000
3ahmed_ghailani0.1384.000
4bin_laden0.1384.000
5fahid_msalam0.1384.000
6khalfan_mohamed0.1384.000
7mustafa_fadhil0.1384.000
8swedan_sheikh0.1384.000
9abdullah_ahmed_abdullah0.1033.000
10mohammed_odeh0.1033.000

Back to top

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: 30, density: 0.0609195)

RankAgentValueUnscaledContext*
1khalfan_mohamed0.6080.4301.028
2mohamed_owhali0.4880.3450.624
3ahmed_ghailani0.4820.3410.605
4mustafa_fadhil0.4460.3160.483
5swedan_sheikh0.4460.3160.483
6fahid_msalam0.4460.3160.483
7mohammed_odeh0.3890.2750.290
8wadih_el-hage0.3860.2730.279
9bin_laden0.2630.186-0.138
10abdullah_ahmed_abdullah0.2470.175-0.189

* Number of standard deviations from the mean of a random network of the same size and density

Mean: 0.170Mean in random network: 0.303
Std.dev: 0.194Std.dev in random network: 0.296

Back to top

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

RankAgentValue
1khalfan_mohamed0.243
2mohamed_owhali0.196
3ahmed_ghailani0.193
4mustafa_fadhil0.179
5swedan_sheikh0.179
6fahid_msalam0.179
7mohammed_odeh0.156
8wadih_el-hage0.155
9bin_laden0.105
10abdullah_ahmed_abdullah0.099

Back to top

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: 30, density: 0.0609195)

RankAgentValueUnscaledContext*
1mohamed_owhali0.0690.002-3.551
2wadih_el-hage0.0690.002-3.556
3mohammed_odeh0.0690.002-3.562
4bin_laden0.0690.002-3.578
5fazul_mohammed0.0680.002-3.588
6abdullah_ahmed_abdullah0.0670.002-3.614
7abdal_rahmad0.0670.002-3.619
8ali_mohamed0.0670.002-3.629
9jihad_mohammed_ali0.0670.002-3.629
10khalid_al-fawwaz0.0670.002-3.629

* Number of standard deviations from the mean of a random network of the same size and density

Mean: 0.047Mean in random network: 0.179
Std.dev: 0.016Std.dev in random network: 0.031

Back to top

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

RankAgentValueUnscaled
1khalfan_mohamed0.0650.002
2ahmed_ghailani0.0640.002
3fahid_msalam0.0630.002
4mustafa_fadhil0.0630.002
5swedan_sheikh0.0630.002
6ahmed_the_german0.0510.002
7mohamed_owhali0.0500.002
8bin_laden0.0490.002
9wadih_el-hage0.0490.002
10mohammed_odeh0.0490.002

Back to top

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: 30, density: 0.0609195)

RankAgentValueUnscaledContext*
1mohamed_owhali0.09174.0000.052
2wadih_el-hage0.07762.500-0.006
3khalfan_mohamed0.03932.000-0.160
4bin_laden0.02621.500-0.213
5mohammed_odeh0.01915.500-0.243
6abdullah_ahmed_abdullah0.01512.000-0.261
7fazul_mohammed0.0108.000-0.281
8ahmed_ghailani0.0097.500-0.283

* Number of standard deviations from the mean of a random network of the same size and density

Mean: 0.010Mean in random network: 0.078
Std.dev: 0.022Std.dev in random network: 0.244

Back to top

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

RankAgentValue
1fahid_msalam0.604
2mustafa_fadhil0.604
3swedan_sheikh0.604
4ahmed_ghailani0.591
5khalfan_mohamed0.569
6mohamed_owhali0.307
7mohammed_odeh0.253
8fazul_mohammed0.194
9wadih_el-hage0.113
10bin_laden0.084

Back to top

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

RankAgentValue
1khalfan_mohamed0.718
2ahmed_ghailani0.624
3fahid_msalam0.574
4mustafa_fadhil0.574
5swedan_sheikh0.574
6wadih_el-hage0.176
7abdullah_ahmed_abdullah0.149
8bin_laden0.139
9mohammed_odeh0.102
10abdal_rahmad0.084

Back to top

Information centrality

Calculate the Stephenson and Zelen information centrality measure for each node.

Input network(s): Agent x Agent

RankAgentValueUnscaled
1mohamed_owhali0.0991.671
2wadih_el-hage0.0941.586
3mohammed_odeh0.0891.492
4bin_laden0.0731.226
5fazul_mohammed0.0711.205
6abdullah_ahmed_abdullah0.0711.194
7khalfan_mohamed0.0560.943
8abdal_rahmad0.0550.921
9ali_mohamed0.0540.911
10khalid_al-fawwaz0.0540.911

Back to top

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

RankAgentValue
1mohamed_owhali5.000
2wadih_el-hage4.000
3bin_laden3.000
4mohammed_odeh3.000
5abdullah_ahmed_abdullah2.000
6khalfan_mohamed2.000
7abdal_rahmad1.000
8ahmed_ghailani1.000
9ali_mohamed1.000
10fahid_msalam1.000

Back to top

Simmelian ties

The normalized number of Simmelian ties of each node.

Input network(s): Agent x Agent

RankAgentValueUnscaled
1ahmed_ghailani0.1384.000
2fahid_msalam0.1384.000
3khalfan_mohamed0.1384.000
4mustafa_fadhil0.1384.000
5swedan_sheikh0.1384.000
6bin_laden0.1033.000
7wadih_el-hage0.1033.000
8abdal_rahmad0.0692.000
9abdullah_ahmed_abdullah0.0692.000
10ali_mohamed0.0692.000

Back to top

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

RankAgentValue
1abdal_rahmad1.000
2ali_mohamed1.000
3fahid_msalam1.000
4khalid_al-fawwaz1.000
5mustafa_fadhil1.000
6swedan_sheikh1.000
7ahmed_ghailani0.600
8khalfan_mohamed0.433
9bin_laden0.417
10mohammed_odeh0.333

Back to top

Key Nodes Table

This shows the top scoring nodes side-by-side for selected measures.

RankBetweenness centralityCloseness centralityEigenvector centralityEigenvector centrality per componentIn-degree centralityIn-Closeness centralityOut-degree centralityTotal degree centrality
1mohamed_owhalimohamed_owhalikhalfan_mohamedkhalfan_mohamedkhalfan_mohamedkhalfan_mohamedwadih_el-hagewadih_el-hage
2wadih_el-hagewadih_el-hagemohamed_owhalimohamed_owhaliwadih_el-hageahmed_ghailanimohamed_owhalimohamed_owhali
3khalfan_mohamedmohammed_odehahmed_ghailaniahmed_ghailaniahmed_ghailanifahid_msalamahmed_ghailanikhalfan_mohamed
4bin_ladenbin_ladenmustafa_fadhilmustafa_fadhilmohamed_owhalimustafa_fadhilbin_ladenahmed_ghailani
5mohammed_odehfazul_mohammedswedan_sheikhswedan_sheikhbin_ladenswedan_sheikhfahid_msalambin_laden
6abdullah_ahmed_abdullahabdullah_ahmed_abdullahfahid_msalamfahid_msalamfahid_msalamahmed_the_germankhalfan_mohamedfahid_msalam
7fazul_mohammedabdal_rahmadmohammed_odehmohammed_odehmustafa_fadhilmohamed_owhalimustafa_fadhilmustafa_fadhil
8ahmed_ghailaniali_mohamedwadih_el-hagewadih_el-hageswedan_sheikhbin_ladenswedan_sheikhswedan_sheikh
9abdal_rahmadjihad_mohammed_alibin_ladenbin_ladenabdullah_ahmed_abdullahwadih_el-hageabdullah_ahmed_abdullahabdullah_ahmed_abdullah
10adel_mohammed_abdul_almagid_barykhalid_al-fawwazabdullah_ahmed_abdullahabdullah_ahmed_abdullahabdal_rahmadmohammed_odehmohammed_odehmohammed_odeh