Network Level Measures
Measure Value Row count 39.000 Column count 39.000 Link count 223.000 Density 0.301 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 1.772 Clustering coefficient 0.498 Network levels (diameter) 3.000 Network fragmentation 0.000 Krackhardt connectedness 1.000 Krackhardt efficiency 0.737 Krackhardt hierarchy 0.000 Krackhardt upperboundedness 1.000 Degree centralization 0.376 Betweenness centralization 0.088 Closeness centralization 0.358 Eigenvector centralization 0.223 Reciprocal (symmetric)? Yes
Node Level Measures
Measure Min Max Avg Stddev Total degree centrality 0.053 0.658 0.301 0.143 Total degree centrality [Unscaled] 2.000 25.000 11.436 5.439 In-degree centrality 0.053 0.658 0.301 0.143 In-degree centrality [Unscaled] 2.000 25.000 11.436 5.439 Out-degree centrality 0.053 0.658 0.301 0.143 Out-degree centrality [Unscaled] 2.000 25.000 11.436 5.439 Eigenvector centrality 0.032 0.414 0.203 0.101 Eigenvector centrality [Unscaled] 0.023 0.293 0.143 0.071 Eigenvector centrality per component 0.023 0.293 0.143 0.071 Closeness centrality 0.432 0.745 0.573 0.070 Closeness centrality [Unscaled] 0.011 0.020 0.015 0.002 In-Closeness centrality 0.432 0.745 0.573 0.070 In-Closeness centrality [Unscaled] 0.011 0.020 0.015 0.002 Betweenness centrality 0.000 0.107 0.021 0.026 Betweenness centrality [Unscaled] 0.000 75.276 14.667 18.332 Hub centrality 0.032 0.414 0.203 0.101 Authority centrality 0.032 0.414 0.203 0.101 Information centrality 0.009 0.035 0.026 0.006 Information centrality [Unscaled] 1.544 5.901 4.274 1.054 Clique membership count 0.000 61.000 14.359 12.853 Simmelian ties 0.000 0.658 0.297 0.146 Simmelian ties [Unscaled] 0.000 25.000 11.282 5.561 Clustering coefficient 0.000 1.000 0.498 0.173
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: KAPFTS2 (size: 39, density: 0.300945)
Rank Agent Value Unscaled Context* 1 MUKUBWA 0.658 25.000 4.860 2 CHISOKONE 0.579 22.000 3.785 3 IBRAHIM 0.553 21.000 3.427 4 LYASHI 0.500 19.000 2.710 5 HASTINGS 0.474 18.000 2.352 6 MESHAK 0.474 18.000 2.352 7 ABRAHAM 0.447 17.000 1.994 8 KALAMBA 0.421 16.000 1.635 9 JOSEPH 0.421 16.000 1.635 10 MUBANGA 0.421 16.000 1.635 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.301 Mean in random network: 0.301 Std.dev: 0.143 Std.dev in random network: 0.073 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): KAPFTS2
Rank Agent Value Unscaled 1 MUKUBWA 0.658 25.000 2 CHISOKONE 0.579 22.000 3 IBRAHIM 0.553 21.000 4 LYASHI 0.500 19.000 5 HASTINGS 0.474 18.000 6 MESHAK 0.474 18.000 7 ABRAHAM 0.447 17.000 8 KALAMBA 0.421 16.000 9 JOSEPH 0.421 16.000 10 MUBANGA 0.421 16.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): KAPFTS2
Rank Agent Value Unscaled 1 MUKUBWA 0.658 25.000 2 CHISOKONE 0.579 22.000 3 IBRAHIM 0.553 21.000 4 LYASHI 0.500 19.000 5 HASTINGS 0.474 18.000 6 MESHAK 0.474 18.000 7 ABRAHAM 0.447 17.000 8 KALAMBA 0.421 16.000 9 JOSEPH 0.421 16.000 10 MUBANGA 0.421 16.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: KAPFTS2 (size: 39, density: 0.300945)
Rank Agent Value Unscaled Context* 1 MUKUBWA 0.414 0.293 -0.764 2 IBRAHIM 0.365 0.258 -0.929 3 CHISOKONE 0.364 0.257 -0.934 4 ABRAHAM 0.342 0.242 -1.005 5 HASTINGS 0.336 0.237 -1.028 6 MESHAK 0.333 0.235 -1.036 7 LYASHI 0.328 0.232 -1.052 8 JOSEPH 0.303 0.214 -1.138 9 KALAMBA 0.299 0.211 -1.150 10 NKOLOYA 0.276 0.195 -1.228 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.203 Mean in random network: 0.642 Std.dev: 0.101 Std.dev in random network: 0.298 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): KAPFTS2
Rank Agent Value 1 MUKUBWA 0.293 2 IBRAHIM 0.258 3 CHISOKONE 0.257 4 ABRAHAM 0.242 5 HASTINGS 0.237 6 MESHAK 0.235 7 LYASHI 0.232 8 JOSEPH 0.214 9 KALAMBA 0.211 10 NKOLOYA 0.195 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: KAPFTS2 (size: 39, density: 0.300945)
Rank Agent Value Unscaled Context* 1 MUKUBWA 0.745 0.020 4.703 2 CHISOKONE 0.704 0.019 3.459 3 IBRAHIM 0.691 0.018 3.074 4 LYASHI 0.655 0.017 2.000 5 HASTINGS 0.655 0.017 2.000 6 ABRAHAM 0.644 0.017 1.667 7 MESHAK 0.644 0.017 1.667 8 KALAMBA 0.633 0.017 1.344 9 JOSEPH 0.633 0.017 1.344 10 MUBANGA 0.623 0.016 1.032 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.573 Mean in random network: 0.589 Std.dev: 0.070 Std.dev in random network: 0.033 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): KAPFTS2
Rank Agent Value Unscaled 1 MUKUBWA 0.745 0.020 2 CHISOKONE 0.704 0.019 3 IBRAHIM 0.691 0.018 4 LYASHI 0.655 0.017 5 HASTINGS 0.655 0.017 6 ABRAHAM 0.644 0.017 7 MESHAK 0.644 0.017 8 KALAMBA 0.633 0.017 9 JOSEPH 0.633 0.017 10 MUBANGA 0.623 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: KAPFTS2 (size: 39, density: 0.300945)
Rank Agent Value Unscaled Context* 1 MUKUBWA 0.107 75.276 6.068 2 CHISOKONE 0.095 66.904 5.183 3 IBRAHIM 0.087 61.140 4.574 4 LYASHI 0.069 48.388 3.226 5 MESHAK 0.040 27.823 1.053 6 MPUNDU 0.037 25.979 0.858 7 HASTINGS 0.037 25.773 0.836 8 KALAMBA 0.032 22.712 0.513 9 MUBANGA 0.031 21.737 0.410 10 JOHN 0.026 18.587 0.077 * Number of standard deviations from the mean of a random network of the same size and density
Mean: 0.021 Mean in random network: 0.025 Std.dev: 0.026 Std.dev in random network: 0.013 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): KAPFTS2
Rank Agent Value 1 MUKUBWA 0.414 2 IBRAHIM 0.365 3 CHISOKONE 0.364 4 ABRAHAM 0.342 5 HASTINGS 0.336 6 MESHAK 0.333 7 LYASHI 0.328 8 JOSEPH 0.303 9 KALAMBA 0.299 10 NKOLOYA 0.276 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): KAPFTS2
Rank Agent Value 1 MUKUBWA 0.414 2 IBRAHIM 0.365 3 CHISOKONE 0.364 4 ABRAHAM 0.342 5 HASTINGS 0.336 6 MESHAK 0.333 7 LYASHI 0.328 8 JOSEPH 0.303 9 KALAMBA 0.299 10 NKOLOYA 0.276 Information centrality
Calculate the Stephenson and Zelen information centrality measure for each node.
Input network(s): KAPFTS2
Rank Agent Value Unscaled 1 MUKUBWA 0.035 5.901 2 CHISOKONE 0.034 5.712 3 IBRAHIM 0.034 5.613 4 LYASHI 0.033 5.447 5 MESHAK 0.032 5.380 6 HASTINGS 0.032 5.364 7 ABRAHAM 0.031 5.250 8 JOSEPH 0.031 5.184 9 KALAMBA 0.031 5.184 10 MUBANGA 0.031 5.164 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): KAPFTS2
Rank Agent Value 1 MUKUBWA 61.000 2 ABRAHAM 42.000 3 IBRAHIM 37.000 4 HASTINGS 31.000 5 CHISOKONE 29.000 6 LYASHI 28.000 7 MESHAK 28.000 8 JOSEPH 22.000 9 MUBANGA 21.000 10 KALAMBA 20.000 Simmelian ties
The normalized number of Simmelian ties of each node.
Input network(s): KAPFTS2
Rank Agent Value Unscaled 1 MUKUBWA 0.658 25.000 2 CHISOKONE 0.579 22.000 3 IBRAHIM 0.553 21.000 4 LYASHI 0.474 18.000 5 HASTINGS 0.474 18.000 6 MESHAK 0.474 18.000 7 ABRAHAM 0.447 17.000 8 KALAMBA 0.421 16.000 9 JOSEPH 0.421 16.000 10 MUBANGA 0.421 16.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): KAPFTS2
Rank Agent Value 1 SIGN 1.000 2 ANGEL 0.867 3 CHILWA 0.806 4 CHIPALO 0.762 5 KAMWEFU 0.682 6 NKUMBULA 0.636 7 ABRAHAM 0.603 8 MATEO 0.600 9 HENRY 0.576 10 ZAKEYO 0.571
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 MUKUBWA MUKUBWA MUKUBWA MUKUBWA MUKUBWA MUKUBWA MUKUBWA MUKUBWA 2 CHISOKONE CHISOKONE IBRAHIM IBRAHIM CHISOKONE CHISOKONE CHISOKONE CHISOKONE 3 IBRAHIM IBRAHIM CHISOKONE CHISOKONE IBRAHIM IBRAHIM IBRAHIM IBRAHIM 4 LYASHI LYASHI ABRAHAM ABRAHAM LYASHI LYASHI LYASHI LYASHI 5 MESHAK HASTINGS HASTINGS HASTINGS HASTINGS HASTINGS HASTINGS HASTINGS 6 MPUNDU ABRAHAM MESHAK MESHAK MESHAK ABRAHAM MESHAK MESHAK 7 HASTINGS MESHAK LYASHI LYASHI ABRAHAM MESHAK ABRAHAM ABRAHAM 8 KALAMBA KALAMBA JOSEPH JOSEPH KALAMBA KALAMBA KALAMBA KALAMBA 9 MUBANGA JOSEPH KALAMBA KALAMBA JOSEPH JOSEPH JOSEPH JOSEPH 10 JOHN MUBANGA NKOLOYA NKOLOYA MUBANGA MUBANGA MUBANGA MUBANGA