arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.07488math.CO
收藏

圈的上尾界

Upper tail bounds for cycles

Abigail Raz

摘要:

本文研究了$G_{n,p}$中循环计数的上尾上界。对于固定图$H$,定义$ξ_H= ξ_H^{n,p}$为$G_{n,p}$中$H$的拷贝数。了解$ξ_H$分布的上尾是一个非常困难的问题,例如,估计\begin{equation*} \mathbb{P}(ξ_H > 2 \mathbb{E}ξ_H). \end{equation*}。对于一般的$H$和$p$,最著名的结果是由Janson,Oleszkiewicz和Rucibrski,他们在2004年证明了\begin{align}\label{a:JOR} \exp[-O_{H, η}(M_H(n,p) \ln(1/p))]&<\mathbb{P}(ξ_H > (1+η)\mathbb{E} ξ_H)\\&<\exp[-Ω_{H, η}(M_{H}(n,p))].\nonumber \end{align},因此他们确定了上尾的指数因子为$\ln(1/p)$。从那时起,已经进行了大量的工作来改进特定$H$和$p$的这些界限。我们关闭循环的$\ln(1/p)$间隙,直到指数为常数。这里JOR给出的下限是当$l$.

英文摘要:

This paper examines bounds on upper tails for cycle counts in $G_{n,p}$. For a fixed graph $H$ define $ξ_H= ξ_H^{n,p}$ to be the number of copies of $H$ in $G_{n,p}$. It is a much studied and surprisingly difficult problem to understand the upper tail of the distribution of $ξ_H$, for example, to estimate \begin{equation*} \mathbb{P}(ξ_H > 2 \mathbb{E}ξ_H). \end{equation*} The best known result for general $H$ and $p$ is due to Janson, Oleszkiewicz, and Ruciński, who, in 2004, proved \begin{align}\label{a:JOR} \exp[-O_{H, η}(M_H(n,p) \ln(1/p))]&<\mathbb{P}(ξ_H > (1+η)\mathbb{E} ξ_H)\\&<\exp[-Ω_{H, η}(M_{H}(n,p))].\nonumber \end{align} Thus they determined the upper tail up to a factor of $\ln(1/p)$ in the exponent. There has since been substantial work to improve these bounds for particular $H$ and $p$. We close the $\ln(1/p)$ gap for cycles, up to a constant in the exponent. Here the lower bound given by JOR is the truth for $l$-cycles when $p> \frac{\ln^{1/(l-2)}n}{n}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