Comparative study of random walks with one-step memory on complex networks

Abstract

We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph mean first passage times as an indicator for the searching efficiency. The experiments with generated and real networks show that biasing based on inverse degree, persistence and local two-hop paths can lead to smaller searching times. Moreover, these biasing approaches can be combined to achieve a more robust random search strategy. Our findings can be applied in the modeling and solution of various real-world problems.

12 pages, 4 figures, 1 table, conference

References in corpus (8)

• Finding community structure in networks using the eigenvectors of matrices
• Random walks on hypergraphs
• Robust network community detection using balanced propagation
• Global mean first-passage times of random walks on complex networks
• Biased random walks on complex networks: the role of local navigation rules
• Random walks on networks with stochastic resetting
• Characteristic times of biased random walks on complex networks
• Random Walk with Memory on Complex Networks