Limit of connected multigraph with fixed degree sequence

arXiv2112.07725MaRDI QIDQ6385698FDOQ6385698

Authors: Arthur Blanc-Renaudie 

Publication date: 14 December 2021

Abstract: Motivated by the scaling limits of the connected components of the configuration model, we study uniform connected multigraphs with fixed degree sequence $mathcalD$ and with surplus $k$. We call those random graphs $(mathcalD,k)$-graphs. We prove that, for every $kinmathbbN$, under natural conditions of convergence of the degree sequence, ($mathcalD,k)$-graphs converge toward either $(mathcalP,k)$-graphs or $(Theta,k)$-ICRG (inhomogeneous continuum random graphs). We prove similar results for $(mathcalP,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 $mathcalD$-tree that we introduced in a recent paper arXiv:2110.03378. From those algorithms we deduce a biased construction of $(mathcalD,k)$-graph, and we prove our results by studying this bias.

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05)

This page was built for publication: Limit of connected multigraph with fixed degree sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6385698)