Navigation by anomalous random walks on complex networks

  title={Navigation by anomalous random walks on complex networks},
  author={Tongfeng Weng and Jie Zhang and Moein Khajehnejad and Michael Small and Rui Zheng and Pan Hui},
  journal={Scientific Reports},
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching… 

Random walks on weighted networks: a survey of local and non-local dynamics

A survey of different types of random walk models with local and non-local transitions on undirected weighted networks by defining the dynamics as a discrete-time Markovian process with transition probabilities expressed in terms of a symmetric matrix of weights.

Random walks with long-range steps generated by functions of Laplacian matrices

In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix. We generalize

Efficiency of long-range navigation on Treelike fractals

Universal principles governing multiple random searchers on complex networks: The logarithmic growth pattern and the harmonic law.

The results reveal two fundamental principles governing the search time of multiple random searchers, which are expected to facilitate investigation of diverse dynamical processes like synchronization and spreading.

Mean First-Passage Time on Scale-Free Networks Based on Rectangle Operation

This paper studies the topological structures of the network obtained from the rectangle operation, including degree distribution, clustering coefficient, and diameter, and considers the characteristic quantities related to the network, including Kirchhoff index and mean first-passage time.

Predicting search time when hunting for multiple moving targets: A recursive harmonic law.

The recursive harmonic law unveils the underlying mechanism governing the search time when hunting for multiple moving targets on networks and is introduced to quantify the expected time a searcher takes to capture moving targets specified in advance.

Networks and long-range mobility in cities: A study of more than one billion taxi trips in New York City

Considering the taxi trips as a proxy of human mobility in cities, it might be possible that the long-range mobility found for New York City would be a general feature in other large cities around the world.

Long-range connections, real-world networks and rates of diffusion

The evidence for long range connections in real world networks is reviewed and the nature of the nonlocal diffusion arising from different distance-dependent laws is discussed.

Predator-prey games on complex networks



First passage time for random walks in heterogeneous networks.

It is found that random walks arrive quickly at a local hub, and therefore the FPT distribution shows a crossover with respect to time from fast decay behavior to slow decay behavior (caused by the exploring of the entire system), justifying the necessity of using a random jump protocol.

Long-Range Navigation on Complex Networks using Lévy Random Walks

  • A. P. RiascosJ. Mateos
  • Computer Science, Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2012
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

Fractional dynamics on networks: emergence of anomalous diffusion and Lévy flights.

The general fractional diffusion formalism applies to regular, random, and complex networks and can be implemented from the spectral properties of the Laplacian matrix, providing an important tool to analyze anomalous diffusion on networks.

Random walks and search in time-varying networks.

This work considers a model for time-varying networks created from the activity potential of the nodes and derives solutions of the asymptotic behavior of random walks and the mean first passage time in undirected and directed networks.

Lévy Walk Navigation in Complex Networks: A Distinct Relation between Optimal Transport Exponent and Network Dimension

We investigate, for the first time, navigation on networks with a Lévy walk strategy such that the step probability scales as pij ~ dij–α, where dij is the Manhattan distance between nodes i and j,

Random walks on complex networks.

The random walk centrality C is introduced, which is the ratio between its coordination number and a characteristic relaxation time, and it is shown that it determines essentially the mean first-passage time (MFPT) between two nodes.

Random walks in weighted networks with a perfect trap: an application of Laplacian spectra.

  • Yuan LinZhongzhi Zhang
  • Mathematics, Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2013
This paper proposes a general framework for the trapping problem on a weighted network with a perfect trap fixed at an arbitrary node, and deduces an explicit expression for average trapping time (ATT) in terms of the eigenvalues and eigenvectors of the Laplacian matrix associated with the weighted graph.

Mean first-passage time for maximal-entropy random walks in complex networks

An in-depth study of mean first-passage time of maximal-entropy random walks performed in complex networks, which shows that the MFPT to a hub node is much lower for MERW than for TURW, and provides insight into general searching process incomplex networks.

Evidence of Lévy walk foraging patterns in human hunter–gatherers

The results suggest that scale-invariant, superdiffusive movement profiles are a fundamental feature of human landscape use, regardless of the physical or cultural environment, and may have played an important role in the evolution of human mobility.

Optimal transport exponent in spatially embedded networks.

The results clearly indicate that cost constraint in the navigation problem provides a proper theoretical framework to justify the evolving topologies of real complex network structures, as recently demonstrated for the networks of the US airports and the human brain activity.