Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
From MaRDI portal
Publication:2868085
DOI10.1002/RSA.20503zbMATH Open1278.05227arXiv0907.0897OpenAlexW1890866918MaRDI QIDQ2868085FDOQ2868085
Publication date: 23 December 2013
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Abstract: Consider the random graph on vertices . Each vertex is assigned a type with being independent identically distributed as a nonnegative discrete random variable . We assume that . Given types of all vertices, an edge exists between vertices and independent of anything else and with probability . We study the critical phase, which is known to take place when . We prove that normalized by the asymptotic joint distributions of component sizes of the graph equals the joint distribution of the excursions of a reflecting Brownian motion with diffusion coefficient and drift . This shows that finiteness of is the necessary condition for the diffusion limit. In particular, we conclude that the size of the largest connected component is of order .
Full work available at URL: https://arxiv.org/abs/0907.0897
Cites Work
- Title not available (Why is that?)
- The phase transition in inhomogeneous random graphs
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Asymptotic equivalence and contiguity of some random graphs
- Novel scaling limits for critical inhomogeneous random graphs
- Scaling limits for critical inhomogeneous random graphs with finite third moments
- Critical percolation on random regular graphs
- The final size of a nearly critical epidemic, and the first passage time of a Wiener process to a parabolic barrier
- The Largest Component in Subcritical Inhomogeneous Random Graphs
Cited In (14)
- 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
- A large-deviations principle for all the components in a sparse inhomogeneous random graph
- Mesoscopic scales in hierarchical configuration models
- Cluster tails for critical power-law inhomogeneous random graphs
- The eternal multiplicative coalescent encoding via excursions of Lévy-type processes
- Phase transition in random distance graphs on the torus
- On moments of multiplicative coalescents
- Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
- The component sizes of a critical random graph with given degree sequence
- Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs
- Stable graphs: distributions and line-breaking construction
- Critical random forests
- Continuum limit of critical inhomogeneous random graphs
This page was built for publication: Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868085)