On the upper tail problem for random hypergraphs

DOI10.1002/rsa.20975zbMath1522.05435arXiv1910.02916OpenAlexW3106274947MaRDI QIDQ6073628

No author found.

Publication date: 11 October 2023

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

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

zbMATH Keywords

random graphslarge deviationsrandom hypergraphsupper tails

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial probability (60C05)

Related Items

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

Cites Work

• The large deviation principle for the Erdős-Rényi random graph
• A generalization of Hölder's inequality and some probability inequalities
• Best constants in Young's inequality, its converse, and its generalization to more than three functions
• 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
• Upper tails and independence polynomials in random graphs
• Nonlinear large deviations
• The missing log in large deviations for triangle counts
• Upper tails for triangles
• On replica symmetry of large deviations in random graphs
• The infamous upper tail
• Upper Tail Large Deviations for Arithmetic Progressions in a Random Set
• On the Lower Tail Variational Problem for Random Graphs
• On the variational problem for upper tails in sparse random graphs
• Gaussian Width Bounds with Applications to Arithmetic Progressions in Random Settings