STANDARD NETWORK ANALYSIS REPORT

STANDARD NETWORK ANALYSIS REPORT

Input data: sg1

Start time: Wed Oct 01 10:01:57 2008

Calculates common social network measures on each selected input network.

Analysis for the Meta-Network

Individual entity classes have been combined into a single class, and all networks are combined to create a single network. If two networks connect the same entities, e.g. two agent x agent, then the links are combined. Link weights are made binary.

Row count60
Column count60
Link count148
Density0.04181
Isolate count3
Component count4
Reciprocity0
Characteristic path length3.872
Clustering coefficient0.1626
Network levels (diameter)11
Network fragmentation0.09831
Krackhardt connectedness0.9017
Krackhardt efficiency0.9403
Krackhardt hierarchy0.9341
Krackhardt upperboundedness0.9052
Degree centralization0.211
Betweenness centralization0.09917
Closeness centralization0.1109
MinMaxAverageStddev
Total degree centrality00.24580.041810.03965
Total degree centrality (unscaled)0294.9334.679
Eigenvector centrality010.24240.2085
Hub centrality010.15280.2954
Authority centrality010.28350.2672
Betweenness centrality00.11250.014940.02247
Betweenness centrality (unscaled)0384.851.1276.89
Information centrality00.042160.016670.0113
Information centrality (unscaled)02.0280.80190.5436
Clique membership count0263.1674.994
Simmelian ties0000
Simmelian ties (unscaled)0000
Clustering coefficient00.50.16260.1428

Key nodes

This chart shows the Nodes that repeatedly rank in the top three in the measures. The value shown is the percentage of measures for which the Nodes was ranked in the top three.

In-degree centrality

The In Degree Centrality of a node is its normalized in-degree.

Input network(s): meta-network

RankValueUnscaledNodes
10.16949210sgc_meeting
20.1016956revanna_meeting
30.1016956summit_meeting
40.1016956escape_tunnels
50.1016956infiltrate_summit
60.08474585revanna_bombardment
70.08474585earth
80.08474585find_tunnel_crystals
90.06779664tollana_attack
100.06779664replace_jarren

Out-degree centrality

The Out Degree Centrality of a node is its normalized out-degree.

Input network(s): meta-network

RankValueUnscaledNodes
10.49152529daniel_jackson
20.27118616maj_samantha_carter
30.22033913col_jack_o'neill
40.22033913teal'c
50.08474585summit_meeting
60.06779664gen_hammond
70.06779664revanna_bombardment
80.05084753spying
90.05084753speak_gou'ald
100.05084753infiltrate_summit

Total degree centrality

The Total Degree Centrality of a node is the normalized sum of its row and column degrees.

Input network(s): meta-network

Input network size: 60

Input network density: 0.0418079

Expected value from a random network of the same size and density: 0.0418079

RankValueUnscaledNodesContext*
10.24576329daniel_jackson7.89322
20.13559316col_jack_o'neill3.62957
30.13559316maj_samantha_carter3.62957
40.11016913teal'c2.64565
50.093220311summit_meeting1.9897
60.093220311sgc_meeting1.9897
70.07627129revanna_bombardment1.33376
80.07627129infiltrate_summit1.33376
90.06779668revanna_meeting1.00578
100.0593227gen_hammond0.677811
* Number of standard deviations from the mean if links were distributed randomly
Mean: 0.0418079
Std.dev: 0.0258392

Eigenvector centrality

Calculates the principal eigenvector of the network. A node is central to the extent that its neighbors are central.

Input network(s): meta-network

Input network size: 60

Input network density: 0.0418079

Expected value from a random network of the same size and density: 0.614044

RankValueNodesContext*
11daniel_jackson1.46462
20.874183col_jack_o'neill0.987169
30.684846teal'c0.268679
40.659709maj_samantha_carter0.173289
50.609425sgc_meeting-0.0175247
60.569852revanna_meeting-0.167695
70.457745gen_hammond-0.593118
80.445898tollana_attack-0.638076
90.441074revanna_bombardment-0.656379
100.42823earth-0.705119
* Number of standard deviations from the mean if links were distributed randomly
Mean: 0.614044
Std.dev: 0.26352

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.

Input network(s): meta-network

Input network size: 60

Input network density: 0.0418079

Expected value from a random network of the same size and density: 0.0427676

RankValueUnscaledNodesContext*
10.112459384.833summit_meeting0.348553
20.0696717238.417revanna_meeting0.134559
30.0632915216.583symbiote_poison0.102648
40.0580314198.583gate_attack0.0763403
50.051164175.083escape_tunnels0.0419939
60.0508475174poison_summit0.0404106
70.0506526173.333replace_jarren0.0394362
80.0474868162.5sgc_meeting0.0236028
90.0402299137.667find_tunnel_crystals-0.0126923
100.0344341117.833memory_altering_drug-0.0416797
* Number of standard deviations from the mean if links were distributed randomly
Mean: 0.0427676
Std.dev: 0.199943

Closeness centrality

The average closeness of a node to the other nodes in a network. Loosely, Closeness is the inverse of the average distance in the network between the node and all other nodes.

Input network(s): meta-network

Input network size: 60

Input network density: 0.0418079

Expected value from a random network of the same size and density: 0.0921591

RankValueUnscaledNodesContext*
10.0801630.0013587daniel_jackson-0.420533
20.05012740.000849618maj_samantha_carter-1.47346
30.0478120.000810373teal'c-1.55463
40.04566560.000773994col_jack_o'neill-1.62987
50.03724750.000631313gen_hammond-1.92498
60.03641980.000617284speak_gou'ald-1.95399
70.03630770.000615385spying-1.95792
80.03530820.000598444inflitrate_yuWorld-1.99296
90.03520290.000596659reole_chameleon-1.99665
100.03520290.000596659get_reole_chemical-1.99665
* Number of standard deviations from the mean if links were distributed randomly
Mean: 0.0921591
Std.dev: 0.0285259

Produced by ORA developed at CASOS - Carnegie Mellon University