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

几乎2-正则随机图

Almost-2-regular random graphs

Lorenzo Federico

摘要:

我们研究了配置模型的一种特殊情况,在这种情况下,图的几乎所有顶点都具有度$2$。我们表明,图有一个非常奇特和有趣的行为,特别是当图是由绝大多数的度$2$和消失的比例较高的度的顶点,巨大的组件包含$n(1-o(1))$顶点,但第二个组件仍然可以多项式增长$n$。另一方面,当除了具有度$1$的$o(n)$之外几乎所有顶点都具有度$2$时,不存在线性大小的分量。

英文摘要:

We study a special case of the configuration model, in which almost all the vertices of the graph have degree $2$. We show that the graph has a very peculiar and interesting behaviour, in particular when the graph is made up by a vast majority of vertices of degree $2$ and a vanishing proportion of vertices of higher degree, the giant component contains $n(1-o(1))$ vertices, but the second component can still grow polynomially in $n$. On the other hand, when almost all the vertices have degree $2$ except for $o(n)$ which have degree $1$, there is no component of linear size.

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

↑