STANDARD NETWORK ANALYSIS REPORT

STANDARD NETWORK ANALYSIS REPORT

Input data: Gleiser_comics_weighted_network - 4

Start time: Mon Oct 17 13:43:22 2011

Data Description

Calculates common social network measures on each selected input network.

Network network

Network Level Measures

MeasureValue
Row count165.000
Column count165.000
Link count300.000
Density0.022
Components of 1 node (isolates)0
Components of 2 nodes (dyadic isolates)9
Components of 3 or more nodes10
Reciprocity1.000
Characteristic path length3.880
Clustering coefficient0.495
Network levels (diameter)9.000
Network fragmentation0.528
Krackhardt connectedness0.472
Krackhardt efficiency0.975
Krackhardt hierarchy0.000
Krackhardt upperboundedness1.000
Degree centralization0.138
Betweenness centralization0.321
Closeness centralization0.008
Eigenvector centralization0.505
Reciprocal (symmetric)?Yes

Node Level Measures

MeasureMinMaxAvgStddev
Total degree centrality0.0060.1590.0220.023
Total degree centrality [Unscaled]1.00026.0003.6363.758
In-degree centrality0.0060.1590.0220.023
In-degree centrality [Unscaled]1.00026.0003.6363.758
Out-degree centrality0.0060.1590.0220.023
Out-degree centrality [Unscaled]1.00026.0003.6363.758
Eigenvector centrality0.0000.5460.0480.099
Eigenvector centrality [Unscaled]0.0000.3860.0340.070
Eigenvector centrality per component0.0000.2650.0260.047
Closeness centrality0.0060.0190.0140.006
Closeness centrality [Unscaled]0.0000.0000.0000.000
In-Closeness centrality0.0060.0190.0140.006
In-Closeness centrality [Unscaled]0.0000.0000.0000.000
Betweenness centrality0.0000.3280.0080.034
Betweenness centrality [Unscaled]0.0004379.889111.491450.488
Hub centrality0.0000.5460.0480.099
Authority centrality0.0000.5460.0480.099
Information centrality0.0010.0080.0060.002
Information centrality [Unscaled]0.0000.0000.0000.000
Clique membership count0.00012.0001.1451.608
Simmelian ties0.0000.1160.0180.021
Simmelian ties [Unscaled]0.00019.0002.9213.411
Clustering coefficient0.0001.0000.4950.451

Key Nodes

This chart shows the Source nodes that is repeatedly top-ranked in the measures listed below. The value shown is the percentage of measures for which the Source nodes 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: network (size: 165, density: 0.0221729)

RankSource nodesValueUnscaledContext*
1*CAPTAINAMERICA*0.15926.00011.896
2*SPIDER-MAN*0.11619.0008.172
3*IRONMAN*0.11619.0008.172
4*THOR*0.11018.0007.640
5*HUMANTORCH*0.06110.0003.385
6*THING*0.06110.0003.385
7*HULK*0.06110.0003.385
8*SCARLETWITCH*0.06110.0003.385
9*WOLVERINE*0.06110.0003.385
10*HAWK*0.06110.0003.385

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

Mean: 0.022Mean in random network: 0.022
Std.dev: 0.023Std.dev in random network: 0.011

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): network

RankSource nodesValueUnscaled
1*CAPTAINAMERICA*0.15926.000
2*SPIDER-MAN*0.11619.000
3*IRONMAN*0.11619.000
4*THOR*0.11018.000
5*HUMANTORCH*0.06110.000
6*THING*0.06110.000
7*HULK*0.06110.000
8*SCARLETWITCH*0.06110.000
9*WOLVERINE*0.06110.000
10*HAWK*0.06110.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): network

RankSource nodesValueUnscaled
1*CAPTAINAMERICA*0.15926.000
2*SPIDER-MAN*0.11619.000
3*IRONMAN*0.11619.000
4*THOR*0.11018.000
5*HUMANTORCH*0.06110.000
6*THING*0.06110.000
7*HULK*0.06110.000
8*SCARLETWITCH*0.06110.000
9*WOLVERINE*0.06110.000
10*HAWK*0.06110.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: network (size: 165, density: 0.0221729)

RankSource nodesValueUnscaledContext*
1*CAPTAINAMERICA*0.5460.386-4.403
2*IRONMAN*0.4730.334-4.793
3*THOR*0.4640.328-4.837
4*SCARLETWITCH*0.4110.290-5.121
5*VISION*0.3970.280-5.196
6*WASP*0.3970.280-5.196
7*HAWK*0.3860.273-5.250
8*ANT-MAN*0.3680.260-5.347
9*WONDERMAN*0.3230.228-5.587
10*JARVIS*0.2910.206-5.753

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

Mean: 0.048Mean in random network: 1.378
Std.dev: 0.099Std.dev in random network: 0.189

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): network

RankSource nodesValue
1*CAPTAINAMERICA*0.265
2*IRONMAN*0.229
3*THOR*0.225
4*SCARLETWITCH*0.199
5*VISION*0.192
6*WASP*0.192
7*HAWK*0.187
8*ANT-MAN*0.178
9*WONDERMAN*0.156
10*JARVIS*0.141

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: network (size: 165, density: 0.0221729)

RankSource nodesValueUnscaledContext*
1*CAPTAINAMERICA*0.0190.0008.489
2*IRONMAN*0.0180.0008.499
3*SPIDER-MAN*0.0180.0008.501
4*SUB-MARINER*0.0180.0008.503
5*THOR*0.0180.0008.504
6*BEAST*0.0180.0008.504
7*SCARLETWITCH*0.0180.0008.506
8*HAWK*0.0180.0008.506
9*WASP*0.0180.0008.506
10*VISION*0.0180.0008.506

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

