Fast generation of random connected graphs with prescribed degrees
| dc.creator | Viger, Fabien | |
| dc.creator | Latapy, Matthieu | |
| dc.date | 2005-02-22 | |
| dc.date.accessioned | 2026-07-07T03:22:33Z | |
| dc.date.available | 2026-07-07T03:22:33Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0502085 | |
| dc.identifier | http://arxiv.org/abs/cs/0502085 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32640 | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.2 | |
| dc.title | Fast generation of random connected graphs with prescribed degrees | |
| dc.type | text |