News for hackers. Stuff that matters.
Re:Data Science of the Facebook World by taliesinb on Wednesday April 24, 2013 @05:20PM (#5604050)
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.

Re:Data Science of the Facebook World by p3r1 on Wednesday April 24, 2013 @06:53PM (#5604503)
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.
Re:Data Science of the Facebook World by taliesinb on Wednesday April 24, 2013 @07:41PM (#5604750)
Thanks, I've forwarded that to our graph algorithms group.