Moderate deviations in cycle count

DOI10.1002/rsa.21147zbMath1522.05439arXiv2101.08249OpenAlexW4366087196MaRDI QIDQ6076734

Charles Radin, Lorenzo Sadun, Joe Neeman

Publication date: 17 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.08249

zbMATH Keywords

random graphslarge deviationsmoderate deviationssubgraph densitysubgraph count

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42)

Related Items (1)

Existence of a symmetric bipodal phase in the edge-triangle model

Cites Work

• Large deviations principle for the largest eigenvalue of Wigner matrices without Gaussian tails
• The large deviation principle for the Erdős-Rényi random graph
• Large deviations for the largest eigenvalue of Rademacher matrices
• Large deviations techniques and applications.
• Concentration inequalities using the entropy method
• Concentration of the spectral measure for large matrices
• A symmetry breaking transition in the edge/triangle network model
• A large deviation principle for the Erdős-Rényi uniform random graph
• Large deviations of subgraph counts for sparse Erdős-Rényi graphs
• Phase transitions in finite random networks
• Singularities in the entropy of asymptotically large simple graphs
• Upper tails and independence polynomials in random graphs
• Multipodal structure and phase transitions in large constrained graphs
• Nonlinear large deviations
• Large deviations for the largest eigenvalue of sub-Gaussian matrices
• The lower tail: Poisson approximation revisited
• An introduction to large deviations for random graphs
• Phase transitions in a complex network
• The missing log in large deviations for triangle counts
• Vertex Order in Some Large Constrained Random Graphs
• On replica symmetry of large deviations in random graphs
• Moderate deviations of subgraph counts in the Erdős-Rényi random graphs 𝐺(𝑛,𝑚) and 𝐺(𝑛,𝑝)
• Poisson approximation for large deviations
• A Note on von Neumann's Trace Inequalitv
• Orthogonal decompositions and functional limit theorems for random graph statistics
• The infamous upper tail
• The phases of large networks with edge and triangle constraints
• Bipodal Structure in Oversaturated Random Graphs
• Upper Tails for Edge Eigenvalues of Random Graphs
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• On the Lower Tail Variational Problem for Random Graphs
• The asymptotics of large constrained graphs
• On the variational problem for upper tails in sparse random graphs

This page was built for publication: Moderate deviations in cycle count