arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.10420cs.SIphysics.soc-ph
收藏

通过局部信息发现网络中的重要边缘

Finding important edges in networks through local information

En-Yu Yu, Yan Fu, Jun-Lin Zhou, Duan-Bing Chen

摘要:

在交通、通信、社交及其他实际复杂网络中,一些关键边在控制信息流动和保持结构完整性方面起着关键作用。由于临界边在理论研究和实际应用中的重要性,临界边的识别逐渐成为当前研究的热点。考虑到边邻域内社区的重叠性,提出了一种新的有效的度量方法--子图重叠度(SO),用于量化边的重要性。实验结果表明,SO在识别关键边方面优于所有基准,关键边对保持网络结构和功能的完整性至关重要。

英文摘要:

In transportation, communication, social and other real complex networks, some critical edges act a pivotal part in controlling the flow of information and maintaining the integrity of the structure. Due to the importance of critical edges in theoretical studies and practical applications, the identification of critical edges gradually become a hot topic in current researches. Considering the overlap of communities in the neighborhood of edges, a novel and effective metric named subgraph overlap (SO) is proposed to quantifying the significance of edges. The experimental results show that SO outperforms all benchmarks in identifying critical edges which are crucial in maintaining the integrity of the structure and functions of networks.

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

↑