An introduction to large deviations for random graphs
From MaRDI portal
Publication:2822847
DOI10.1090/bull/1539zbMath1356.60044arXiv1604.06828OpenAlexW2964322110MaRDI QIDQ2822847
Publication date: 5 October 2016
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.06828
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Combinatorial inequalities (05A20) Large deviations (60F10)
Related Items
Rare event asymptotics for exploration processes for random graphs, Nonlinear large deviations, Upper tails and independence polynomials in random graphs, Logarithmic Sobolev inequalities for finite spin systems and applications, Nonconventional moderate deviations theorems and exponential concentration inequalities, Localization in random geometric graphs with too many edges, A large-deviations principle for all the components in a sparse inhomogeneous random graph, A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph, Deviation probabilities for arithmetic progressions and other regular discrete structures, Moderate deviations in cycle count, The number of triangles in random intersection graphs, Parameter estimation in a 3‐parameter p‐star random graph model, Nonlinear large deviations: beyond the hypercube, Large deviations of subgraph counts for sparse Erdős-Rényi graphs, The large deviation principle for inhomogeneous Erdős-Rényi random graphs, Efficient, local and symmetric Markov chains that generate one-factorizations, Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝), Ensemble equivalence for dense graphs, A large deviation approach to super-critical bootstrap percolation on the random graph \(G_{n, p}\), Recovering nonuniform planted partitions via iterated projection, Bivariate fluctuations for the number of arithmetic progressions in random sets, Approximating stationary distributions of fast mixing Glauber dynamics, with applications to exponential random graphs, Asymptotic Structure for the Clique Density Theorem, Modified log-Sobolev inequalities, Beckner inequalities and moment estimates, The large deviation principle for interacting dynamical systems on random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Consistency under sampling of exponential random graph models
- Phase transitions in exponential random graphs
- Nonconventional averages along arithmetic progressions and lattice spin systems
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Asymptotic structure and singularities in constrained directed graphs
- Applications of Stein's method for concentration inequalities
- The large deviation principle for the Erdős-Rényi random graph
- Mixing time of exponential random graphs
- Limits of dense graph sequences
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Large deviations techniques and applications.
- Quick approximation to matrices and applications
- Representations for partially exchangeable arrays of random variables
- Estimation of moments of sums of independent real random variables
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Upper tails for subgraph counts in random graphs
- Concentration of measure and isoperimetric inequalities in product spaces
- Singularities in the entropy of asymptotically large simple graphs
- Stein's method for concentration inequalities
- Upper tails and independence polynomials in random graphs
- Multipodal structure and phase transitions in large constrained graphs
- Estimating and understanding exponential random graph models
- Critical phenomena in exponential random graphs
- Nonconventional large deviations theorems
- Nonconventional limit theorems in discrete and continuous time via martingales
- Phase transitions in a complex network
- Emergent Structures in Large Networks
- The missing log in large deviations for triangle counts
- Upper tails for triangles
- Tight upper tail bounds for cliques
- On replica symmetry of large deviations in random graphs
- Graph limits and exchangeable random graphs
- Metrics for sparse graphs
- Divide and conquer martingales and the number of triangles in a random graph
- Concentration of non‐Lipschitz functions and applications
- On the asymptotics of constrained exponential random graphs
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- On the Lower Tail Variational Problem for Random Graphs
- The asymptotics of large constrained graphs
- Probabilistic Symmetries and Invariance Principles
- Concentration of multivariate polynomials and its applications
- Nonconventional limit theorems
