File: analysis.html

package info (click to toggle)
socnetv 0.90-3
• area: main
• in suites: wheezy
• size: 2,028 kB
• sloc: cpp: 12,953; makefile: 75
 file content (199 lines) | stat: -rwxr-xr-x 9,913 bytes parent folder | download
 `123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199` ``````

Analysis

Once a network is loaded or created, you may use the various options in the Statistics menu to analyse it.

For instance, the first option of Statistics menu (Network Symmetry) tells you whether the network is symmetric or not. A network is symmetric when for every edge (i,j) in the set E, the 'opposite' (j,i) edge also exists in E.

Distances & Diameter

The next few options in the Statistics menu (Graph Distance, Average Graph Distance, Distance Matrix and Diameter) let you calculate the geodesic distance between any two nodes and the mean distance between all nodes, print the network distance matrix and calculate the network diameter, respectively. Each option is explained below.

Distance

The geodesic distance is the length of the shortest path between two connected nodes. By clicking on the "Geodesic Distance" option (or Ctrl+G) you will be asked for source and target nodes, and then their geodesic will be calculated and displayed.

Distance Matrix

The 'Distance Matrix' option calculates and displays two matrices; the first is the matrix of distances and the second (sigma) the matrix of the number of shortest paths between any two nodes. The latter is used in Centralities calculation (see below).

Graph Diameter

The diameter of a network is the maximum length of all shortest paths between any two connected nodes.

Clustering Coefficient

The Clustering Coefficient of a node quantifies how close the node and its neighbors are to being a clique. This is used to determine whether a network is a small-world or not.
This option calculates and displays the clustering coefficients of all nodes.

Tip: All the basic network statistics, such as nodes, edges and density are constantly displayed in the Statistics tab of the left dock.

When you click on the "Triad Census" menu option, SocNetV examines each of the triads present in your network, and counts how many of these belong to a certain triad type.
Some background:

In any network of N actors, there are C(N,3) triads.
For instance, in a network of 6 actors there are C(4,3)=20 triads, whereas in a network of 10 actors there are C(10,3)=60 triads.

In a any case, though, there can be only sixteen different triad types (isomophism classes).
Every one of the C(N,3) triads of a network must belong (be isomorphic) to one of these sixteen types.

A Triad Census is a method which counts all the different types (classes) of observed triads within a network.
The triad types are coded and labeled according to their number of mutual, asymmetric and non-existent (null) dyads.

We follow the M-A-N labeling scheme, as described by Holland, Leinhardt and Davis in their studies.
In the M-A-N scheme, each triad type has a label with four characters:

- The first character is the number of mutual (M) duads in the triad. Possible values: 0, 1, 2, 3.
- The second character is the number of asymmetric (A) duads in the triad. Possible values: 0, 1, 2, 3.
- The third character is the number of null (N) duads in the triad. Possible values: 0, 1, 2, 3.
- The fourth character is infered from features or the nature of the triad, i.e. presence of cycle or transitivity. Possible values: none, D ("Down"), U ("Up"), C ("Cyclic"), T ("Transitive")

In the seven rows below, you can see all the sixteen triad types (classes).
Within each row, all the triad types have the same number of arcs present:
003
012
102 021D 021U 021C
111D 111U 030T 030C
201 120D 120U 120C
210
300

So, when you click on Triad Census menu option, SocNetV calculates and displays a vector T of length 16.
Each vector element (Tu) is the frequency of each one triad type inside the active network, i.e. T003 = 3.
Furthermore, the order of the elements of vector T is the same as the aforementioned ordering of the triad types:

T = [ T003, T012, T102, T021D, T021U, T021C, T111D, T111U, T030T, T030C, T201, T120D, T120U, T120C, T210, T300 ]

Apparently, the sum of all these frequencies Tu is C(N,3).

Centralities

Social network analysts use various metrics (measures or indeces) to calculate how 'central' or important each actor (node) is inside a network (graph). For instance, we might want to know how important is a person inside her friendship network or how critical is a power station inside the power company grid... There are various metrics, calculating different things, but they are usually refered to as 'centralities' collectively. For instance, SocNetV can calculate betweeness, closeness, degree, stress, graph and eccentricity centralities.

Centralities are calculated for each node and for the whole network. Thus, when you click on a centrality option, SocNetV will calculate the corresponding index of every node and the whole network and it will display them in a new window (a small text editor). From there you can save the analysis into a text file of your choice. By default, analysis files are saved on bin/ subfolder.

In-Degree Centrality

In-Degree Centrality (IDC) is the number of arcs ending at each node. The degree is a measure of the 'activity' of the node. Most in-degree central node might be considered more prominent among others.

Out-Degree Centrality

Out-Degree Centrality (ODC) is the number of arcs starting from each node. This is oftenly a measure of activity.

Closeness Centrality

Closeness Centrality (CC) is the invert sum of the shortest distances between each node and every other node. It is interpreted as the ability to access information through the "grapevine" of network members.

Betweeness Centrality

The Betweeness Centrality (BC) is the ratio of all geodesics between pairs of nodes which run through each node. It reflects how often an node lies on the geodesics between the other nodes of the network.

Stress Centrality

The Stress Centrality (SC) of a node k is the total number of geodesics between all other nodes which run through k. When one node falls on all other geodesics between all the remaining (N-1) nodes, then we have a star graph with maximum Graph Centrality.

Graph Centrality

Graph Centrality (GC) is the invert of the maximum of all geodesic distances from a node to all other nodes in the network. Nodes with high GC have short distances to all other nodes in the graph. In not-connected networks, the centrality values of all nodes will be zero, since the distance to some nodes is infinite.

Eccentricity Centrality

The Eccentricity Centrality (EC) of a node k is the largest geodesic distance (k,t) from every other vertex. Therefore, EC(u) reflects how far, at most, is each node from every other node.

Power Centrality

The Power Centrality (PC) is a centrality measure suggested by Gil and Schmidt. For each node k, the index sums its degree (with weight 1), with the size of the 2nd-order neighbourhood (with weight 2), and in general, with the size of the kth order neighbourhood (with weight k).

Thus, for each node in the network the most important other nodes are its immediate neighbours and then in decreasing importance the nodes of the 2nd-order neighbourhood, 3rd-order neighbourhood etc.

For each node, the sum obtained is normalised by the total numbers of nodes in the same component minus 1.

Information Centrality

The Information Centrality (IC) is an index suggested by Stephenson and Zelen (1989). It tries to measure the information which is contained in all paths starting with each actor.

In order to calculate the IC of each actor, we create a N x N matrix A with:

Aii=1+weighted_degree_ni
Aij=1 if (i,j)=0
Aij=1-wij if (i,j)=wij

Next, we compute the inverse matrix of A, for instance C. Note that we can always compute C since the matrix A is always a diagonally strong matrix, hence it is always invertible.

Finally, IC is computed by the formula:

IC(i) - 1 / [ Cii + (T-2R)/ N]

where:
T is the trace of matrix C (the sum of diagonal elements) and R is the sum of the elements of any row (since all rows of C have the same sum)

IC has a minimum value but not a maximum.

``````