Typical large graphs with given edge and triangle densities
From MaRDI portal
Publication:6158597
DOI10.1007/s00440-023-01187-8zbMath1517.05086arXiv2110.14052OpenAlexW3211074758MaRDI QIDQ6158597
Lorenzo Sadun, Joe Neeman, Charles Radin
Publication date: 20 June 2023
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.14052
Extremal problems in graph theory (05C35) Random matrices (probabilistic aspects) (60B20) Combinatorial probability (60C05) Large deviations (60F10) Density (toughness, etc.) (05C42)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The large deviation principle for the Erdős-Rényi random graph
- Entropy, large deviations, and statistical mechanics.
- Limits of dense graph sequences
- Szemerédi's lemma for the analyst
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations
- Upper tails via high moments and entropic stability
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs
- Finitely forcible graphons
- Singularities in the entropy of asymptotically large simple graphs
- Moments of two-variable functions and the uniqueness of graph limits
- 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
- Phase transitions in a complex network
- On the Minimal Density of Triangles in Graphs
- The phases of large networks with edge and triangle constraints
- Bipodal Structure in Oversaturated Random Graphs
- Asymptotic Structure of Graphs with the Minimum Number of Triangles
