[igraph] Community detection using leadng eigen vector for weigthed undirected graphs

[Mahesh Vemula]

Hello,

I am trying to use igraph to find community structure among a set of nodes. For this purpose
I build a graph from the Adjaceny matrix and then call the  community_leading_eigenvector method.


 Q = igraph.Graph.Weighted_Adjacency( adj_mat, mode=igraph.ADJ_UNDIRECTED)
 cls = Q.community_leading_eigenvector(clusters=10)

The output when i look for cls.membership is the entire list of nodes (when no of clusters is
fixed to 10) and cls.modularity = 0.

o I computed the leading eigen values and eigen vector and could see some structure. Yet
the method returns all zeros.

o Is there some example for testing the method community_leading_eigenvector on weighted
undirected graphs to verify if the python build is working.

Can somebody please help me. 


Thanks a lot
Mahesh