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

计数图的布朗近似

Brownian approximation to counting graphs

Soumik Pal

摘要:

设C(n,k)表示具有n个标号顶点和n+k-1条边的连通图的个数.对于任意序列(k_n),当n趋于无穷大时,C(n,k_n)的极限是已知的.已经观察到,如果k_n=o(\sqrt{n}),这个极限渐近等于标准布朗偏移下面积的$k_n$阶矩。这些时刻已计算在文献中通过独立的方法。在这篇文章中,我们将从Joel Spencer的观察出发,说明为什么k_n=o(\sqrt [3]{n})是这样的。基本的论点使用的结果强嵌入的均匀经验过程的布朗桥证明的Komlos,主要,和Tusnady。

英文摘要:

Let C(n,k) denote the number of connected graphs with n labeled vertices and n+k-1 edges. For any sequence (k_n), the limit of C(n,k_n) as n tends to infinity is known. It has been observed that, if k_n=o(\sqrt{n}), this limit is asymptotically equal to the $k_n$th moment of the area under the standard Brownian excursion. These moments have been computed in the literature via independent methods. In this article we show why this is true for k_n=o(\sqrt[3]{n}) starting from an observation made by Joel Spencer. The elementary argument uses a result about strong embedding of the Uniform empirical process in the Brownian bridge proved by Komlos, Major, and Tusnady.

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

↑