Take the 2-minute tour ×
Mathematica Stack Exchange is a question and answer site for users of Mathematica. It's 100% free, no registration required.

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?

share|improve this question

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, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

1 Answer 1

up vote 4 down vote accepted

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).

share|improve this answer
My bad, poor googling skills. –  iav Sep 3 '12 at 7:38
+1 for arXiv link –  Mr.Wizard Sep 14 '12 at 10:00

Not the answer you're looking for? Browse other questions tagged or ask your own question.