Input data: cxcsub
Start time: Mon Oct 17 14:18:48 2011
Calculates common social network measures on each selected input network.
Network agent x resource
Network Level Measures
Measure Value Row count 26.000 Column count 15.000 Link count 98.000 Density 0.251 Node Level Measures
Measure Min Max Avg Stddev In-degree centrality 0.115 0.846 0.251 0.192 In-degree centrality [Unscaled] 3.000 22.000 6.533 5.005 Out-degree centrality 0.133 0.467 0.251 0.083 Out-degree centrality [Unscaled] 2.000 7.000 3.769 1.250 Key Nodes
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 resource
Rank Resource Value Unscaled 1 3 0.846 22.000 2 4 0.462 12.000 3 2 0.423 11.000 4 15 0.346 9.000 5 9 0.231 6.000 6 12 0.192 5.000 7 13 0.192 5.000 8 6 0.154 4.000 9 7 0.154 4.000 10 8 0.154 4.000 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 resource
Rank Agent Value Unscaled 1 14 0.467 7.000 2 17 0.400 6.000 3 15 0.333 5.000 4 16 0.333 5.000 5 18 0.333 5.000 6 19 0.333 5.000 7 20 0.333 5.000 8 24 0.333 5.000 9 7 0.267 4.000 10 9 0.267 4.000 Key Nodes Table
This shows the top scoring nodes side-by-side for selected measures.
Rank Betweenness centrality Closeness centrality Eigenvector centrality Eigenvector centrality per component In-degree centrality In-Closeness centrality Out-degree centrality Total degree centrality 1 - - - - 3 - 14 - 2 - - - - 4 - 17 - 3 - - - - 2 - 15 - 4 - - - - 15 - 16 - 5 - - - - 9 - 18 - 6 - - - - 12 - 19 - 7 - - - - 13 - 20 - 8 - - - - 6 - 24 - 9 - - - - 7 - 7 - 10 - - - - 8 - 9 -
Produced by ORA developed at CASOS - Carnegie Mellon University