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

随机正则图上的简单环与非简单环

Simple vs non-simple loops on random regular graphs

Benjamin Dozier, Jenya Sapir

摘要:

本文解决了随机正则图上环的“生日问题”。也就是说,对于固定的$d\ge 3$,我们证明了在一个随机的$d$ -正则图与$n$顶点,$n$接近无穷大,以高概率:(i)几乎所有的本原非回溯回路的长度$k \prec \sqrt{n}$是简单的,即不自相交,(ii)几乎所有的本原非回溯回路的长度$k \succ \sqrt{n}$自相交。

英文摘要:

In this note we solve the ``birthday problem'' for loops on random regular graphs. Namely, for fixed $d\ge 3$, we prove that on a random $d$-regular graph with $n$ vertices, as $n$ approaches infinity, with high probability: (i) almost all primitive non-backtracking loops of length $k \prec \sqrt{n}$ are simple, i.e. do not self-intersect, (ii) almost all primitive non-backtracking loops of length $k \succ \sqrt{n}$ self-intersect.

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

↑