The large deviation principle for the Erdős-Rényi random graph
From MaRDI portal
Publication:648962
DOI10.1016/j.ejc.2011.03.014zbMath1230.05259arXiv1008.1946MaRDI QIDQ648962
Sourav Chatterjee, Srinivasa R. S. Varadhan
Publication date: 29 November 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.1946
05C80: Random graphs (graph-theoretic aspects)
Related Items
The phases of large networks with edge and triangle constraints, On the asymptotics of constrained exponential random graphs, On the phase transition curve in a directed exponential random graph model, A counterexample to the DeMarco‐Kahn upper tail conjecture, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Asymptotic Structure of Graphs with the Minimum Number of Triangles, On the Lower Tail Variational Problem for Random Graphs, On the variational problem for upper tails in sparse random graphs, A detailed investigation into near degenerate exponential random graphs, Moderate deviations via cumulants, Right-convergence of sparse random graphs, Asymptotic structure and singularities in constrained directed graphs, The polytope of \(k\)-star densities, Mixing time of exponential random graphs, Large deviations of empirical neighborhood distribution in sparse random graphs, Reciprocity in directed networks, On the large deviations of traces of random matrices, Exponential random graphs behave like mixtures of stochastic block models, Upper tails for arithmetic progressions in random subsets, Ensemble equivalence for dense graphs, Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality, The role of topology in large deviations, Sparse maximum-entropy random graphs with a given power-law degree distribution, A large deviation principle for the Erdős-Rényi uniform random graph, Matching polytons, Degeneracy in sparse ERGMs with functions of degrees as sufficient statistics, Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits, Monochromatic subgraphs in randomly colored graphons, Matrix estimation by universal singular value thresholding, Singularities in the entropy of asymptotically large simple graphs, Differential calculus on graphon space, Upper tails and independence polynomials in random graphs, Asymptotic structure of constrained exponential random graph models, Multipodal structure and phase transitions in large constrained graphs, Estimating and understanding exponential random graph models, Nonlinear large deviations, The lower tail: Poisson approximation revisited, An introduction to large deviations for random graphs, Emergent Structures in Large Networks, The missing log in large deviations for triangle counts, On String Graph Limits and the Structure of a Typical String Graph, Ground states for exponential random graphs, Vertex Order in Some Large Constrained Random Graphs, On replica symmetry of large deviations in random graphs, Rare Event Simulation Using Reversible Shaking Transformations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of Stein's method for concentration inequalities
- Random graphs with a given degree sequence
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Quick approximation to matrices and applications
- Representations for partially exchangeable arrays of random variables
- Generalized quasirandom graphs
- The rank of connection matrices and the dimension of graph algebras
- The missing log in large deviations for triangle counts
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Graph limits and exchangeable random graphs
- Contractors and connectors of graph algebras
- Metrics for sparse graphs
- Paths in graphs
