Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Thanks!

Some of the plots use this: http://reference.wolfram.com/mathematica/ref/CommunityGraphP...

The underlying community detection uses: 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.



I 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%2Fjourna... It appears to solve the resolution limit of modularity.


Thanks, I've forwarded that to our graph algorithms group.




Consider applying for YC's Fall 2026 batch! Applications are open till July 27.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: