Standard Network Analysis: Agent x Agent

Standard Network Analysis: Agent x Agent

Input data: Agent x Agent

Start time: Tue Oct 18 11:52:52 2011

Return to table of contents

Network Level Measures

MeasureValue
Row count21.000
Column count21.000
Link count20.000
Density0.048
Components of 1 node (isolates)10
Components of 2 nodes (dyadic isolates)0
Components of 3 or more nodes3
Reciprocity0.818
Characteristic path length1.231
Clustering coefficient0.167
Network levels (diameter)2.000
Network fragmentation0.924
Krackhardt connectedness0.076
Krackhardt efficiency0.625
Krackhardt hierarchy0.375
Krackhardt upperboundedness1.000
Degree centralization0.141
Betweenness centralization0.008
Closeness centralization0.017
Eigenvector centralization0.659
Reciprocal (symmetric)?No (81% of the links are reciprocal)

Node Level Measures

MeasureMinMaxAvgStddev
Total degree centrality0.0000.1750.0480.060
Total degree centrality [Unscaled]0.0007.0001.9052.389
In-degree centrality0.0000.1500.0480.059
In-degree centrality [Unscaled]0.0003.0000.9521.174
Out-degree centrality0.0000.2000.0480.063
Out-degree centrality [Unscaled]0.0004.0000.9521.253
Eigenvector centrality0.0000.7400.1440.273
Eigenvector centrality [Unscaled]0.0000.5240.1020.193
Eigenvector centrality per component0.0000.1250.0470.049
Closeness centrality0.0480.0590.0510.004
Closeness centrality [Unscaled]0.0020.0030.0030.000
In-Closeness centrality0.0480.0580.0510.004
In-Closeness centrality [Unscaled]0.0020.0030.0030.000
Betweenness centrality0.0000.0080.0010.002
Betweenness centrality [Unscaled]0.0003.0000.2860.765
Hub centrality0.0000.7760.1340.278
Authority centrality0.0000.7030.1450.273
Information centrality-0.0000.1670.0480.068
Information centrality [Unscaled]-0.0000.000-0.0000.000
Clique membership count0.0001.0000.1900.393
Simmelian ties0.0000.1500.0290.059
Simmelian ties [Unscaled]0.0003.0000.5711.178
Clustering coefficient0.0001.0000.1670.356

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: 21, density: 0.047619)

RankAgentValueUnscaledContext*
1ahmed_ghailani0.1757.0002.741
2swedan_sheikh0.1506.0002.203
3mustafa_fadhil0.1506.0002.203
4fahid_msalam0.1506.0002.203
5bin_laden0.1004.0001.127
6abdullah_ahmed_abdullah0.0753.0000.589
7ali_mohamed0.0502.0000.051
8khalid_al-fawwaz0.0502.0000.051
9abdal_rahmad0.0502.0000.051
10ahmed_the_german0.0251.000-0.487

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

Mean: 0.048Mean in random network: 0.048
Std.dev: 0.060Std.dev in random network: 0.046

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
1ahmed_ghailani0.1503.000
2swedan_sheikh0.1503.000
3mustafa_fadhil0.1503.000
4fahid_msalam0.1503.000
5bin_laden0.1002.000
6abdullah_ahmed_abdullah0.1002.000
7fazul_mohammed0.0501.000
8ali_mohamed0.0501.000
9khalid_al-fawwaz0.0501.000
10abdal_rahmad0.0501.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
1ahmed_ghailani0.2004.000
2swedan_sheikh0.1503.000
3mustafa_fadhil0.1503.000
4fahid_msalam0.1503.000
5bin_laden0.1002.000
6ahmed_the_german0.0501.000
7ali_mohamed0.0501.000
8khalid_al-fawwaz0.0501.000
9abdullah_ahmed_abdullah0.0501.000
10abdal_rahmad0.0501.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: 21, density: 0.047619)

RankAgentValueUnscaledContext*
1ahmed_ghailani0.7400.5241.293
2swedan_sheikh0.6820.4821.124
3mustafa_fadhil0.6820.4821.124
4fahid_msalam0.6820.4821.124
5fazul_mohammed0.2400.170-0.153
6ahmed_the_german0.0000.000-0.846
7bin_laden0.0000.000-0.846
8ali_mohamed0.0000.000-0.846
9khalid_al-fawwaz0.0000.000-0.846
10abdullah_ahmed_abdullah0.0000.000-0.846

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

Mean: 0.144Mean in random network: 0.293
Std.dev: 0.273Std.dev in random network: 0.346

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
1ahmed_ghailani0.125
2swedan_sheikh0.115
3mustafa_fadhil0.115
4fahid_msalam0.115
5bin_laden0.101
6abdullah_ahmed_abdullah0.101
7ahmed_the_german0.071
8ali_mohamed0.071
9khalid_al-fawwaz0.071
10abdal_rahmad0.071

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: 21, density: 0.047619)

