Network Analyzer

Calculates different network statistics.

Node Analyzer:

1. Node degree: Counts the number of incident edges. The percent degree is the percentage of edges in comparison to the total amount of edges.
2. In/out degree: Counts the number of incoming/outgoing edges. The percent incoming/outgoing degree is the percentage of edges in comparison to the total amount of edges.
3. Closeness centrality: Divides the number of nodes of the component by the sum of all distances from the analyzed node to all other nodes within the component. The node with the highest value is the most central node of its component.
4. Node weight: The sum of the weight of all incident edges and the average weight.
5. Clustering coefficient: Analyzes the neighborhood of the node. If they form a clique the coefficient is 1 and if no neighbor is connected to another neighbor it is 0.
6. Hubs & Authority: Assigns hub and authority scores to each node depending on the topology of the network. The essential idea is that a node is a hub to the extent that it links to authoritative nodes, and is an authority to the extent that it is referenced by 'hub' nodes. The analyzer considers existing edge weights as similarities and thus converts the edge weight to a distance by calculating edgeWeight - maxEdgeWeight. To calculate the score the implementation of JUNG the Java Universal Network/Graph Framework is used.
7. Barycenter: Assigns scores to each node according to the sum of its distances to all other nodes. Since the edge weight by default represents a similarity it is converted to a distance by computing maxEdgeWeight - edgeWeight. To calculate the score the implementation of JUNG the Java Universal Network/Graph Framework is used.

Edge Analyzer:

1. Edge degree: Counts the number of incident nodes. The percent degree is the percentage of nodes in comparison to the total amount of nodes.
2. Edge weight: The sum of the weight of all incident nodes and the average weight.

Graph Analyzer:

1. Connected component: Counts the number of connected components and analyzes the size (number of nodes) of each component.
2. Partition counter: The number of partitions in this graph.
3. Node counter: The number of nodes in this graph.
4. Edge counter: The number of edges in this graph.