随机正则图的规范标记
Canonical labelling of random regular graphs
AI总结:
该研究证明在特定条件下,颜色细化算法能为随机正则图生成可计算的规范标记。
摘要:
我们证明当$d=d(n)\to\infty$且$n-d\to\infty$当$n\to\infty$时,对于任何非平凡的初始着色,颜色细化算法可以区分随机正则图$\mathcal{G}_{n,d}$的所有顶点。这特别意味着,$\mathcal{G}_{n,d}$几乎必然允许在时间$O(\min\{n^ω,nd^2+nd\log n\})$内计算的规范标记,其中$ω<2.372$是矩阵乘法指数。
英文摘要:
We prove that whenever $d=d(n)\to\infty$ and $n-d\to\infty$ as $n\to\infty$, then with high probability for any non-trivial initial colouring, the colour refinement algorithm distinguishes all vertices of the random regular graph $\mathcal{G}_{n,d}$. This, in particular, implies that with high probability $\mathcal{G}_{n,d}$ admits a canonical labelling computable in time $O(\min\{n^ω,nd^2+nd\log n\})$, where $ω<2.372$ is the matrix multiplication exponent.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。