arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0711.3263physics.soc-phcond-mat.stat-mech
收藏

复杂adhoc网络模型中的优先生存

Preferential survival in models of complex ad hoc networks

Joseph S. Kong, Vwani P. Roychowdhury

摘要:

近年来,(i)对现实世界动态网络的实证研究,(ii)对驱动此类网络出现的微观机制的分析建模,以及(iii)利用这些机制来操纵现有网络或设计新网络以完成特定任务之间存在着丰富的相互作用。我们继续在这方面,并研究删除现象,在网络上的以下两个不同的网站(每一个包括超过150,000页)超过一年的时间。实验数据表明,底层网络中存在显著的删除成分,但删除过程并不均匀。这促使我们引入一种新的优先生存机制(PS),其中节点根据度依赖删除核被删除。我们使用平均场速率方程方法来研究由优先连接(PA),双PA(DPA)和可调PS驱动的一般动态模型,其中每个节点添加到网络中,删除c个节点(c<1),并通过大规模模拟验证我们的预测。我们的一个结果表明,与均匀删除的情况不同,PS内核与标准PA机制相结合时,即使在网络中存在极端营业额的情况下,也可以导致重尾幂律网络。此外,弱DPA机制与PS相结合,可以帮助使网络变得更加重尾,特别是在删除率和插入率几乎相等的情况下,并且整体网络增长最小。在这项工作中报告的动态可用于设计和工程师稳定的ad hoc网络,并解释在现实世界中观察到的幂律指数的稳定性。

英文摘要:

There has been a rich interplay in recent years between (i) empirical investigations of real world dynamic networks, (ii) analytical modeling of the microscopic mechanisms that drive the emergence of such networks, and (iii) harnessing of these mechanisms to either manipulate existing networks, or engineer new networks for specific tasks. We continue in this vein, and study the deletion phenomenon in the web by following two different sets of web-sites (each comprising more than 150,000 pages) over a one-year period. Empirical data show that there is a significant deletion component in the underlying web networks, but the deletion process is not uniform. This motivates us to introduce a new mechanism of preferential survival (PS), where nodes are removed according to a degree-dependent deletion kernel. We use the mean-field rate equation approach to study a general dynamic model driven by Preferential Attachment (PA), Double PA (DPA), and a tunable PS, where c nodes (c<1) are deleted per node added to the network, and verify our predictions via large-scale simulations. One of our results shows that, unlike in the case of uniform deletion, the PS kernel when coupled with the standard PA mechanism, can lead to heavy-tailed power law networks even in the presence of extreme turnover in the network. Moreover, a weak DPA mechanism, coupled with PS, can help make the network even more heavy-tailed, especially in the limit when deletion and insertion rates are almost equal, and the overall network growth is minimal. The dynamics reported in this work can be used to design and engineer stable ad hoc networks and explain the stability of the power law exponents observed in real-world networks.

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

↑