arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.10506math.COphysics.soc-ph
收藏

度-度相关网络是边着色随机图的一种特殊情况

Networks with degree-degree correlations is a special case of edge-coloured random graphs

Samuel, G. Balogh, Gergely Palla, Ivan Kryven

摘要:

在复杂网络中,相邻节点的度可能经常表现为依赖性-这提出了建模挑战。我们提出了一个工作框架,研究网络与任意联合分布的程度相邻节点,表明这种网络是一个特殊的情况下,边着色随机图。我们使用这个映射来研究网络中的键渗流与非线性混合,并表明,与网络中的独立度,连接组件的大小可能具有意想不到的敏感度分布的扰动。研究结果还表明,度-度依赖可能具有消失的渗流阈值,即使当度分布的二阶矩是有限的。这些结果可用于设计有效地抵抗链路故障的人工网络,并表明在没有明显区别的枢纽的网络中存在超级传播的可能性

英文摘要:

In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent nodes by showing that such networks are a special case of edge-coloured random graphs. We use this mapping to study bond percolation in networks with assortative mixing and show that, unlike in networks with independent degrees, the sizes of connected components may feature unexpected sensitivity to perturbations in the degree distribution. The results also indicate that degree-degree dependencies may feature a vanishing percolation threshold even when the second moment of the degree distribution is finite. These results may be used to design artificial networks that efficiently withstand link failures and indicate possibility of super spreading in networks without clearly distinct hubs

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

↑