arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.08865math.CO
收藏

随机图的重对数律

Law of Iterated Logarithm for random graphs

Asaf Ferber, Daniel Montealegre, Van Vu

摘要:

概率论中的一个里程碑是重对数律(LIL),由Khinchin和Kolmogorov在20世纪20年代独立证明,它断言,对于iid随机变量$\{t_i\}_{i=1}^{\infty}$,平均值$0$和方差$1$ $$ \Pr \left[ \limsup_{n\rightarrow \infty} \frac{ \sum_{i=1}^n t_i }{σ_n \sqrt {2 \log \log n }} =1 \right] =1 . $$在本文中,我们证明了LIL适用于随机图和超图模型的各种泛函。首先证明了固定子图$H$的拷贝数为LIL。关于全局对象的个数,有两个较难的结果:完美匹配和哈密顿圈。这些结果中的主要新成分是一个大的偏差范围,这可能是独立的利益。对于随机$k$ -一致超图,得到了关于Hamilton圈个数的中心极限定理和LIL.

英文摘要:

A milestone in Probability Theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables $\{t_i\}_{i=1}^{\infty}$ with mean $0$ and variance $1$ $$ \Pr \left[ \limsup_{n\rightarrow \infty} \frac{ \sum_{i=1}^n t_i }{σ_n \sqrt {2 \log \log n }} =1 \right] =1 . $$ In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph $H$. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random $k$-uniform hypergraphs, we obtain the Central Limit Theorem (CLT) and LIL for the number of Hamilton cycles.

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

↑