Network Level Measures
Measure Value Row count 14.000 Column count 14.000 Link count 19.000 Density 0.209 Components of 1 node (isolates) 2 Components of 2 nodes (dyadic isolates) 0 Components of 3 or more nodes 1 Reciprocity 1.000 Characteristic path length 1.864 Clustering coefficient 0.185 Network levels (diameter) 3.000 Network fragmentation 0.275 Krackhardt connectedness 0.725 Krackhardt efficiency 0.855 Krackhardt hierarchy 0.000 Krackhardt upperboundedness 1.000 Degree centralization 0.474 Betweenness centralization 0.344 Closeness centralization 0.153 Eigenvector centralization 0.436 Reciprocal (symmetric)? Yes
Node Level Measures
Measure Min Max Avg Stddev Total degree centrality 0.000 0.615 0.209 0.180 Total degree centrality [Unscaled] 0.000 8.000 2.714 2.343 In-degree centrality 0.000 0.615 0.209 0.180 In-degree centrality [Unscaled] 0.000 8.000 2.714 2.343 Out-degree centrality 0.000 0.615 0.209 0.180 Out-degree centrality [Unscaled] 0.000 8.000 2.714 2.343 Eigenvector centrality 0.000 0.686 0.312 0.213 Eigenvector centrality [Unscaled] 0.000 0.485 0.221 0.151 Eigenvector centrality per component 0.000 0.416 0.189 0.129 Closeness centrality 0.071 0.310 0.241 0.072 Closeness centrality [Unscaled] 0.005 0.024 0.019 0.006 In-Closeness centrality 0.071 0.310 0.241 0.072 In-Closeness centrality [Unscaled] 0.005 0.024 0.019 0.006 Betweenness centrality 0.000 0.372 0.052 0.107 Betweenness centrality [Unscaled] 0.000 29.000 4.071 8.334 Hub centrality 0.000 0.686 0.312 0.213 Authority centrality 0.000 0.686 0.312 0.213 Information centrality 0.000 0.126 0.071 0.038 Information centrality [Unscaled] 0.000 1.750 0.996 0.529 Clique membership count 0.000 3.000 0.714 1.030 Simmelian ties 0.000 0.385 0.110 0.142 Simmelian ties [Unscaled] 0.000 5.000 1.429 1.841 Clustering coefficient 0.000 1.000 0.185 0.278
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: RDNEG (size: 14, density: 0.208791)
Rank Agent Value Unscaled Context* 1 W5 0.615 8.000 3.743 2 I3 0.538 7.000 3.035 3 W2 0.308 4.000 0.910 4 W7 0.308 4.000 0.910 5 W6 0.231 3.000 0.202 6 W8 0.231 3.000 0.202 7 W9 0.231 3.000 0.202 8 I1 0.154 2.000 -0.506 9 W4 0.077 1.000 -1.214 10 S1 0.077 1.000 -1.214 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.209 Mean in random network: 0.209 Std.dev: 0.180 Std.dev in random network: 0.109 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): RDNEG
Rank Agent Value Unscaled 1 W5 0.615 8.000 2 I3 0.538 7.000 3 W2 0.308 4.000 4 W7 0.308 4.000 5 W6 0.231 3.000 6 W8 0.231 3.000 7 W9 0.231 3.000 8 I1 0.154 2.000 9 W4 0.077 1.000 10 S1 0.077 1.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): RDNEG
Rank Agent Value Unscaled 1 W5 0.615 8.000 2 I3 0.538 7.000 3 W2 0.308 4.000 4 W7 0.308 4.000 5 W6 0.231 3.000 6 W8 0.231 3.000 7 W9 0.231 3.000 8 I1 0.154 2.000 9 W4 0.077 1.000 10 S1 0.077 1.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: RDNEG (size: 14, density: 0.208791)
Rank Agent Value Unscaled Context* 1 W5 0.686 0.485 0.744 2 I3 0.670 0.474 0.696 3 W7 0.509 0.360 0.191 4 W6 0.439 0.310 -0.029 5 W8 0.406 0.287 -0.133 6 W9 0.406 0.287 -0.133 7 W2 0.368 0.261 -0.250 8 I1 0.244 0.173 -0.638 9 W4 0.161 0.114 -0.898 10 S1 0.161 0.114 -0.898 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.312 Mean in random network: 0.448 Std.dev: 0.213 Std.dev in random network: 0.319 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): RDNEG
Rank Agent Value 1 W5 0.416 2 I3 0.406 3 W7 0.309 4 W6 0.266 5 W8 0.246 6 W9 0.246 7 W2 0.223 8 I1 0.148 9 W4 0.098 10 S1 0.098 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: RDNEG (size: 14, density: 0.208791)
Rank Agent Value Unscaled Context* 1 W5 0.310 0.024 -1.940 2 I3 0.302 0.023 -2.053 3 W7 0.283 0.022 -2.363 4 W6 0.277 0.021 -2.458 5 W8 0.277 0.021 -2.458 6 W9 0.277 0.021 -2.458 7 W2 0.260 0.020 -2.718 8 I1 0.255 0.020 -2.799 9 W4 0.250 0.019 -2.876 10 S1 0.250 0.019 -2.876 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.241 Mean in random network: 0.433 Std.dev: 0.072 Std.dev in random network: 0.064 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): RDNEG
Rank Agent Value Unscaled 1 W5 0.310 0.024 2 I3 0.302 0.023 3 W7 0.283 0.022 4 W6 0.277 0.021 5 W8 0.277 0.021 6 W9 0.277 0.021 7 W2 0.260 0.020 8 I1 0.255 0.020 9 W4 0.250 0.019 10 S1 0.250 0.019 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: RDNEG (size: 14, density: 0.208791)
Rank Agent Value Unscaled Context* 1 W5 0.372 29.000 3.896 2 I3 0.237 18.500 1.926 3 W7 0.036 2.833 -1.014 4 W2 0.032 2.500 -1.077 5 W8 0.024 1.833 -1.202 6 W9 0.024 1.833 -1.202 7 I1 0.006 0.500 -1.452 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.052 Mean in random network: 0.106 Std.dev: 0.107 Std.dev in random network: 0.068 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): RDNEG
Rank Agent Value 1 W5 0.686 2 I3 0.670 3 W7 0.509 4 W6 0.439 5 W8 0.406 6 W9 0.406 7 W2 0.368 8 I1 0.244 9 W4 0.161 10 S1 0.161 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): RDNEG
Rank Agent Value 1 W5 0.686 2 I3 0.670 3 W7 0.509 4 W6 0.439 5 W8 0.406 6 W9 0.406 7 W2 0.368 8 I1 0.244 9 W4 0.161 10 S1 0.161 Information centrality
Calculate the Stephenson and Zelen information centrality measure for each node.
Input network(s): RDNEG
Rank Agent Value Unscaled 1 W5 0.126 1.750 2 I3 0.120 1.671 3 W7 0.102 1.426 4 W2 0.097 1.359 5 W8 0.093 1.296 6 W9 0.093 1.296 7 W6 0.092 1.281 8 I1 0.074 1.028 9 S1 0.051 0.712 10 S2 0.051 0.712 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): RDNEG
Rank Agent Value 1 I3 3.000 2 W5 3.000 3 W6 1.000 4 W7 1.000 5 W8 1.000 6 W9 1.000 Simmelian ties
The normalized number of Simmelian ties of each node.
Input network(s): RDNEG
Rank Agent Value Unscaled 1 I3 0.385 5.000 2 W5 0.385 5.000 3 W6 0.231 3.000 4 W7 0.231 3.000 5 W8 0.154 2.000 6 W9 0.154 2.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): RDNEG
Rank Agent Value 1 W6 1.000 2 W7 0.500 3 W8 0.333 4 W9 0.333 5 I3 0.238 6 W5 0.179
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 W5 W5 W5 W5 W5 W5 W5 W5 2 I3 I3 I3 I3 I3 I3 I3 I3 3 W7 W7 W7 W7 W2 W7 W2 W2 4 W2 W6 W6 W6 W7 W6 W7 W7 5 W8 W8 W8 W8 W6 W8 W6 W6 6 W9 W9 W9 W9 W8 W9 W8 W8 7 I1 W2 W2 W2 W9 W2 W9 W9 8 W1 I1 I1 I1 I1 I1 I1 I1 9 W3 W4 W4 W4 W4 W4 W4 W4 10 W4 S1 S1 S1 S1 S1 S1 S1