Mathematica Stack Exchange is a question and answer site for users of Mathematica. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I've been applying the VertexMoving method to some graph data, and it's producing very useful results. However, I've got no clue as to what this method actually is, and the documentation is spectacularly vague. Does anyone know what this method does?

share|improve this question
My guess it's some version of "divide vertices into two groups, then move one vertex that has maximal increase / smallest decrease in modularity, repeat until all vertices moved only once, find maximal modularity intermediate state, repeat whole process on that until no further increase in modularity..." kind of thing found in literature. Most based on 70's work of Kernighan & Lin (yes, that Kernighan ) – ciao May 6 '14 at 22:44
What is this method? FindGraphCommunities[g,Method->"VertexMoving"] doesn't do anything.... – becko Dec 5 '14 at 16:53
Related: – Szabolcs Oct 17 '15 at 12:48

Update: I got excellent answers from people elsewhere, so I'll post them here for anyone who finds this question in the future. It turns out that the algorithm is described in these papers:

share|improve this answer
+1 for the links/ – ciao May 8 '14 at 0:00

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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