arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1308.4577physics.soc-phcs.SIphysics.comp-ph
收藏

网络可靠性:局部网络结构对扩散过程的影响

Network Reliability: The effect of local network structure on diffusive processes

Mina Youssef, Yasamin Khorramzadeh, Stephen Eubank

摘要:

本文重新引入了Moore和Shannon在1956年提出的网络可靠性多项式,用于研究网络结构对疾病传播的影响。我们展示了一个表示的多项式,是非常适合估计分布式仿真。我们描述了一组来自Erdens-Rényi和无标度随机图的图,在这些图中,我们操纵了度和三角形的数量。我们评估网络的可靠性,所有这些图的可靠性规则,是相关的预期大小的连接组件。通过这些广泛的模拟,我们表明,积极或中立的图,交换边,以增加三角形的数量并没有增加网络的可靠性。而且,正向图比具有相同边数的中性图或离散图更可靠。此外,我们显示的综合效果的度和存在的三角形的临界点和最小的子图的大小是可靠的。

英文摘要:

This paper re-introduces the network reliability polynomial - introduced by Moore and Shannon in 1956 -- for studying the effect of network structure on the spread of diseases. We exhibit a representation of the polynomial that is well-suited for estimation by distributed simulation. We describe a collection of graphs derived from Erdős-Rényi and scale-free-like random graphs in which we have manipulated assortativity-by-degree and the number of triangles. We evaluate the network reliability for all these graphs under a reliability rule that is related to the expected size of a connected component. Through these extensive simulations, we show that for positively or neutrally assortative graphs, swapping edges to increase the number of triangles does not increase the network reliability. Also, positively assortative graphs are more reliable than neutral or disassortative graphs with the same number of edges. Moreover, we show the combined effect of both assortativity-by-degree and the presence of triangles on the critical point and the size of the smallest subgraph that is reliable.

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

↑