Large deviation for uniform graphs with given degrees
From MaRDI portal
Publication:2170378
DOI10.1214/21-AAP1745MaRDI QIDQ2170378
Publication date: 5 September 2022
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.07666
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Large deviations (60F10)
Related Items (3)
The large deviation principle for inhomogeneous Erdős-Rényi random graphs ⋮ A sample-path large deviation principle for dynamic Erdős-Rényi random graphs ⋮ Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Phase transitions in exponential random graphs
- Random graphs with a given degree sequence
- The large deviation principle for the Erdős-Rényi random graph
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Large deviations techniques and applications.
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Phases in large combinatorial systems
- Ensemble equivalence for dense graphs
- Asymptotic enumeration by degree sequence of graphs of high degree
- A large deviation principle for the Erdős-Rényi uniform random graph
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Regular graphs with many triangles are structured
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015
- Upper tails and independence polynomials in random graphs
- Multipodal structure and phase transitions in large constrained graphs
- Estimating and understanding exponential random graph models
- Large deviations and exact asymptotics for constrained exponential random graphs
- Nonlinear large deviations
- Concentration Inequalities
- Phase transitions in a complex network
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- On replica symmetry of large deviations in random graphs
- Updating the Inverse of a Matrix
- The phases of large networks with edge and triangle constraints
- Bipodal Structure in Oversaturated Random Graphs
- On the asymptotics of constrained exponential random graphs
- The number of graphs and a random graph with a given degree sequence
- A counterexample to the DeMarco‐Kahn upper tail conjecture
- On the variational problem for upper tails in sparse random graphs
- Upper tail for homomorphism counts in constrained sparse random graphs
This page was built for publication: Large deviation for uniform graphs with given degrees