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

重构有向网络以实现更好的同步

Reconstructing directed networks for better synchronization

An Zeng, Linyuan Lü, Tao Zhou

摘要:

本文研究了在有向网络中通过操纵固定数目的链接来增强同步的策略。我们提出了一种基于中心性的重构(CBR)方法,其中节点的中心性是由著名的PageRank算法测量。大量的数值模拟结果表明,CBR方法是更有效地促进同步比度为基础的重建方法和随机重建方法添加或删除链接。这是因为CBR方法可以有效地缩小网络的度分布,增强网络的层次结构。此外,我们将CBR方法应用于链路重布线过程中,在每一步中删除一个链路,并添加一个新的链路。CBR方法有助于决定应删除或添加哪些链接。经过几个步骤后,得到的网络非常接近进化优化算法的最优结构。在Kuramoto模型上的数值仿真进一步证明了该方法在缩短有向网络同步收敛时间方面的优势。

英文摘要:

In this paper, we studied the strategies to enhance synchronization on directed networks by manipulating a fixed number of links. We proposed a centrality-based reconstructing (CBR) method, where the node centrality is measured by the well-known PageRank algorithm. Extensive numerical simulation on many modeled networks demonstrated that the CBR method is more effective in facilitating synchronization than the degree-based reconstructing method and random reconstructing method for adding or removing links. The reason is that CBR method can effectively narrow the incoming degree distribution and reinforce the hierarchical structure of the network. Furthermore, we apply the CBR method to links rewiring procedure where at each step one link is removed and one new link is added. The CBR method helps to decide which links should be removed or added. After several steps, the resulted networks are very close to the optimal structure from the evolutionary optimization algorithm. The numerical simulations on the Kuramoto model further demonstrate that our method has advantage in shortening the convergence time to synchronization on directed networks.

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

↑