cdlib.algorithms.hierarchical_link_community

hierarchical_link_community(g_original: object) → cdlib.classes.edge_clustering.EdgeClustering

HLC (hierarchical link clustering) is a method to classify links into topologically related groups. The algorithm uses a similarity between links to build a dendrogram where each leaf is a link from the original network and branches represent link communities. At each level of the link dendrogram is calculated the partition density function, based on link density inside communities, to pick the best level to cut.

Supported Graph Types

Undirected	Directed	Weighted
Yes	No	No

Parameters:g_original – a networkx/igraph object Returns:EdgeClustering object Example:

>>> from cdlib import algorithms
>>> import networkx as nx
>>> G = nx.karate_club_graph()
>>> com = algorithms.hierarchical_link_community(G)

References:

Ahn, Yong-Yeol, James P. Bagrow, and Sune Lehmann. Link communities reveal multiscale complexity in networks. nature 466.7307 (2010): 761.