Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015

DOI10.1007/978-3-319-65816-2MaRDI QIDQ2399894zbMATH OpenOpenAlexFDO

Authors Sourav Chatterjee

Publication date 24 August 2017

Published in Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-65816-2

zbMATH Keywords

random graphlarge deviationsrate functiongraph limitsparse graphexponential random graph modeltriangle count

Mathematics Subject Classification ID

Large deviations (60F10) Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Sums of independent random variables; random walks (60G50)

Recommendations

• An introduction to large deviations for random graphs
• The large deviation principle for the Erdős-Rényi random graph
• Nonlinear large deviations
• Some large deviation results for sparse random graphs
• Large deviations of subgraph counts for sparse Erdős-Rényi graphs

Cited in

(28)

• The number of triangles in random intersection graphs
• Large deviation for uniform graphs with given degrees
• Upper tails via high moments and entropic stability
• On replica symmetry of large deviations in random graphs
• The large deviation principle for inhomogeneous Erdős-Rényi random graphs
• Random obstacle problems. École d'Été de Probabilités de Saint-Flour XLV -- 2015
• Anti-concentration for subgraph counts in random graphs
• The role of topology in large deviations
• Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
• Random Simplicial Complexes: Models and Phenomena
• Large deviations of subgraph counts for sparse Erdős-Rényi graphs
• Typical structure of sparse exponential random graph models
• Ensemble equivalence for dense graphs
• A sample-path large deviation principle for dynamic Erdős-Rényi random graphs
• Large deviations of empirical neighborhood distribution in sparse random graphs
• Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs
• The structure of low-complexity Gibbs measures on product spaces
• Limit theorems for exponential random graphs
• Breaking of ensemble equivalence for dense random graphs under a single constraint
• The large deviation principle for interacting dynamical systems on random graphs
• An introduction to large deviations for random graphs
• Replica symmetry in upper tails of mean-field hypergraphs
• A numerical method for a nonlocal diffusion equation with additive noise
• The importance sampling technique for understanding rare events in Erdős-Rényi random graphs
• The large deviation principle for the Erdős-Rényi random graph
• Rare event asymptotics for exploration processes for random graphs
• Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph
• Stochastic processes in random graphs

This page was built for publication: Large deviations for random graphs. École d'Été de Probabilités de Saint-Flour XLV -- 2015

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399894)