A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph
From MaRDI portal
Publication:6074667
DOI10.1002/rsa.21007arXiv1901.01876OpenAlexW3151053811MaRDI QIDQ6074667
No author found.
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.01876
phase transitionlarge deviationsempirical measuremultiplicative coalescentErdős-Rényi random graphsizesgelationcomponent sizes
Related Items (3)
Large deviations of the greedy independent set algorithm on sparse random graphs ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ Upper large deviations for power-weighted edge lengths in spatial random networks
Cites Work
- Unnamed Item
- Unnamed Item
- The large deviation principle for the Erdős-Rényi random graph
- Large deviations of empirical neighborhood distribution in sparse random graphs
- On large deviation properties of Erdős-Rényi random graphs
- Large deviations techniques and applications.
- Tree-valued Markov chains derived from Galton-Watson processes
- Polymers and random graphs
- Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
- Smoluchowski's coagulation equation: Uniqueness, nonuniqueness and a hydrodynamic limit for the stochastic coalescent
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Some large deviation results for sparse random graphs
- Stochastic processes in random graphs
- Nonlinear large deviations
- An introduction to large deviations for random graphs
- Large Deviations for Empirical Cycle Counts of Integer Partitions and Their Relation to Systems of Bosons
- On tree census and the giant component in sparse random graphs
- Paths in graphs
- The phase transition in inhomogeneous random graphs
- Non-equilibrium Thermodynamical Principles for Chemical Reactions with Mass-Action Kinetics
- On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
This page was built for publication: A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph
