Efficient and exact sampling of simple graphs with given arbitrary degree sequence

Details Efficient and exact sampling of simple graphs with given arbitrary degree sequence Efficient and exact sampling of simple graphs with given arbitrary degree sequence

2010-02-15

arxiv.org/abs/1002.2975v1

PLoS ONE 5(4), e10012 (2010).

Physics

Physics and Society

8 pages, 3 figures

Scientific paper

10.1371/journal.pone.0010012

Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet modeling. Existing graph sampling methods are either link-swap based (Markov-Chain Monte Carlo algorithms) or stub-matching based (the Configuration Model). Both types are ill-controlled, with typically unknown mixing times for link-swap methods and uncontrolled rejections for the Configuration Model. Here we propose an efficient, polynomial time algorithm that generates statistically independent graph samples with a given, arbitrary, degree sequence. The algorithm provides a weight associated with each sample, allowing the observable to be measured either uniformly over the graph ensemble, or, alternatively, with a desired distribution. Unlike other algorithms, this method always produces a sample, without back-tracking or rejections. Using a central limit theorem-based reasoning, we argue, that for large N, and for degree sequences admitting many realizations, the sample weights are expected to have a lognormal distribution. As examples, we apply our algorithm to generate networks with degree sequences drawn from power-law distributions and from binomial distributions.

Affiliated with

Also associated with

No associations

Rating

Efficient and exact sampling of simple graphs with given arbitrary degree sequence 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 Efficient and exact sampling of simple graphs with given arbitrary degree sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient and exact sampling of simple graphs with given arbitrary degree sequence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-597825