Open tc opened 14 years ago
IGraph::Community has methods for community detection.
graph.community_leading_eigenvector(steps) → Array
http://igraph.rubyforge.org/igraph/classes/IGraph/Community.html#M000059
Hi, the community_leading_eigenvector computes a different community detection from evcent.
In http://igraph.sourceforge.net/doc/R/igraph.pdf leading.eigenvector.community: "These functions try to find densely connected subgraphs in a graph by calculating the leading non- negative eigenvector of the modularity matrix of the graph."
evcent: "evcent takes a graph (graph) and returns the eigenvector centralities of positions v within it"
I couldn't find a callable eigenvector_centrality function. In R, it's called evcent