|
From: | Gang Su |
Subject: | [igraph] Random Graph Genereation |
Date: | Mon, 28 Apr 2008 20:39:23 -0400 |
User-agent: | Thunderbird 2.0.0.12 (Windows/20080213) |
Dear developers,Is there any algorithms that could be used to generate a random graph with known modularity? Newman has tested the community detection algorithms on a 4 cluster model, is there any algorithms that can be used to generate larger networks with known modularity,
but with defined edge degree distribution(power law)? Thanks Gang
[Prev in Thread] | Current Thread | [Next in Thread] |