Uniform generation of random acyclic digraphs

Details Uniform generation of random acyclic digraphs Uniform generation of random acyclic digraphs

2012-02-29

arxiv.org/abs/1202.6590v1

Statistics

Computation

6 pages

Scientific paper

We show how to sample acyclic digraphs uniformly at random through recursive enumeration. This provides an exact method which avoids the convergence issues of the alternative Markov chain methods. The limiting behaviour of the distribution of acyclic digraphs also allows us to sample arbitrarily large acyclic digraphs. Finally we discuss how to include various restrictions in the combinatorial enumeration for efficient uniform sampling of the corresponding graphs.

Affiliated with

Also associated with

No associations

Rating

Uniform generation of random acyclic digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Uniform generation of random acyclic digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniform generation of random acyclic digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524993