On the upper tail problem for random hypergraphs

@article{Liu2021OnTU,
  title={On the upper tail problem for random hypergraphs},
  author={Ying Liu and Yufei Zhao},
  journal={Random Struct. Algorithms},
  year={2021},
  volume={58},
  pages={179-220}
}
  • Y. Liu, Yufei Zhao
  • Published 7 October 2019
  • Computer Science, Mathematics
  • Random Struct. Algorithms
The upper tail problem in a random graph asks to estimate the probability that the number of copies of some fixed subgraph in an Erd\H{o}s--R\'enyi random graph exceeds its expectation by some constant factor. There has been much exciting recent progress on this problem. We study the corresponding problem for hypergraphs, for which less is known about the large deviation rate. We present new phenomena in upper tail large deviations for sparse random hypergraphs that are not seen in random… Expand

Figures from this paper

A large deviation principle for block models
We initiate a study of large deviations for block model random graphs in the dense regime. Following Chatterjee-Varadhan(2011), we establish an LDP for dense block models, viewed as random graphons.Expand
Upper tail large deviations of the cycle counts in Erd\H{o}s-R\'{e}nyi graphs in the full localized regime
For a $\Delta$-regular graph ${\sf H}$ the problem of determining the upper tail large deviation for the number of copies of ${\sf H}$ in $\mathbb{G}(n,p)$, an Erd\H{o}s-R\'{e}nyi graph on $n$Expand
Upper tail large deviations of regular subgraph counts in Erd\H{o}s-R\'{e}nyi graphs in the full localized regime.
For a $\Delta$-regular connected graph ${\sf H}$ the problem of determining the upper tail large deviation for the number of copies of ${\sf H}$ in $\mathbb{G}(n,p)$, an Erd\H{o}s-R\'{e}nyi graph onExpand
Regularity method and large deviation principles for the Erd\H{o}s--R\'enyi hypergraph
We develop a quantitative large deviations theory for random Bernoulli tensors. The large deviation principles rest on a decomposition theorem for arbitrary tensors outside a set of tiny measure, inExpand

References

SHOWING 1-10 OF 24 REFERENCES
Upper tail for homomorphism counts in constrained sparse random graphs
Consider the upper tail probability that the homomorphism count of a fixed graph $H$ within a large sparse random graph $G_n$ exceeds its expected value by a fixed factor $1+\delta$. Going beyond theExpand
Upper tails and independence polynomials in random graphs
Abstract The upper tail problem in the Erdős–Renyi random graph G ∼ G n , p asks to estimate the probability that the number of copies of a graph H in G exceeds its expectation by a factor 1 + δ .Expand
Upper tails via high moments and entropic stability
Suppose that $X$ is a bounded-degree polynomial with nonnegative coefficients on the $p$-biased discrete hypercube. Our main result gives sharp estimates on the logarithmic upper tail probability ofExpand
On the Lower Tail Variational Problem for Random Graphs
  • Yufei Zhao
  • Mathematics, Computer Science
  • Combinatorics, Probability and Computing
  • 2016
TLDR
This paper studies the lower tail large deviation problem for subgraph counts in a random graph and provides a partial characterization of the so-called ‘replica symmetric’ phase of this variational problem. Expand
On the variational problem for upper tails in sparse random graphs
TLDR
A very recent breakthrough of Chatterjee and Dembo extended its validity to n-αi¾?piµ1 for an explicit α>0, and plausibly it holds in all of the above sparse regime. Expand
On replica symmetry of large deviations in random graphs
TLDR
The replica symmetry phase consists of all p,r such that rd,hpr lies on the convex minorant of xi¾?hpx1/d where hp is the rate function of a binomial with parameter p. Expand
The large deviation principle for the Erdős-Rényi random graph
TLDR
The formulation and proof of the main result uses the recent development of the theory of graph limits by Lovasz and coauthors and Szemeredi's regularity lemma from graph theory to establish a large deviation principle under an appropriate topology. Expand
The infamous upper tail
TLDR
Seven techniques of obtaining upper bounds on the upper tail probabilities of a (binomial) random subset Γp of Γ, where p = (pt : i ∈ Γ) and a random variable X counting the elements of S that are contained in this random subset, are described. Expand
Large deviations of subgraph counts for sparse Erd\H{o}s--R\'enyi graphs
For each fixed integer $\ell\ge 3$ and $u>0$ we establish the leading order of the exponential rate function for the probability that the number of cycles of length $\ell$ in the Erdős--Renyi graphExpand
The missing log in large deviations for triangle counts
  • S. Chatterjee
  • Mathematics, Computer Science
  • Random Struct. Algorithms
  • 2012
This paper solves the problem of sharp large deviation estimates for the upper tail of the number of triangles in an Erdős-Renyi random graph, by establishing a logarithmic factor in the exponentExpand
...
1
2
3
...