STANDARD NETWORK ANALYSIS REPORT

STANDARD NETWORK ANALYSIS REPORT

Input data: davis

Start time: Mon Oct 17 12:37:42 2011

Data Description

Calculates common social network measures on each selected input network.

Network agent x event

Network Level Measures

MeasureValue
Row count18.000
Column count14.000
Link count89.000
Density0.353

Node Level Measures

MeasureMinMaxAvgStddev
In-degree centrality0.1670.7780.3530.192
In-degree centrality [Unscaled]3.00014.0006.3573.456
Out-degree centrality0.1430.5710.3530.148
Out-degree centrality [Unscaled]2.0008.0004.9442.068

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 event

RankEventValueUnscaled
1E80.77814.000
2E90.66712.000
3E70.55610.000
4E50.4448.000
5E60.4448.000
6E30.3336.000
7E120.3336.000
8E100.2785.000
9E40.2224.000
10E110.2224.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 event

RankAgentValueUnscaled
1EVELYN0.5718.000
2THERESA0.5718.000
3NORA0.5718.000
4LAURA0.5007.000
5BRENDA0.5007.000
6SYLVIA0.5007.000
7KATHERINE0.4296.000
8HELEN0.3575.000
9CHARLOTTE0.2864.000
10FRANCES0.2864.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----E8-EVELYN-
2----E9-THERESA-
3----E7-NORA-
4----E5-LAURA-
5----E6-BRENDA-
6----E3-SYLVIA-
7----E12-KATHERINE-
8----E10-HELEN-
9----E4-CHARLOTTE-
10----E11-FRANCES-

Produced by ORA developed at CASOS - Carnegie Mellon University