基于Lévy随机游动的复杂网络远程导航
Long-Range Navigation on Complex Networks using Lévy Random Walks
摘要：
我们引入了一种无向网络中的导航策略，包括规则，随机和复杂网络，该策略受到Lévy随机游走的启发，推广了以前的导航规则。我们得到了稳态概率分布、占用概率、平均首次通过时间和到达网络节点的平均时间的精确表达式。我们发现，使用Lévy随机游走策略的远程导航，与正常的随机游走策略相比，更有效地减少了覆盖网络的时间。使用Lévy walk策略的动态效果是将大世界网络转换为小世界。我们的确切结果提供了一个通用框架，连接两个重要领域：Lévy导航策略和复杂网络上的动力学。
英文摘要：
We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by Lévy random walks, generalizing previous navigation rules. We obtained exact expressions for the stationary probability distribution, the occupation probability, the mean first passage time, and the average time to reach a node on the network. We found that the long-range navigation using the Lévy random walk strategy, compared with the normal random walk strategy, is more efficient at reducing the time to cover the network. The dynamical effect of using the Lévy walk strategy is to transform a large-world network into a small world. Our exact results provide a general framework that connects two important fields: Lévy navigation strategies and dynamics on complex networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
