Standard Network Analysis: agent x agent

Standard Network Analysis: agent x agent

Input data: agent x agent

Start time: Tue Oct 18 11:48:35 2011

Return to table of contents

Network Level Measures

MeasureValue
Row count27.000
Column count27.000
Link count53.000
Density0.075
Components of 1 node (isolates)10
Components of 2 nodes (dyadic isolates)0
Components of 3 or more nodes1
Reciprocity0.767
Characteristic path length2.189
Clustering coefficient0.311
Network levels (diameter)4.000
Network fragmentation0.613
Krackhardt connectedness0.387
Krackhardt efficiency0.883
Krackhardt hierarchy0.504
Krackhardt upperboundedness0.958
Degree centralization0.188
Betweenness centralization0.104
Closeness centralization0.056
Eigenvector centralization0.452
Reciprocal (symmetric)?No (76% of the links are reciprocal)

Node Level Measures

MeasureMinMaxAvgStddev
Total degree centrality0.0000.2500.0750.077
Total degree centrality [Unscaled]0.00013.0003.9264.027
In-degree centrality0.0000.2690.0750.079
In-degree centrality [Unscaled]0.0007.0001.9632.045
Out-degree centrality0.0000.2310.0750.078
Out-degree centrality [Unscaled]0.0006.0001.9632.027
Eigenvector centrality0.0000.6080.1890.196
Eigenvector centrality [Unscaled]0.0000.4300.1340.138
Eigenvector centrality per component0.0000.2710.0840.087
Closeness centrality0.0370.0800.0540.015
Closeness centrality [Unscaled]0.0010.0030.0020.001
In-Closeness centrality0.0370.0870.0580.023
In-Closeness centrality [Unscaled]0.0010.0030.0020.001
Betweenness centrality0.0000.1140.0130.029
Betweenness centrality [Unscaled]0.00074.0008.63018.621
Hub centrality0.0000.7180.1490.228
Authority centrality0.0000.6040.1570.223
Information centrality0.0000.0820.0370.031
Information centrality [Unscaled]0.0001.5420.6980.582
Clique membership count0.0005.0000.9631.347
Simmelian ties0.0000.1540.0510.062
Simmelian ties [Unscaled]0.0004.0001.3331.610
Clustering coefficient0.0001.0000.3110.401

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: 27, density: 0.0754986)

RankAgentValueUnscaledContext*
1wadih_el-hage0.25013.0003.432
2mohamed_owhali0.21211.0002.676
3khalfan_mohamed0.19210.0002.297
4ahmed_ghailani0.1739.0001.919
5bin_laden0.1548.0001.541
6swedan_sheikh0.1548.0001.541
7mustafa_fadhil0.1548.0001.541
8fahid_msalam0.1548.0001.541
9abdullah_ahmed_abdullah0.1156.0000.784
10mohammed_odeh0.0965.0000.406

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

Mean: 0.075Mean in random network: 0.075
Std.dev: 0.077Std.dev in random network: 0.051

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
1wadih_el-hage0.2697.000
2mohamed_owhali0.2316.000
3khalfan_mohamed0.1544.000
4bin_laden0.1544.000
5ahmed_ghailani0.1544.000
6swedan_sheikh0.1544.000
7mustafa_fadhil0.1544.000
8fahid_msalam0.1544.000
9mohammed_odeh0.1153.000
10abdullah_ahmed_abdullah0.1153.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
1khalfan_mohamed0.2316.000
2wadih_el-hage0.2316.000
3mohamed_owhali0.1925.000
4ahmed_ghailani0.1925.000
5bin_laden0.1544.000
6swedan_sheikh0.1544.000
7mustafa_fadhil0.1544.000
8fahid_msalam0.1544.000
9abdullah_ahmed_abdullah0.1153.000
10mohammed_odeh0.0772.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: 27, density: 0.0754986)

RankAgentValueUnscaledContext*
1khalfan_mohamed0.6080.4300.935
2mohamed_owhali0.4880.3450.533
3ahmed_ghailani0.4820.3410.513
4swedan_sheikh0.4460.3160.392
5mustafa_fadhil0.4460.3160.392
6fahid_msalam0.4460.3160.392
7mohammed_odeh0.3890.2750.200
8wadih_el-hage0.3860.2730.189
9bin_laden0.2630.186-0.226
10abdullah_ahmed_abdullah0.2470.175-0.277

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

Mean: 0.189Mean in random network: 0.330
Std.dev: 0.196Std.dev in random network: 0.297

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.271
2mohamed_owhali0.217
3ahmed_ghailani0.215
4swedan_sheikh0.199
5mustafa_fadhil0.199
6fahid_msalam0.199
7mohammed_odeh0.173
8wadih_el-hage0.172
9bin_laden0.117
10abdullah_ahmed_abdullah0.110

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: 27, density: 0.0754986)

RankAgentValueUnscaledContext*
1khalfan_mohamed0.0800.003-3.233
2ahmed_ghailani0.0790.003-3.261
3swedan_sheikh0.0780.003-3.289
4mustafa_fadhil0.0780.003-3.289
5fahid_msalam0.0780.003-3.289
6ahmed_the_german0.0590.002-3.711
7mohamed_owhali0.0580.002-3.742
8bin_laden0.0580.002-3.745
9wadih_el-hage0.0580.002-3.748
10mohammed_odeh0.0580.002-3.751

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

