Standard Network Analysis: agent x task

Standard Network Analysis: agent x task

Input data: agent x task

Start time: Tue Oct 18 11:35:51 2011

Return to table of contents

Network Level Measures

MeasureValue
Row count5.000
Column count5.000
Link count13.000
Density0.520

Node Level Measures

MeasureMinMaxAvgStddev
In-degree centrality0.2000.8000.5200.240
In-degree centrality [Unscaled]1.0004.0002.6001.200
Out-degree centrality0.4000.6000.5200.098
Out-degree centrality [Unscaled]2.0003.0002.6000.490

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 task

RankTaskValueUnscaled
1Design0.8004.000
2Development0.8004.000
3Sales0.4002.000
4Testing0.4002.000
5Management0.2001.000

Back to top

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 task

RankAgentValueUnscaled
1Andrea0.6003.000
2Chuck0.6003.000
3Terry0.6003.000
4Larry0.4002.000
5Meindl0.4002.000

Back to top

Key Nodes Table

This shows the top scoring nodes side-by-side for selected measures.

RankBetweenness centralityCloseness centralityEigenvector centralityEigenvector centrality per componentIn-degree centralityIn-Closeness centralityOut-degree centralityTotal degree centrality
1----Design-Andrea-
2----Development-Chuck-
3----Sales-Terry-
4----Testing-Larry-
5----Management-Meindl-