给定度序列的图上的三角形过程
Triangle processes on graphs with given degree sequence
AI总结:
针对真实网络三角形多的特点,提出带三角形权重的改进型Metropolis开关链及三角形开关链,证明其在一定条件下快速混合,且截止值在多项式步数内对链行为影响不大。
摘要:
开关链(switch chain)是一种被广泛研究的马尔可夫链,用于生成具有给定度序列的随机图,且具有均匀平稳分布。受部分真实世界网络中存在大量三角形这一现象的启发,我们研究了开关链的一种变体,该变体更有可能生成三角形数量更多的图。具体而言,我们采用了一种Metropolis方案,该方案设计为具有如下平稳分布:图$G$的概率与$\lambda^{\min\{t(G),\nu\}}$成正比,其中$t(G)$是$G$中的三角形数量,$\nu$是为缓和三角形数量极多的图的影响而引入的截止值。我们假设“活性”$\lambda$满足$\lambda\geq 1$,并将得到的链称为改进型Metropolis开关链(modified Metropolis switch chain)。我们证明,只要活性和最大度不太大,当(标准)开关链快速混合时,改进型Metropolis开关链也会快速混合。\n三角形开关(triangle switch,或称“$\triangle$-switch”)链是开关链的一种受限形式,仅执行会改变图中三角形集合的开关操作。我们证明,对于最小度至少为3的任意度序列,$\triangle$-switch链都是不可约的,并证明了改进型Metropolis $\triangle$-switch链的快速混合结果。\n最后,我们研究了在均匀分布以及图$G$的概率与$\lambda^{t(G)}$成正比的分布下,具有给定度的随机图中的三角形分布。我们的分析表明,在多项式步数内,施加截止值$\nu$不会显著影响这些改进型Metropolis链的行为。
英文摘要:
The switch chain is a well-studied Markov chain which generates random graphs with a given degree sequence and has uniform stationary distribution. Motivated by the high number of triangles seen in some real-world networks, we study a variant of the switch chain which is more likely to produce graphs with higher numbers of triangles. Specifically, we apply a Metropolis scheme designed to have the following stationary distribution: graph $G$ has probability proportional to $λ^{\min\{t(G),ν\}}$, where $t(G)$ is the number of triangles in $G$ and $ν$ is a cut-off value introduced to moderate the impact of graphs with a very high number of triangles. We assume that the "activity" $λ$ satisfies $λ\geq 1$, and call the resulting chain the modified Metropolis switch chain. We prove that the modified Metropolis switch chain is rapidly mixing whenever the (standard) switch chain is rapidly mixing, provided that the activity and maximum degree are not too large. The triangle switch (or "$\triangle$-switch") chain is a restriction of the switch chain which only performs switches that change the set of triangles in the graph. We prove that the $\triangle$-switch chain is irreducible for any degree sequence with minimum degree at least 3, and prove a rapid mixing result for the modified Metropolis $\triangle$-switch chain. Finally, we investigate the distribution of triangles in random graphs with given degrees, under both the uniform distribution and the distribution in which graph $G$ has probability proportional to $λ^{t(G)}$. Our analysis implies that the imposition of the cut-off $ν$ does not significantly impact the behaviour of these modified Metropolis chains over polynomially many steps
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。