Fast generation of random connected graphs with prescribed degrees
Fabien Viger, Matthieu Latapy
Abstract
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.
Create a lesson
Related papers
Goal-Oriented Bundle Management and Flow Control for Deep-Space Communications via Reinforcement Learning
Sajjad Baghaeea, Aimin Lib, Shanmugarajan Balasubramanian et al.
One-Way Delay Model for 5G Low Latency, High Data Rate Communications
Hamid Hassani, Sonia M. Heemstra de Groot, Ignas G. Niemegeers et al.
RAPID: Proactive Rate Control for Enabling High Data Rate and Low Latency in 5G Edge Networks
Hamid Hassani, Sonia M. Heemstra de Groot, Ignas G. Niemegeers et al.
On the Alignment Between Spectral Efficiency and Positioning Accuracy in Multi-LEO Clusters
Konstantinos Kapoglis, Sharief Saleh, Henk Wymeersch et al.
Maneuver Coordination Using V2I to Improve Traffic Efficiency at Intersections
Lorenzo Farina, Marco Rapelli, Barbara Mavì Masini et al.
Configuration Migration Planning through Decoupled Modeling and Searching
Dan Wang, Peng Zhang, Ratul Mahajan