嵌套分裂图逼近实复杂网络指数的快速算法
Fast Algorithms for Indices of Nested Split Graphs Approximating Real Complex Networks
摘要:
我们提出了一种基于模拟退火的方法,以获得一个嵌套的分裂图,近似一个真正的复杂的图。这是用来计算一些图索引使用非常有效的算法,我们开发,利用嵌套分裂图的几何特性。实际结果给出了六个图形从不同的领域,如社交网络,通信网络,字协会,和分子化学。我们提出了一个严格的分析适当的扰动计划,搜索整个空间的嵌套分裂图和距离函数,衡量两个图之间的差异。
英文摘要:
We present a method based on simulated annealing to obtain a nested split graph that approximates a real complex graph. This is used to compute a number of graph indices using very efficient algorithms that we develop, leveraging the geometrical properties of nested split graphs. Practical results are given for six graphs from such diverse areas as social networks, communication networks, word associations, and molecular chemistry. We present a critical analysis of the appropriate perturbation schemes that search the whole space of nested split graphs and the distance functions that gauge the dissimilarity between two graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。