Class SocialNetworkAnalysis

java.lang.Object

org.episteme.social.sociology.SocialNetworkAnalysis

public final class SocialNetworkAnalysis
extends Object

Provides primitive algorithms and metrics for Social Network Analysis (SNA).

Since:

1.0

Version:

1.1

Author:

Silvere Martin-Michiellot, Gemini AI (Google DeepMind)

Method Summary

Modifier and Type	Method	Description
static <T> Map<T,Real>	calculateDegreeCentrality(Map<T,List<T>> adjacencyList, boolean normalized)	Calculates the degree centrality of each node in a network graph.

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

calculateDegreeCentrality

public static <T> Map<T,Real> calculateDegreeCentrality(Map<T,List<T>> adjacencyList,
 boolean normalized)

Calculates the degree centrality of each node in a network graph. Degree centrality is defined as the number of links incident upon a node.

Type Parameters:

T - the type of the node identifier

Parameters:

adjacencyList - a map representing the graph, where keys are nodes and values are lists of neighbors

normalized - if true, the centrality score is normalized by dividing by (n-1)

Returns:

a map associating each node with its centrality score