arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.1789cond-mat.stat-mechcs.SIphysics.soc-ph
收藏

复杂网络上的极端事件

Extreme events on complex networks

Vimal Kishore, M. S. Santhanam, R. E. Amritkar

摘要:

我们研究复杂网络上发生的极端事件。网络上的运输建模使用随机游走,我们计算的概率发生和复发的极端事件的网络。我们表明,链接数量较少的节点比链接数量较多的节点更容易发生极端事件。我们得到的分析估计,并验证它们与数值模拟。即使随机行走者遵循网络上的最短路径,它们也被证明是鲁棒的。结果表明,设计原则的修订,并可以作为输入设计的网络节点,以便顺利地处理极端事件。

英文摘要:

We study the extreme events taking place on complex networks. The transport on networks is modelled using random walks and we compute the probability for the occurance and recurrence of extreme events on the network. We show that the nodes with smaller number of links are more prone to extreme events than the ones with larger number of links. We obtain analytical estimates and verify them with numerical simulations. They are shown to be robust even when random walkers follow shortest path on the network. The results suggest a revision of design principles and can be used as an input for designing the nodes of a network so as to smoothly handle an extreme event.

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

↑