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?

  • $\begingroup$ 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 ) $\endgroup$
    – ciao
    May 6 '14 at 22:44
  • $\begingroup$ What is this method? FindGraphCommunities[g,Method->"VertexMoving"] doesn't do anything.... $\endgroup$
    – becko
    Dec 5 '14 at 16:53
  • $\begingroup$ Related: mathematica.stackexchange.com/q/58136/12 $\endgroup$
    – 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:




Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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