I'm using CommunityStructureAssginment[] from GraphUtilities but not sure what is the algorithm behind it.
May be someone knows what is the algorithm? Or any info on the community structure identification algorithms implemented in Mathematica?
Tell me more
×
Mathematica Stack Exchange is a question and answer site for
users of Mathematica. It's 100% free, no registration required.
|
|
||||
|
|
closed as too localized by F'x, Oleksandr R., halirutan, rm -rf♦, belisarius Sep 3 '12 at 21:13
This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, see the FAQ.
|
The GraphUtilities documentation has a whole section that should answer your question: “Algorithms for Finding Community Structure”. The reference for the algorithm it uses is: A. Clauset, "Finding Local Community Structure in Networks," Physical Review E, 72, 026132, 2005 (arXiv mirror). |
|||||
|
|
