Re: [igraph] On the generation of random directed graphs

[Tamas Nepusz]

Hello,

I haven't read it in detail but it seems like the first part of this paper is
dealing with your problem exactly:

http://www.columbia.edu/~mo2291/Publications/DirectedRandomGraphs_final.pdf

All the best,
T.

On 12/01, Rossano Gaeta wrote:
> Dear all,
> 
> I need to generate instances of random directed graphs where both out and in
> degree distributions can be tuned (provided they have the same average
> values, of course). I think that the C function
> igraph_degree_sequence_game() could serve my purpose but can you suggest a
> robust and efficient algorithm for generating the content of the out_deg and
> in_deg vectors to provide as arguments to igraph_degree_sequence_game()? My
> question arises since the length and sum of out_deg and in_deg must match
> for directed graphs; a straightforward algorithm that samples from the two
> distributions and then checks for equality of sums might take too long to
> terminate.
> 
> Thank you in advance
> Ciao
> Rossano
> 
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

-- 
T.