7

Does somebody have some interesting references on the FindGraphPartition and FindGraphCommunties[.., Method -> "Spectral"] functions and their algorithms as implemented by Mathematica 9.

J. M.'s missing motivation
  • 124,525
  • 11
  • 401
  • 574
DuK
  • 111
  • 4
  • The Applications of the documentation has interesting references. FindGraphPartition and FindGraphCommunities. – Öskå Apr 26 '14 at 16:46
  • I mean scientifically notably with spectral method – DuK Apr 26 '14 at 16:48
  • Have you made a Google search? What did you find? Why wasn't it sufficient? – m_goldberg Apr 26 '14 at 19:40
  • 3
    I don't think this is a bad question or worthy of downvotes. Of course one can't find information on implementation details simply by searching on the general terms mentioned in the documentation. At best, you can find information about implementations in general, with no way of knowing which one is used in Mathematica. Other functions have references to specific literature, and I don't think it's unreasonable to ask for references for these functions as well. (Sometimes these can be found in the `Combinatorica`` source code.) – Oleksandr R. Apr 26 '14 at 19:52
  • 1
    @Oleksandr R Yes I see documentation but is not enough for me.These functions are not in combinatorica package so I can't see source code – DuK Apr 26 '14 at 20:00
  • The IGraph/M package implements many community detection algorithms. The documentation has references to the original publications for each method. – Szabolcs May 05 '17 at 13:58

1 Answers1

5

What the exact implementation is in Mathematica, I don't know. You can't know unless you have access to the source code or part of the research team. Assuming, however, that they used the fairly standard technique of spectral modularity maximization I hope these references are useful: