Fast generation of random connected graphs with prescribed degrees

Details Fast generation of random connected graphs with prescribed degrees Fast generation of random connected graphs with prescribed degrees

2005-02-22

arxiv.org/abs/cs/0502085v1

Computer Science

Networking and Internet Architecture

Scientific paper

We address here the problem of generating random graphs uniformly from the set of simple connected graphs having a prescribed degree sequence. Our goal is to provide an algorithm designed for practical use both because of its ability to generate very large graphs (efficiency) and because it is easy to implement (simplicity). We focus on a family of heuristics for which we prove optimality conditions, and show how this optimality can be reached in practice. We then propose a different approach, specifically designed for typical real-world degree distributions, which outperforms the first one. Assuming a conjecture which we state and argue rigorously, we finally obtain an log-linear algorithm, which, in spite of being very simple, improves the best known complexity.

Affiliated with

Also associated with

No associations

Rating

Fast generation of random connected graphs with prescribed degrees 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 Fast generation of random connected graphs with prescribed degrees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast generation of random connected graphs with prescribed degrees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471927