[Dmbu-l] Cool Synthetic Graphs
natalir at bu.edu
Wed Sep 10 20:12:38 EDT 2014
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:
And here is the code:
(I am using package 1)
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Dmbu-l