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

随机图的沙堆群分布

The distribution of sandpile groups of random graphs

Melanie Matchett Wood

摘要:

我们确定了沙堆群的分布(又称沙堆群)。雅可比矩阵)。由于任何特定的群以渐近概率0出现(如我们所示),因此很自然地要求沙堆群的Sylow p-子群的渐近分布。本文证明了Sylow p-子群的分布收敛于Clancy,Leake和Payne给出的分布。这些分布与Cohen-Lenstra分布有关,但又不同。我们的证明首先要找到从沙堆群到任何有限阿贝尔群(有限阿贝尔群中取值的随机变量的“矩”)的满射的期望数。为了实现这一点,我们展示了一个普遍性的结果,随机对称积分矩阵的上核的时刻,是足够强大的处理依赖的对角条目。然后,我们表明,这些时刻确定一个独特的分布,尽管他们的p^{k^2}大小的增长。

英文摘要:

We determine the distribution of the sandpile group (a.k.a. Jacobian) of the Erdős-Rényi random graph G(n,q) as n goes to infinity. Since any particular group appears with asymptotic probability 0 (as we show), it is natural ask for the asymptotic distribution of Sylow p-subgroups of sandpile groups. We prove the distributions of Sylow p-subgroups converge to specific distributions conjectured by Clancy, Leake, and Payne. These distributions are related to, but different from, the Cohen-Lenstra distribution. Our proof involves first finding the expected number of surjections from the sandpile group to any finite abelian group (the "moments" of a random variable valued in finite abelian groups). To achieve this, we show a universality result for the moments of cokernels of random symmetric integral matrices that is strong enough to handle dependence in the diagonal entries. We then show these moments determine a unique distribution despite their p^{k^2}-size growth.

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

↑