Limit of connected multigraph with fixed degree sequence - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Limit of connected multigraph with fixed degree sequence

Résumé

Motivated by the scaling limits of the connected components of the configuration model, we study uniform connected multigraphs with fixed degree sequence $\mathcal{D}$ and with surplus $k$. We call those random graphs $(\mathcal{D},k)$-graphs. We prove that, for every $k\in \mathbb N$, under natural conditions of convergence of the degree sequence, ($\mathcal{D},k)$-graphs converge toward either $(\mathcal{P},k)$-graphs or $(\Theta,k)$-ICRG (inhomogeneous continuum random graphs). We prove similar results for $(\mathcal{P},k)$-graphs and $(\Theta,k)$-ICRG, which have applications to multiplicative graphs. Our approach relies on two algorithms, the cycle-breaking algorithm, and the stick-breaking construction of $\mathcal{D}$-tree that we introduced in a recent paper arXiv:2110.03378. From those algorithms we deduce a biased construction of $(\mathcal{D},k)$-graph, and we prove our results by studying this bias.
Fichier principal
Vignette du fichier
Uniform_Graph.pdf (385.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03872833 , version 1 (25-11-2022)

Identifiants

Citer

Arthur Blanc-Renaudie. Limit of connected multigraph with fixed degree sequence. 2022. ⟨hal-03872833⟩
10 Consultations
3 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More