arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.04643cs.SIphysics.soc-ph
收藏

随机图中基于阈值的广义流行病:极值的幂

Generalized threshold-based epidemics in random graphs: the power of extreme values

Michele Garetto, Emilio Leonardi, Giovanni Luca Torrisi

摘要:

自举渗流是图中的一个众所周知的激活过程,其中当节点具有至少$r$活动邻居时,节点变为活动的。这种过程最初是在规则结构上研究的,最近也在随机图的背景下进行了研究,在随机图中,它可以作为各种级联的简单模型,例如在大型社交网络上传播思想,趋势,病毒内容等。特别地,已经表明,在$G(n,p)$中,最终活动集可以表现出对于子线性数量的种子的相变。在本文中,我们提出了一个独特的框架来研究更广泛的一类图模型和流行病过程的类似的次线性相变。具体来说,我们考虑i)一个广义版本的自举渗流在$G(n,p)$随机激活阈值和随机节点到节点的影响; ii)不同的随机图模型,包括图与给定的度序列和图的社区结构(块模型)。我们工作的共同点是显示临界种子集大小对分布极值的惊人敏感性,这使得一些系统非常容易受到大规模爆发的影响。我们验证我们的结果运行模拟合成和真实的图形。

英文摘要:

Bootstrap percolation is a well-known activation process in a graph, in which a node becomes active when it has at least $r$ active neighbors. Such process, originally studied on regular structures, has been recently investigated also in the context of random graphs, where it can serve as a simple model for a wide variety of cascades, such as the spreading of ideas, trends, viral contents, etc. over large social networks. In particular, it has been shown that in $G(n,p)$ the final active set can exhibit a phase transition for a sub-linear number of seeds. In this paper, we propose a unique framework to study similar sub-linear phase transitions for a much broader class of graph models and epidemic processes. Specifically, we consider i) a generalized version of bootstrap percolation in $G(n,p)$ with random activation thresholds and random node-to-node influences; ii) different random graph models, including graphs with given degree sequence and graphs with community structure (block model). The common thread of our work is to show the surprising sensitivity of the critical seed set size to extreme values of distributions, which makes some systems dramatically vulnerable to large-scale outbreaks. We validate our results running simulation on both synthetic and real graphs.

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

↑