Calculates common social network measures on each selected input network.
Network test
Network Level Measures
Measure Value Row count 24.000 Column count 24.000 Link count 38.000 Density 0.138 Components of 1 node (isolates) 0 Components of 2 nodes (dyadic isolates) 0 Components of 3 or more nodes 1 Reciprocity 1.000 Characteristic path length 2.993 Clustering coefficient 0.442 Network levels (diameter) 6.000 Network fragmentation 0.000 Krackhardt connectedness 1.000 Krackhardt efficiency 0.941 Krackhardt hierarchy 0.000 Krackhardt upperboundedness 1.000 Degree centralization 0.182 Betweenness centralization 0.548 Closeness centralization 0.354 Eigenvector centralization 0.488 Reciprocal (symmetric)? Yes
Node Level Measures
Measure Min Max Avg Stddev Total degree centrality 0.043 0.304 0.138 0.058 Total degree centrality [Unscaled] 1.000 7.000 3.167 1.344 In-degree centrality 0.043 0.304 0.138 0.058 In-degree centrality [Unscaled] 1.000 7.000 3.167 1.344 Out-degree centrality 0.043 0.304 0.138 0.058 Out-degree centrality [Unscaled] 1.000 7.000 3.167 1.344 Eigenvector centrality 0.053 0.687 0.240 0.161 Eigenvector centrality [Unscaled] 0.038 0.485 0.169 0.114 Eigenvector centrality per component 0.038 0.485 0.169 0.114 Closeness centrality 0.240 0.511 0.345 0.065 Closeness centrality [Unscaled] 0.010 0.022 0.015 0.003 In-Closeness centrality 0.240 0.511 0.345 0.065 In-Closeness centrality [Unscaled] 0.010 0.022 0.015 0.003 Betweenness centrality 0.000 0.615 0.091 0.163 Betweenness centrality [Unscaled] 0.000 155.667 22.917 41.132 Hub centrality 0.053 0.687 0.240 0.161 Authority centrality 0.053 0.687 0.240 0.161 Information centrality 0.028 0.060 0.042 0.009 Information centrality [Unscaled] 0.423 0.897 0.620 0.127 Clique membership count 0.000 4.000 1.167 0.943 Simmelian ties 0.000 0.217 0.098 0.063 Simmelian ties [Unscaled] 0.000 5.000 2.250 1.451 Clustering coefficient 0.000 1.000 0.442 0.372
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: test (size: 24, density: 0.137681)
Rank Agent Value Unscaled Context* 1 Bob 0.304 7.000 2.370 2 Norm 0.261 6.000 1.751 3 John 0.217 5.000 1.133 4 Gill 0.174 4.000 0.515 5 Alejandro 0.174 4.000 0.515 6 Utrecht 0.174 4.000 0.515 7 Sam 0.174 4.000 0.515 8 Ike 0.130 3.000 -0.103 9 Hal 0.130 3.000 -0.103 10 Karl 0.130 3.000 -0.103 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.138 Mean in random network: 0.138 Std.dev: 0.058 Std.dev in random network: 0.070 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): test
Rank Agent Value Unscaled 1 Bob 0.304 7.000 2 Norm 0.261 6.000 3 John 0.217 5.000 4 Gill 0.174 4.000 5 Alejandro 0.174 4.000 6 Utrecht 0.174 4.000 7 Sam 0.174 4.000 8 Ike 0.130 3.000 9 Hal 0.130 3.000 10 Karl 0.130 3.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): test
Rank Agent Value Unscaled 1 Bob 0.304 7.000 2 Norm 0.261 6.000 3 John 0.217 5.000 4 Gill 0.174 4.000 5 Alejandro 0.174 4.000 6 Utrecht 0.174 4.000 7 Sam 0.174 4.000 8 Ike 0.130 3.000 9 Hal 0.130 3.000 10 Karl 0.130 3.000 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: test (size: 24, density: 0.137681)
Rank Agent Value Unscaled Context* 1 Bob 0.687 0.485 0.890 2 John 0.556 0.393 0.445 3 Hal 0.415 0.293 -0.034 4 Lanny 0.396 0.280 -0.097 5 Norm 0.383 0.271 -0.143 6 Gill 0.363 0.257 -0.211 7 Ike 0.340 0.240 -0.289 8 Alejandro 0.303 0.214 -0.414 9 Karl 0.291 0.206 -0.455 10 Mike 0.265 0.187 -0.543 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.240 Mean in random network: 0.425 Std.dev: 0.161 Std.dev in random network: 0.294 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): test
Rank Agent Value 1 Bob 0.485 2 John 0.393 3 Hal 0.293 4 Lanny 0.280 5 Norm 0.271 6 Gill 0.257 7 Ike 0.240 8 Alejandro 0.214 9 Karl 0.206 10 Mike 0.187 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: test (size: 24, density: 0.137681)
Rank Agent Value Unscaled Context* 1 Bob 0.511 0.022 2.547 2 Norm 0.500 0.022 2.368 3 John 0.397 0.017 0.702 4 Utrecht 0.383 0.017 0.489 5 Hal 0.377 0.016 0.387 6 Lanny 0.377 0.016 0.387 7 Alejandro 0.377 0.016 0.387 8 Sam 0.377 0.016 0.387 9 Ike 0.371 0.016 0.289 10 Ozzie 0.371 0.016 0.289 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.345 Mean in random network: 0.353 Std.dev: 0.065 Std.dev in random network: 0.062 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): test
Rank Agent Value Unscaled 1 Bob 0.511 0.022 2 Norm 0.500 0.022 3 John 0.397 0.017 4 Utrecht 0.383 0.017 5 Hal 0.377 0.016 6 Lanny 0.377 0.016 7 Alejandro 0.377 0.016 8 Sam 0.377 0.016 9 Ike 0.371 0.016 10 Ozzie 0.371 0.016 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: test (size: 24, density: 0.137681)
Rank Agent Value Unscaled Context* 1 Bob 0.615 155.667 10.705 2 Norm 0.572 144.667 9.847 3 Alejandro 0.237 60.000 3.247 4 Sam 0.166 42.000 1.844 5 Utrecht 0.120 30.333 0.935 6 Gill 0.092 23.333 0.389 7 John 0.086 21.667 0.259 8 Vern 0.067 17.000 -0.105 9 Ike 0.047 12.000 -0.494 10 Hal 0.040 10.000 -0.650 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.091 Mean in random network: 0.073 Std.dev: 0.163 Std.dev in random network: 0.051 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): test
Rank Agent Value 1 Bob 0.687 2 John 0.556 3 Hal 0.415 4 Lanny 0.396 5 Norm 0.383 6 Gill 0.363 7 Ike 0.340 8 Alejandro 0.303 9 Karl 0.291 10 Mike 0.265 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): test
Rank Agent Value 1 Bob 0.687 2 John 0.556 3 Hal 0.415 4 Lanny 0.396 5 Norm 0.383 6 Gill 0.363 7 Ike 0.340 8 Alejandro 0.303 9 Karl 0.291 10 Mike 0.265 Information centrality
Calculate the Stephenson and Zelen information centrality measure for each node.
Input network(s): test
Rank Agent Value Unscaled 1 Bob 0.060 0.897 2 Norm 0.058 0.870 3 John 0.053 0.786 4 Lanny 0.048 0.716 5 Karl 0.047 0.707 6 Hal 0.047 0.703 7 Utrecht 0.047 0.699 8 Gill 0.046 0.690 9 Ike 0.046 0.684 10 Ozzie 0.045 0.667 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): test
Rank Agent Value 1 John 4.000 2 Bob 3.000 3 Hal 2.000 4 Lanny 2.000 5 Utrecht 2.000 6 Sam 2.000 7 Gill 1.000 8 Ike 1.000 9 Mike 1.000 10 Karl 1.000 Simmelian ties
The normalized number of Simmelian ties of each node.
Input network(s): test
Rank Agent Value Unscaled 1 John 0.217 5.000 2 Bob 0.217 5.000 3 Utrecht 0.174 4.000 4 Sam 0.174 4.000 5 Hal 0.130 3.000 6 Lanny 0.130 3.000 7 Alejandro 0.130 3.000 8 Carlos 0.130 3.000 9 Eduardo 0.130 3.000 10 Domingo 0.130 3.000 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): test
Rank Agent Value 1 Mike 1.000 2 Carlos 1.000 3 Eduardo 1.000 4 Domingo 1.000 5 Xavier 1.000 6 Wendle 1.000 7 Hal 0.667 8 Lanny 0.667 9 Alejandro 0.500 10 John 0.400
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 Bob Bob Bob Bob Bob Bob Bob Bob 2 Norm Norm John John Norm Norm Norm Norm 3 Alejandro John Hal Hal John John John John 4 Sam Utrecht Lanny Lanny Gill Utrecht Gill Gill 5 Utrecht Hal Norm Norm Alejandro Hal Alejandro Alejandro 6 Gill Lanny Gill Gill Utrecht Lanny Utrecht Utrecht 7 John Alejandro Ike Ike Sam Alejandro Sam Sam 8 Vern Sam Alejandro Alejandro Ike Sam Ike Ike 9 Ike Ike Karl Karl Hal Ike Hal Hal 10 Hal Ozzie Mike Mike Karl Ozzie Karl Karl