[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Generation of Random Graphs According to Some Rules

From: Jonathan Donges
Subject: Re: [igraph] Generation of Random Graphs According to Some Rules
Date: Sun, 25 Oct 2009 17:46:00 +0100

Dear Lorenzo,

There is a paper by G. Zamora-Lopez et al., namely "The generation of random directed networks with
prescribed 1-node and 2-node degree correlations", in

J. Phys. A: Math. Theor. 41 (2008) 224006 (15pp) doi:10.1088/1751-8113/41/22/224006 

This could be exactly what you are looking for, at least for the degree-degree correlation case.


Am 25.10.2009 um 16:44 schrieb Tamas Nepusz:

Dear Lorenzo,

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...


igraph-help mailing list

reply via email to

[Prev in Thread] Current Thread [Next in Thread]