Long-range navigation on complex networks using Levy random walks

We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by Levy 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 Levy 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 Levy 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: Levy navigation strategies and dynamics on complex networks.