A large deviation principle for the Erdős-Rényi uniform random graph
From MaRDI portal
Publication:1990048
DOI10.1214/18-ECP181zbMath1398.05179arXiv1804.11327OpenAlexW2898122235MaRDI QIDQ1990048
Publication date: 24 October 2018
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.11327
Related Items
Upper tails via high moments and entropic stability, Large deviation for uniform graphs with given degrees, Replica symmetry in upper tails of mean-field hypergraphs, A large-deviations principle for all the components in a sparse inhomogeneous random graph, Upper tail for homomorphism counts in constrained sparse random graphs, Moderate deviations in cycle count, Existence of a symmetric bipodal phase in the edge-triangle model, Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph, Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The large deviation principle for the Erdős-Rényi random graph
- Limits of dense graph sequences
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Large deviations techniques and applications.
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Ensemble equivalence for dense graphs
- Upper tails and independence polynomials in random graphs
- Multipodal structure and phase transitions in large constrained graphs
- Nonlinear large deviations
- Phase transitions in a complex network
- On replica symmetry of large deviations in random graphs
- On the Distribution of the Number of Successes in Independent Trials
- The phases of large networks with edge and triangle constraints
- Bipodal Structure in Oversaturated Random Graphs
- On the Lower Tail Variational Problem for Random Graphs
- On the variational problem for upper tails in sparse random graphs
