Regularity method and large deviation principles for the Erd\H{o}s--R\'enyi hypergraph
From MaRDI portal
Publication:6360913
Abstract: We develop a quantitative large deviations theory for random hypergraphs, which rests on tensor decomposition and counting lemmas under a novel family of cut-type norms. As our main application, we obtain sharp asymptotics for joint upper and lower tails of homomorphism counts in the -uniform ErdH{o}s--R'enyi hypergraph for any fixed , generalizing and improving on previous results for the ErdH{o}s--R'enyi graph (). The theory is sufficiently quantitative to allow the density of the hypergraph to vanish at a polynomial rate, and additionally yields tail asymptotics for other nonlinear functionals, such as induced homomorphism counts.
Recommendations
- Large deviations of subgraph counts for sparse Erdős-Rényi graphs
- On the upper tail problem for random hypergraphs
- The large deviation principle for the Erdős-Rényi random graph
- Upper Tail Large Deviations of Regular Subgraph Counts in Erdős‐Rényi Graphs in the Full Localized Regime
- Upper tail for homomorphism counts in constrained sparse random graphs
Cited in
(4)
This page was built for publication: Regularity method and large deviation principles for the Erd\H{o}s--R\'enyi hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6360913)