Mean: 0.054Mean in random network: 0.221
Std.dev: 0.015Std.dev in random network: 0.043

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
1mohamed_owhali0.0870.003
2wadih_el-hage0.0870.003
3mohammed_odeh0.0870.003
4bin_laden0.0860.003
5fazul_mohammed0.0850.003
6abdullah_ahmed_abdullah0.0840.003
7abdal_rahmad0.0840.003
8ali_mohamed0.0830.003
9khalid_al-fawwaz0.0830.003
10jihad_mohammed_ali0.0830.003

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: 27, density: 0.0754986)

RankAgentValueUnscaledContext*
1mohamed_owhali0.11474.0000.186
2wadih_el-hage0.09662.5000.086
3khalfan_mohamed0.04932.000-0.180
4bin_laden0.03321.500-0.272
5mohammed_odeh0.02415.500-0.324
6abdullah_ahmed_abdullah0.01812.000-0.355
7fazul_mohammed0.0128.000-0.389
8ahmed_ghailani0.0127.500-0.394

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

Mean: 0.013Mean in random network: 0.081
Std.dev: 0.029Std.dev in random network: 0.176

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
1khalfan_mohamed0.718
2ahmed_ghailani0.624
3swedan_sheikh0.574
4mustafa_fadhil0.574
5fahid_msalam0.574
6wadih_el-hage0.176
7abdullah_ahmed_abdullah0.149
8bin_laden0.139
9mohammed_odeh0.102
10abdal_rahmad0.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
1swedan_sheikh0.604
2mustafa_fadhil0.604
3fahid_msalam0.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

Information centrality

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

Input network(s): agent x agent

RankAgentValueUnscaled
1khalfan_mohamed0.0821.542
2mohamed_owhali0.0811.530
3wadih_el-hage0.0811.520
4ahmed_ghailani0.0721.355
5bin_laden0.0711.341
6abdullah_ahmed_abdullah0.0661.240
7mohammed_odeh0.0631.197
8swedan_sheikh0.0601.130
9mustafa_fadhil0.0601.130
10fahid_msalam0.0601.130

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
3mohammed_odeh3.000
4bin_laden3.000
5khalfan_mohamed2.000
6abdullah_ahmed_abdullah2.000
7ali_mohamed1.000
8ahmed_ghailani1.000
9khalid_al-fawwaz1.000
10abdal_rahmad1.000

Back to top

Simmelian ties

The normalized number of Simmelian ties of each node.

Input network(s): agent x agent

RankAgentValueUnscaled
1khalfan_mohamed0.1544.000
2ahmed_ghailani0.1544.000
3swedan_sheikh0.1544.000
4mustafa_fadhil0.1544.000
5fahid_msalam0.1544.000
6wadih_el-hage0.1153.000
7bin_laden0.1153.000
8mohamed_owhali0.0772.000
9ali_mohamed0.0772.000
10khalid_al-fawwaz0.0772.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
1ali_mohamed1.000
2khalid_al-fawwaz1.000
3abdal_rahmad1.000
4swedan_sheikh1.000
5mustafa_fadhil1.000
6fahid_msalam1.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_owhalikhalfan_mohamedkhalfan_mohamedkhalfan_mohamedwadih_el-hagemohamed_owhalikhalfan_mohamedwadih_el-hage
2wadih_el-hageahmed_ghailanimohamed_owhalimohamed_owhalimohamed_owhaliwadih_el-hagewadih_el-hagemohamed_owhali
3khalfan_mohamedswedan_sheikhahmed_ghailaniahmed_ghailanikhalfan_mohamedmohammed_odehmohamed_owhalikhalfan_mohamed
4bin_ladenmustafa_fadhilswedan_sheikhswedan_sheikhbin_ladenbin_ladenahmed_ghailaniahmed_ghailani
5mohammed_odehfahid_msalammustafa_fadhilmustafa_fadhilahmed_ghailanifazul_mohammedbin_ladenbin_laden
6abdullah_ahmed_abdullahahmed_the_germanfahid_msalamfahid_msalamswedan_sheikhabdullah_ahmed_abdullahswedan_sheikhswedan_sheikh
7fazul_mohammedmohamed_owhalimohammed_odehmohammed_odehmustafa_fadhilabdal_rahmadmustafa_fadhilmustafa_fadhil
8ahmed_ghailanibin_ladenwadih_el-hagewadih_el-hagefahid_msalamali_mohamedfahid_msalamfahid_msalam
9ahmed_the_germanwadih_el-hagebin_ladenbin_ladenmohammed_odehkhalid_al-fawwazabdullah_ahmed_abdullahabdullah_ahmed_abdullah
10ali_mohamedmohammed_odehabdullah_ahmed_abdullahabdullah_ahmed_abdullahabdullah_ahmed_abdullahjihad_mohammed_alimohammed_odehmohammed_odeh