Efficient and simple generation of random simple connected graphs with prescribed degree sequence - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Complex Networks Année : 2016

Efficient and simple generation of random simple connected graphs with prescribed degree sequence

Fabien Viger
  • Fonction : Auteur
Matthieu Latapy

Résumé

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 introduce optimality conditions, and show how this optimality can be reached in practice. We then propose a different approach, specifically designed for real-world degree distributions, which outperforms the first one. Based on a conjecture which we argue rigorously and which was confirmed by strong empirical evidence, we finally reduce the best asymptotic complexity bond known so far.
Fichier principal
Vignette du fichier
article.pdf (564.98 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01468081 , version 1 (15-02-2017)

Identifiants

Citer

Fabien Viger, Matthieu Latapy. Efficient and simple generation of random simple connected graphs with prescribed degree sequence. Journal of Complex Networks, 2016, 4 (1), pp.15 - 37. ⟨10.1093/comnet/cnv013⟩. ⟨hal-01468081⟩
143 Consultations
674 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More