STANDARD NETWORK ANALYSIS REPORT

STANDARD NETWORK ANALYSIS REPORT

Input data: stargate

Start time: Wed Oct 01 10:03:39 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 count71
Column count71
Link count243
Density0.04889
Isolate count0
Component count1
Reciprocity0.008299
Characteristic path length3.653
Clustering coefficient0.1781
Network levels (diameter)11
Network fragmentation0
Krackhardt connectedness1
Krackhardt efficiency0.9292
Krackhardt hierarchy0.9514
Krackhardt upperboundedness0.8261
Degree centralization0.1628
Betweenness centralization0.08434
Closeness centralization0.05079
MinMaxAverageStddev
Total degree centrality0.0071430.20710.048890.03638
Total degree centrality (unscaled)1296.8455.093
Eigenvector centrality0.0301110.32770.2417
Hub centrality010.13160.2281
Authority centrality010.24180.234
Betweenness centrality00.094510.011360.01847
Betweenness centrality (unscaled)0456.554.8689.2
Information centrality00.031790.014080.009164
Information centrality (unscaled)02.2230.9850.6409
Clique membership count0264.935.478
Simmelian ties0000
Simmelian ties (unscaled)0000
Clustering coefficient00.50.17810.125

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.15714311revanna_meeting
20.15714311revanna_bombardment
30.15714311sgc_meeting
40.14285710revanna
50.1285719earth
60.1142868summit_meeting
70.1142868escape_tunnels
80.1142868defend_revenna
90.08571436gen_hammond
100.08571436tollana_attack

Out-degree centrality

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

Input network(s): meta-network

RankValueUnscaledNodes
10.41428629daniel_jackson
20.321jacob_carter_selmak
30.24285717ren'al
40.22857116maj_samantha_carter
50.18571413col_jack_o'neill
60.18571413teal'c
70.15714311lantash
80.1285719lt_elliott
90.1142868aldwin
100.17osiris

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: 71

Input network density: 0.0488934

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

RankValueUnscaledNodesContext*
10.20714329daniel_jackson6.18347
20.1521jacob_carter_selmak3.95066
30.14285720ren'al3.67156
40.11428616col_jack_o'neill2.55515
50.11428616maj_samantha_carter2.55515
60.10714315revanna_bombardment2.27605
70.092857113teal'c1.71785
80.092857113revanna_meeting1.71785
90.092857113summit_meeting1.71785
100.085714312lantash1.43875
* Number of standard deviations from the mean if links were distributed randomly
Mean: 0.0488934
Std.dev: 0.0255924

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: 71

Input network density: 0.0488934

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

RankValueNodesContext*
11daniel_jackson2.38739
20.941895col_jack_o'neill2.14632
30.878546revanna_meeting1.8835
40.846751ren'al1.75159
50.837472revanna_bombardment1.7131
60.791846jacob_carter_selmak1.52381
70.771845teal'c1.44083
80.750954maj_samantha_carter1.35415
90.699122sgc_meeting1.13912
100.686179revanna1.08542
* Number of standard deviations from the mean if links were distributed randomly
Mean: 0.424554
Std.dev: 0.241036

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: 71

Input network density: 0.0488934

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

RankValueUnscaledNodesContext*
10.0945135456.5summit_meeting0.261785
20.0721498348.483revanna_meeting0.165829
30.0524293253.233replace_jarren0.0812136
40.0502726242.817symbiote_poison0.07196
50.0494134238.667sgc_meeting0.0682733
60.0435714210.45gate_attack0.0432071
70.0379055183.083escape_tunnels0.018896
80.0369358178.4poison_summit0.0147356
90.0335059161.833revanna_bombardment1.86535e-005
100.0327536158.2memory_altering_drug-0.00320901
* Number of standard deviations from the mean if links were distributed randomly
Mean: 0.0335015
Std.dev: 0.233061

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: 71

Input network density: 0.0488934

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

RankValueUnscaledNodesContext*
10.04629630.000661376jacob_carter_selmak-3.78079
20.0427350.000610501daniel_jackson-3.86064
30.03848270.000549753lantash-3.95598
40.03835620.000547945lt_elliott-3.95882
50.03246750.000463822maj_samantha_carter-4.09085
60.03240740.000462963aldwin-4.0922
70.03163130.000451875ren'al-4.1096
80.03147480.00044964teal'c-4.11311
90.03052770.00043611col_jack_o'neill-4.13435
100.02936240.000419463janet_frazier-4.16047
* Number of standard deviations from the mean if links were distributed randomly
Mean: 0.214918
Std.dev: 0.0445995

Produced by ORA developed at CASOS - Carnegie Mellon University