Random Walk with Memory on Complex Networks

Abstract

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs of nodes, for a random walk with a memory of one step. We have analyzed one particular model of random walk, where the transition probabilities depend on the number of paths to the second neighbors. The numerical experiments on paradigmatic complex networks verify the validity of the theoretical expressions, and also indicate that the flattening of the stationary occupation probability accompanies a nearly optimal random search.

References in corpus (8)

• Maps of random walks on complex networks reveal community structure
• Synchronization in complex networks
• Navigability of Complex Networks
• Quantifying patterns of research interest evolution
• A spectrum of routing strategies for brain networks
• Long-Range Navigation on Complex Networks using Lévy Random Walks
• Search in Complex Networks : a New Method of Naming
• Random Walks on Complex Networks

Cited by in corpus (2)

• Epidemic Spreading and Digital Contact Tracing: Effects of Heterogeneous Mixing and Quarantine Failures
• Comparative study of random walks with one-step memory on complex networks