Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
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 bas...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2010-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC2851615?pdf=render |