A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
Random graphs with given degrees are a natural next step in complexity beyond the Erdős-Rényi model, yet the degree constraint greatly complicates simulation and estimation. We use an extension of a combinatorial characterization due to Erdős and Gallai to develop a sequential algorithm for generati...
Saved in:
| Published in: | Internet mathematics Vol. 6; no. 4; pp. 489 - 522 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Taylor & Francis Group
09.03.2011
|
| ISSN: | 1542-7951, 1944-9488 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!