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

二维临界渗流中大团簇尺寸间隙的研究

The gaps between the sizes of large clusters in 2D critical percolation

Jacob van den Berg, Rene Conijn

摘要:

考虑正方形格子上一个2n × 2n的大盒子上的临界键渗流。众所周知,最大的开簇的大小(即顶点数)很有可能是n^2 π(n)阶,其中π(n)表示从盒子的中心到边界有一条开路径的概率。同样的结果也适用于第二大集群、第三大集群等。Jarai表明,这些集群的大小之间的差异,以高概率,至少是\sqrt{n^2 π(n)}的顺序。虽然这个界限对于他的应用(对于初始的无限团簇)来说已经足够了,但他相信,但没有证据,差异实际上与团簇大小本身是同一数量级的,即n^2 π(n)。我们的主要结果证明了这一点。

英文摘要:

Consider critical bond percolation on a large 2n by 2n box on the square lattice. It is well-known that the size (i.e. number of vertices) of the largest open cluster is, with high probability, of order n^2 π(n), where π(n) denotes the probability that there is an open path from the center to the boundary of the box. The same result holds for the second-largest cluster, the third largest cluster etcetera. Jarai showed that the differences between the sizes of these clusters is, with high probability, at least of order \sqrt{n^2 π(n)}. Although this bound was enough for his applications (to incipient infinite clusters), he believed, but had no proof, that the differences are in fact of the same order as the cluster sizes themselves, i.e. n^2 π(n). Our main result is a proof that this is indeed the case.

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

↑