Newman’s clustering algorithm

RONAALP.utilities.clustering_newman(A, epsilon=0.1)

Perform Newmann clustering on adjacency matrix A given epsilon threshold.

Parameters

Aarray-like, shape (N,N), distance matrix

epsilonfloat, default=1e-1

thresholding to build adjacency matrix

Returns

AAarray-like, shape (N,N)

AA_array-like, shape (N,N), graph matrix obtained with thresholding

AAAarray-like, shape (N,N), ordered graph matrix

Ciarray-like, shape (N,1) cluster label of each pts.

ncint, number of communities found by the algorithm

References

1

Leicht, E. A., & Newman, M. E. (2008). Community structure in directed networks. Physical review letters, 100(11), 118703.