|Subject:||Re: [igraph] Generation of Random Graphs According to Some Rules|
|Date:||Sun, 25 Oct 2009 15:44:20 +0000|
I have no idea of how to deal with requirements (2) to (5) [it does not sound trivial to me] hence any suggestion is really appreciated.I am not aware of any graph rewiring methods that are able to preserve the properties you mentioned, except for the degree distribution. The problem is that a single rewiring step (i.e., the addition, removal or rearrangement of an edge) has a very unpredictable effect on the properties you mentioned. I could be wrong, though...
|[Prev in Thread]||Current Thread||[Next in Thread]|