[Dmbu-l] Cool Synthetic Graphs

Natali Ruchansky natalir at bu.edu
Wed Sep 10 20:12:38 EDT 2014


Hi all,

So my work this summer required me to play with graphs that have strong
communities.  I want to share with you all a paper I found that comes with
code to produce synthetic graphs with such properties.

Their goal is to create a benchmark graph to test community detection
algorithms on.  The code has many parameters and give ability to vary
connectivity within and between communities.  It can be slow for more than
5 or 10k, but its nice.

This is the paper:
http://arxiv.org/pdf/0805.4770v4.pdf

And here is the code:
https://sites.google.com/site/santofortunato/inthepress2
(I am using package 1)

Natali :)
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://cs-mailman.bu.edu/pipermail/dmbu-l/attachments/20140910/56c9c826/attachment.html>


More information about the Dmbu-l mailing list