title: Long-range navigation on complex networks using Lévy random walks.
abstract: 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.
authors.affiliation: Instituto de Física, Universidad Nacional Autónoma de México, Apartado Postal 20-364, 01000 México, D.F., México.
authors.forename: A P
authors.initials: AP
authors.lastname: Riascos
authors.forename: José L
authors.initials: JL
authors.lastname: Mateos
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D015233:Models, Statistical