arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0805.4285cond-mat.stat-mechhep-lat
收藏

平面随机图对目标攻击的鲁棒性

Robustness of planar random graphs to targeted attacks

J. -P. Kownacki

摘要:

本文通过数值模拟研究了平面三价随机图对最高连通节点攻击的鲁棒性。结果表明,这些图是相对稳健的。目标攻击的非随机节点移除过程也被研究为非均匀站点渗透的特殊情况。临界指数的计算通过测量各种性质的分布的逾渗团。他们被发现是大致兼容的临界指数均匀渗流在这些图。

英文摘要:

In this paper, robustness of planar trivalent random graphs to targeted attacks of highest connected nodes is investigated using numerical simulations. It is shown that these graphs are relatively robust. The nonrandom node removal process of targeted attacks is also investigated as a special case of non-uniform site percolation. Critical exponents are calculated by measuring various properties of the distribution of percolation clusters. They are found to be roughly compatible with critical exponents of uniform percolation on these graphs.

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

↑