Typical structure of sparse exponential random graph models
From MaRDI portal
Publication:6591588
DOI10.1214/23-aap2025zbMath1545.60033MaRDI QIDQ6591588
Publication date: 22 August 2024
Published in: The Annals of Applied Probability (Search for Journal in Brave)
large deviationsvariational problemsGibbs measuresErdős-Rényi graphsupper tailsBrascamp-Lieb inequalityhomomorphism counts
Graph polynomials (05C31) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Large deviations (60F10) Phase transitions (general) in equilibrium statistical mechanics (82B26) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotic quantization of exponential random graphs
- The large deviation principle for the Erdős-Rényi random graph
- Mixing time of exponential random graphs
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Networks beyond pairwise interactions: structure and dynamics
- A generalization of Hölder's inequality and some probability inequalities
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Exponential random graphs behave like mixtures of stochastic block models
- Decomposition of mean-field Gibbs distributions into product measures
- Upper tails via high moments and entropic stability
- Replica symmetry in upper tails of mean-field hypergraphs
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Phase transitions in finite random networks
- Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs
- Near equality in the Riesz-Sobolev inequality
- Asymptotics for sparse exponential random graph models
- Quantitative stability for the Brunn-Minkowski inequality
- 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
- Nonlinear large deviations
- Geometric stability via information theory
- Phase transitions in a complex network
- On replica symmetry of large deviations in random graphs
- $\beta$ models for random hypergraphs with a given degree sequence
- Markov Graphs
- On a General Class of Models for Interaction
- An Exponential Family of Probability Distributions for Directed Graphs
- An inequality for integrals
- On the asymptotics of constrained exponential random graphs
- The asymptotics of large constrained graphs
- On the variational problem for upper tails in sparse random graphs
- On the upper tail problem for random hypergraphs
- Upper tail for homomorphism counts in constrained sparse random graphs
- Lower tails via relative entropy
- The upper tail problem for induced 4‐cycles in sparse random graphs
- Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime
- Sub-critical exponential random graphs: concentration of measure and some applications
This page was built for publication: Typical structure of sparse exponential random graph models