Mean: 0.014Mean in random network: 0.104
Std.dev: 0.006Std.dev in random network: -0.010

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): network

RankSource nodesValueUnscaled
1*CAPTAINAMERICA*0.0190.000
2*IRONMAN*0.0180.000
3*SPIDER-MAN*0.0180.000
4*SUB-MARINER*0.0180.000
5*THOR*0.0180.000
6*BEAST*0.0180.000
7*SCARLETWITCH*0.0180.000
8*HAWK*0.0180.000
9*WASP*0.0180.000
10*VISION*0.0180.000

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: network (size: 165, density: 0.0221729)

RankSource nodesValueUnscaledContext*
1*CAPTAINAMERICA*0.3284379.8897.962
2*SPIDER-MAN*0.1502002.9443.408
3*SUB-MARINER*0.1401877.0003.167
4*HULK*0.1271701.0002.830
5*BEAST*0.1091455.0002.359
6*IRONMAN*0.0801068.1531.618
7*THOR*0.0791056.8331.596
8*DR.STRANGE*0.049650.0000.817
9*THING*0.031420.0120.376
10*CYCLOPS*0.031411.6670.360

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

Mean: 0.008Mean in random network: 0.017
Std.dev: 0.034Std.dev in random network: 0.039

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): network

RankSource nodesValue
1*CAPTAINAMERICA*0.546
2*IRONMAN*0.473
3*THOR*0.464
4*SCARLETWITCH*0.411
5*WASP*0.397
6*VISION*0.397
7*HAWK*0.386
8*ANT-MAN*0.368
9*WONDERMAN*0.323
10*JARVIS*0.291

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): network

RankSource nodesValue
1*CAPTAINAMERICA*0.546
2*IRONMAN*0.473
3*THOR*0.464
4*SCARLETWITCH*0.411
5*WASP*0.397
6*VISION*0.397
7*HAWK*0.386
8*ANT-MAN*0.368
9*WONDERMAN*0.323
10*JARVIS*0.291

Back to top

Information centrality

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

Input network(s): network

RankSource nodesValueUnscaled
1*CAPTAINAMERICA*0.0080.000
2*HUMANTORCH*0.0080.000
3*THING*0.0080.000
4*MR.FANTASTIC*0.0080.000
5*IRONMAN*0.0080.000
6*THOR*0.0080.000
7*SPIDER-MAN*0.0080.000
8*INVISIBLEWOMAN*0.0080.000
9*ANT-MAN*0.0080.000
10*WASP*0.0080.000

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): network

RankSource nodesValue
1*CAPTAINAMERICA*12.000
2*MR.FANTASTIC*7.000
3*IRONMAN*7.000
4*THING*6.000
5*THOR*6.000
6*HUMANTORCH*5.000
7*SPIDER-MAN*4.000
8*INVISIBLEWOMAN*4.000
9*SCARLETWITCH*4.000
10*STORM*4.000

Back to top

Simmelian ties

The normalized number of Simmelian ties of each node.

Input network(s): network

RankSource nodesValueUnscaled
1*CAPTAINAMERICA*0.11619.000
2*THOR*0.10417.000
3*IRONMAN*0.08514.000
4*SCARLETWITCH*0.06110.000
5*SPIDER-MAN*0.0559.000
6*THING*0.0559.000
7*MR.FANTASTIC*0.0559.000
8*WASP*0.0559.000
9*CYCLOPS*0.0559.000
10*VISION*0.0559.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): network

RankSource nodesValue
1*NELSON*1.000
2*KA-ZAR*1.000
3*ZABU*1.000
4*ROBERTSON*1.000
5*WONG*1.000
6*CLEA*1.000
7*PAGE*1.000
8*THOMPSON*1.000
9*FALCON*1.000
10*MASTERS*1.000

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
1*CAPTAINAMERICA**CAPTAINAMERICA**CAPTAINAMERICA**CAPTAINAMERICA**CAPTAINAMERICA**CAPTAINAMERICA**CAPTAINAMERICA**CAPTAINAMERICA*
2*SPIDER-MAN**IRONMAN**IRONMAN**IRONMAN**SPIDER-MAN**IRONMAN**SPIDER-MAN**SPIDER-MAN*
3*SUB-MARINER**SPIDER-MAN**THOR**THOR**IRONMAN**SPIDER-MAN**IRONMAN**IRONMAN*
4*HULK**SUB-MARINER**SCARLETWITCH**SCARLETWITCH**THOR**SUB-MARINER**THOR**THOR*
5*BEAST**THOR**VISION**VISION**HUMANTORCH**THOR**HUMANTORCH**HUMANTORCH*
6*IRONMAN**BEAST**WASP**WASP**THING**BEAST**THING**THING*
7*THOR**SCARLETWITCH**HAWK**HAWK**HULK**SCARLETWITCH**HULK**HULK*
8*DR.STRANGE**HAWK**ANT-MAN**ANT-MAN**SCARLETWITCH**HAWK**SCARLETWITCH**SCARLETWITCH*
9*THING**WASP**WONDERMAN**WONDERMAN**WOLVERINE**WASP**WOLVERINE**WOLVERINE*
10*CYCLOPS**VISION**JARVIS**JARVIS**HAWK**VISION**HAWK**HAWK*

Produced by ORA developed at CASOS - Carnegie Mellon University