Stable graphs: distributions and line-breaking construction

For $α\in (1,2]$, the $α$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $α$-dependent power-law tail behavior. It consists of a sequence of compact measured metric spaces (the limiting connected components), each of which is tree-like, in the sense that it consists of an $\mathbb R$-tree with finitely many vertex-identifications (which create cycles). Indeed, given their masses and numbers of vertex-identifications, these components are independent and may be constructed from a spanning $\mathbb R$-tree, which is a biased version of the $α$-stable tree, with a certain number of leaves glued along their paths to the root. In this paper we investigate the geometric properties of such a component with given mass and number of vertex-identifications. We (1) obtain the distribution of its kernel and more generally of its discrete finite-dimensional marginals; we will observe that these distributions are related to the distributions of some configuration models (2) determine the distribution of the $α$-stable graph as a collection of $α$-stable trees glued onto its kernel and (3) present a line-breaking construction, in the same spirit as Aldous' line-breaking construction of the Brownian continuum random tree.

No reviews yet.

No comments yet.