A large-deviations principle for all the components in a sparse inhomogeneous random graph
DOI10.1007/s00440-022-01180-7zbMath1514.05141arXiv2111.13200OpenAlexW3216336289MaRDI QIDQ6045832
No author found.
Publication date: 12 May 2023
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.13200
projective limitslarge deviationsstochastic block modelErdős-Rényi random graphinhomogeneous random graphsparse random graphasymptotics for connection probabilitiesempirical measures of componentsFlory equationgiant cluster phase transitionspatial coagulation model
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Large deviations (60F10) Random measures (60G57) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Cites Work
- Uniqueness of post-gelation solutions of a class of coagulation equations
- Scaling limits for critical inhomogeneous random graphs with finite third moments
- The large deviation principle for the Erdős-Rényi random graph
- Novel scaling limits for critical inhomogeneous random graphs
- Large deviations of empirical neighborhood distribution in sparse random graphs
- Erdős-Renyi random graphs \(+\) forest fires \(=\) self-organized criticality
- Large deviations techniques and applications.
- A combinatorial proof of the multivariable Lagrange inversion formula
- Gibbs measures and phase transitions
- Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
- Some large deviation results for sparse random graphs
- Cluster coagulation
- A large deviation principle for the Erdős-Rényi uniform random graph
- Lagrange inversion and combinatorial species with uncountable color palette
- Age evolution in the mean field forest fire model via multitype branching processes
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- Virial inversion and density functionals
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Counting trees using symmetries
- Eigenvalues outside the bulk of inhomogeneous Erdős-Rényi random graphs
- An introduction to large deviations for random graphs
- Critical behavior in inhomogeneous random graphs
- Connectivity of inhomogeneous random graphs
- The phase transition in inhomogeneous random graphs
- Random Graphs
- On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
- The large deviation principle for inhomogeneous Erdős-Rényi random graphs
This page was built for publication: A large-deviations principle for all the components in a sparse inhomogeneous random graph
