arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1309.3797physics.soc-phcs.SI
收藏

网络骨架和显著特征的鲁棒性

Robustness of skeletons and salient features in networks

Louis M. Shekhtman, James P. Bagrow, Dirk Brockmann

摘要:

真实世界的网络数据集通常包含丰富的复杂拓扑信息。面对这些数据,研究人员经常采用一些方法来提取包含最重要结构或途径的简化网络,有时称为“骨架”或“骨干”。已经开发了许多这样的方法。然而,数据往往是嘈杂或不完整的,有未知数量的缺失或虚假链接。相对而言,很少有人去理解显着网络提取方法在面对噪声或不完整网络时的表现。我们研究这个问题,通过比较两种流行的方法提取的显着特征的变化时,网络受到扰动,无论是删除节点或链接,或随机重新布线的链接。我们的研究结果表明,即使对于嘈杂和不完整的网络数据,也可以准确地推断出骨架的简单全局统计数据,但使用骨架或主干的确切拓扑结构必须具有完整可靠的数据。这些结果还有助于我们理解骨架如何对网络本身的损坏做出反应,就像在攻击场景中一样。

英文摘要:

Real world network datasets often contain a wealth of complex topological information. In the face of these data, researchers often employ methods to extract reduced networks containing the most important structures or pathways, sometimes known as `skeletons' or `backbones'. Numerous such methods have been developed. Yet data are often noisy or incomplete, with unknown numbers of missing or spurious links. Relatively little effort has gone into understanding how salient network extraction methods perform in the face of noisy or incomplete networks. We study this problem by comparing how the salient features extracted by two popular methods change when networks are perturbed, either by deleting nodes or links, or by randomly rewiring links. Our results indicate that simple, global statistics for skeletons can be accurately inferred even for noisy and incomplete network data, but it is crucial to have complete, reliable data to use the exact topologies of skeletons or backbones. These results also help us understand how skeletons respond to damage to the network itself, as in an attack scenario.

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

↑