Stable graphs: distributions and line-breaking construction
From MaRDI portal
Publication:6159721
DOI10.5802/ahl.138zbMath1516.05200arXiv1811.06940MaRDI QIDQ6159721
Christina Goldschmidt, Bénédicte Haas, Delphin Sénizergues
Publication date: 20 June 2023
Published in: Annales Henri Lebesgue (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06940
Related Items (3)
Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ A binary embedding of the stable line-breaking construction ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
Cites Work
- The stable trees are nested
- The component sizes of a critical random graph with given degree sequence
- The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
- Critical window for the configuration model: finite third moment degrees
- Critical random graphs: limiting constructions and distributional properties
- Scaling limits for critical inhomogeneous random graphs with finite third moments
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
- Continuum limit of critical inhomogeneous random graphs
- Novel scaling limits for critical inhomogeneous random graphs
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- The continuum random tree. I
- Spinal partitions and invariance under re-rooting of continuum random trees
- Limit theorems for triangular urn schemes
- Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els
- Contact processes on random graphs with power law degree distributions have critical value 0
- On the re-rooting invariance property of Lévy trees
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- Branching processes in Lévy processes: The exploration process
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Normalized excursion, meander and bridge for stable Lévy processes
- The entrance boundary of the multiplicative coalescent
- A limit theorem for the contour process of conditioned Galton-Watson trees
- The scaling limit of the minimum spanning tree of the complete graph
- Scaling limits for some random trees constructed inhomogeneously
- Probabilistic and fractal aspects of Lévy trees
- Self-similar fragmentations derived from the stable tree. II: Splitting at nodes
- Geometry of the minimal spanning tree of a random 3-regular graph
- Geometry of weighted recursive and affine preferential attachment trees
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- Universality for critical heavy-tailed network models: metric structure of maximal components
- Random gluing of metric spaces
- Heavy-tailed configuration models at criticality
- The vertex-cut-tree of Galton-Watson trees converging to a stable tree
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
- The continuum limit of critical random graphs
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Random stable looptrees
- A line-breaking construction of the stable trees
- Random Graphs and Complex Networks
- Critical behavior in inhomogeneous random graphs
- Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
- The Phase Transition in the Configuration Model
- Critical percolation on random regular graphs
- Tessellations of random maps of arbitrary genus
- Some problems in the enumeration of labelled graphs
- Random trees constructed by aggregation
- A critical point for random graphs with a given degree sequence
- Growing random graphs with a preferential attachment structure
- Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
- The birth of the giant component
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stable graphs: distributions and line-breaking construction