RankAgentValueUnscaledContext*
1ahmed_ghailani0.0590.0030.793
2swedan_sheikh0.0590.0030.781
3mustafa_fadhil0.0590.0030.781
4fahid_msalam0.0590.0030.781
5bin_laden0.0530.0030.356
6ahmed_the_german0.0520.0030.347
7ali_mohamed0.0520.0030.347
8khalid_al-fawwaz0.0520.0030.347
9abdullah_ahmed_abdullah0.0500.0020.171
10abdal_rahmad0.0500.0020.171

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

Mean: 0.051Mean in random network: 0.048
Std.dev: 0.004Std.dev in random network: 0.014

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
1fazul_mohammed0.0580.003
2ahmed_ghailani0.0560.003
3swedan_sheikh0.0560.003
4mustafa_fadhil0.0560.003
5fahid_msalam0.0560.003
6bin_laden0.0530.003
7abdullah_ahmed_abdullah0.0530.003
8ali_mohamed0.0520.003
9khalid_al-fawwaz0.0520.003
10abdal_rahmad0.0520.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: 21, density: 0.047619)

RankAgentValueUnscaledContext*
1ahmed_ghailani0.0083.000-0.366
2bin_laden0.0052.000-0.374
3abdullah_ahmed_abdullah0.0031.000-0.383

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

Mean: 0.001Mean in random network: 0.122
Std.dev: 0.002Std.dev in random network: 0.312

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
1ahmed_ghailani0.776
2swedan_sheikh0.682
3mustafa_fadhil0.682
4fahid_msalam0.682
5ahmed_the_german0.000
6bin_laden0.000
7ali_mohamed0.000
8khalid_al-fawwaz0.000
9abdal_rahmad0.000
10abdullah_ahmed_abdullah0.000

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.703
2mustafa_fadhil0.703
3fahid_msalam0.703
4ahmed_ghailani0.672
5fazul_mohammed0.255
6bin_laden0.000
7ali_mohamed0.000
8khalid_al-fawwaz0.000
9abdullah_ahmed_abdullah0.000
10abdal_rahmad0.000

Back to top

Information centrality

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

Input network(s): Agent x Agent

RankAgentValue
1swedan_sheikh0.167
2mustafa_fadhil0.167
3fahid_msalam0.167
4ahmed_ghailani0.167
5ahmed_the_german0.167
6khalid_al-fawwaz0.037
7bin_laden0.037
8ali_mohamed0.037
9abdal_rahmad0.027
10abdullah_ahmed_abdullah0.027

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
1ahmed_ghailani1.000
2swedan_sheikh1.000
3mustafa_fadhil1.000
4fahid_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.1503.000
2swedan_sheikh0.1503.000
3mustafa_fadhil0.1503.000
4fahid_msalam0.1503.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
1swedan_sheikh1.000
2mustafa_fadhil1.000
3fahid_msalam1.000
4ahmed_ghailani0.500

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
1ahmed_ghailaniahmed_ghailaniahmed_ghailaniahmed_ghailaniahmed_ghailanifazul_mohammedahmed_ghailaniahmed_ghailani
2bin_ladenswedan_sheikhswedan_sheikhswedan_sheikhswedan_sheikhahmed_ghailaniswedan_sheikhswedan_sheikh
3abdullah_ahmed_abdullahmustafa_fadhilmustafa_fadhilmustafa_fadhilmustafa_fadhilswedan_sheikhmustafa_fadhilmustafa_fadhil
4ahmed_the_germanfahid_msalamfahid_msalamfahid_msalamfahid_msalammustafa_fadhilfahid_msalamfahid_msalam
5fazul_mohammedbin_ladenfazul_mohammedbin_ladenbin_ladenfahid_msalambin_ladenbin_laden
6ali_mohamedahmed_the_germanahmed_the_germanabdullah_ahmed_abdullahabdullah_ahmed_abdullahbin_ladenahmed_the_germanabdullah_ahmed_abdullah
7mohammed_salimali_mohamedbin_ladenahmed_the_germanfazul_mohammedabdullah_ahmed_abdullahali_mohamedali_mohamed
8jamal_al-fadlkhalid_al-fawwazali_mohamedali_mohamedali_mohamedali_mohamedkhalid_al-fawwazkhalid_al-fawwaz
9khalid_al-fawwazabdullah_ahmed_abdullahkhalid_al-fawwazkhalid_al-fawwazkhalid_al-fawwazkhalid_al-fawwazabdullah_ahmed_abdullahabdal_rahmad
10jihad_mohammed_aliabdal_rahmadabdullah_ahmed_abdullahabdal_rahmadabdal_rahmadabdal_rahmadabdal_rahmadahmed_the_german