复杂网络中的局部拓扑与生成子图的产生
Local heuristics and the emergence of spanning subgraphs in complex networks
摘要：
我们研究了使用本地算法来确定用于复杂网络中信息传播的生成子图。我们介绍了两种不同的算法，并分析了它们在生成子图方面的行为，这些子图在允许网络的每个节点都能到达、需要相对较少的消息和小节点带宽进行信息传播以及相对于底层网络仅适度拉伸路径方面表现良好。我们贡献了一个详细的数学分析，并提供了广泛的随机图模拟结果，为他们两个。这些结果表明，在一定限度内，跨越子图确实有望出现表现良好的所有要求。我们还讨论了生成子图的内在故障恢复能力和拓扑变化的适应性。
英文摘要：
We study the use of local heuristics to determine spanning subgraphs for use in the dissemination of information in complex networks. We introduce two different heuristics and analyze their behavior in giving rise to spanning subgraphs that perform well in terms of allowing every node of the network to be reached, of requiring relatively few messages and small node bandwidth for information dissemination, and also of stretching paths with respect to the underlying network only modestly. We contribute a detailed mathematical analysis of one of the heuristics and provide extensive simulation results on random graphs for both of them. These results indicate that, within certain limits, spanning subgraphs are indeed expected to emerge that perform well in respect to all requirements. We also discuss the spanning subgraphs' inherent resilience to failures and adaptability to topological changes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
