THE STABLE GRAPH: THE METRIC SPACE SCALING LIMIT OF A CRITICAL RANDOM GRAPH WITH I.I.D. POWER-LAW DEGREES

Guillaume Conchon-Kerjan, Christina Goldschmidt

Research output: Contribution to journalArticlepeer-review

Abstract

We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent α + 1, where α ∈ (1, 2). The limiting components are constructed from random R-trees encoded by the excursions above its running infimum of a process whose law is locally absolutely continuous with respect to that of a spectrally positive α-stable Lévy process. These spanning R-trees are measure-changed α-stable trees. In each such R-tree, we make a random number of vertex identifications, whose locations are determined by an auxiliary Poisson process. This generalises results, which were already known in the case where the degree distribution has a finite third moment (a model which lies in the same universality class as the Erdős–Rényi random graph) and where the role of the α-stable Lévy process is played by a Brownian motion.

Original languageEnglish
Pages (from-to)1-69
Number of pages69
JournalAnnals of Probability
Volume51
Issue number1
DOIs
Publication statusPublished - 1 Jan 2023

Keywords

  • Random graph
  • Scaling limit
  • Stable lévy processes.

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'THE STABLE GRAPH: THE METRIC SPACE SCALING LIMIT OF A CRITICAL RANDOM GRAPH WITH I.I.D. POWER-LAW DEGREES'. Together they form a unique fingerprint.

Cite this