3 ms·
Is there a description available of the algorithm used to generate the 'cluster diagrams'? Really nice work.
by thesnark 13y ago
Is there a description available of the algorithm used to generate the 'cluster diagrams'?
Really nice work.
- taliesinb 13y agoThanks! Some of the plots use this: http://reference.wolfram.com/mathematica/ref/CommunityGraphPlot.html http://reference.wolfram.com/mathematica/ref/CommunityGraphP... The underlying community detection uses: http://reference.wolfram.com/mathematica/ref/FindGraphCommunities.html http://reference.wolfram.com/mathematica/ref/FindGraphCommun... If you look under "Method", there are a bunch of different methods to use that I'm told correspond to various landmark papers in the field. If you know about community detection, you'll recognize which methods correspond to which papers, but if you don't, why do you care? At least, that's our philosophy for documentation, but I'm not sure I entirely agree with that philosophy.
- p3r1 13y agoI found the methods very interesting and thanks for the work. Have you thought to add the Surprise method? http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0024195 http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjourna... It appears to solve the resolution limit of modularity.
- taliesinb 13y agoThanks, I've forwarded that to our graph algorithms group.