Scaling limits for critical inhomogeneous random graphs with finite third moments
From MaRDI portal
(Redirected from Publication:638341)
Abstract: We identify the scaling limits for the sizes of the largest components at criticality for inhomogeneous random graphs when the degree exponent satisfies . We see that the sizes of the (rescaled) components converge to the excursion lengths of an inhomogeneous Brownian motion, extending results of cite{Aldo97}. We rely heavily on martingale convergence techniques, and concentration properties of (super)martingales. This paper is part of a programme to study the critical behavior in inhomogeneous random graphs of so-called rank-1 initiated in cite{Hofs09a}.
Recommendations
- Novel scaling limits for critical inhomogeneous random graphs
- The component sizes of a critical random graph with given degree sequence
- Continuum limit of critical inhomogeneous random graphs
- Cluster tails for critical power-law inhomogeneous random graphs
- Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
Cited in
(42)- Spectral bounds in random graphs applied to spreading phenomena and percolation
- Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
- Survey of scalings for the largest connected component in inhomogeneous random graphs
- Universality for critical heavy-tailed network models: metric structure of maximal components
- Novel scaling limits for critical inhomogeneous random graphs
- Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
- Component structure of the configuration model: barely supercritical case
- The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs
- Heavy-tailed configuration models at criticality
- Mesoscopic scales in hierarchical configuration models
- A large-deviations principle for all the components in a sparse inhomogeneous random graph
- The probability of unusually large components in the near-critical Erdős-Rényi graph
- Big jobs arrive early: from critical queues to random graphs
- Eigenvalues outside the bulk of inhomogeneous Erdős-Rényi random graphs
- A probabilistic approach to the leader problem in random graphs
- Upper bounds for the largest component in critical inhomogeneous random graphs
- Cluster tails for critical power-law inhomogeneous random graphs
- The eternal multiplicative coalescent encoding via excursions of Lévy-type processes
- The scaling window for a random graph with a given degree sequence
- Phase transition in random distance graphs on the torus
- On moments of multiplicative coalescents
- Aggregation models with limited choice and the multiplicative coalescent
- The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
- The component sizes of a critical random graph with given degree sequence
- Scaling limits of random trees and random graphs
- Critical behavior in inhomogeneous random graphs
- Heavy-traffic analysis through uniform acceleration of queues with diminishing populations
- The probability of unusually large components for critical percolation on random \(d\)-regular graphs
- Critical epidemics, random graphs, and Brownian motion with a parabolic drift
- Epidemics on critical random graphs with heavy-tailed degree distribution
- Critical percolation on scale-free random graphs: new universality class for the configuration model
- Asymptotics for the size of the largest component scaled to ``\(\log n\) in inhomogeneous random graphs
- Stable graphs: distributions and line-breaking construction
- Expansion of Percolation Critical Points for Hamming Graphs
- Critical random forests
- Scale-free percolation
- Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems
- The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
- Continuum limit of critical inhomogeneous random graphs
- Feller property of the multiplicative coalescent with linear deletion
This page was built for publication: Scaling limits for critical inhomogeneous random graphs with finite third moments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638341)