Mean encounter times for multiple random walkers on networks

Abstract

We introduce a general approach for the study of the collective dynamics of non-interacting random walkers on connected networks. We analyze the movement of $R$ independent (Markovian) walkers, each defined by its own transition matrix. By using the eigenvalues and eigenvectors of the $R$ independent transition matrices, we deduce analytical expressions for the collective stationary distribution and the average number of steps needed by the random walkers to start in a particular configuration and reach specific nodes the first time (mean first-passage times), as well as global times that characterize the global activity. We apply these results to the study of mean first-encounter times for local and non-local random walk strategies on different types of networks, with both synchronous and asynchronous motion.

arXiv comment15 pages, 8 figures

References in corpus (30)

• Emergence of scaling in random networks
• Epidemic spreading in scale-free networks
• Human Mobility: Models and Applications
• Random walks and diffusion on networks
• Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys
• Localization of maximal entropy random walk
• Biased random walks on complex networks: the role of local navigation rules
• Natural human mobility patterns and spatial spread of infectious diseases
• Google matrix analysis of directed networks
• Maximal-entropy random walks in complex networks with limited information
• Random walks on weighted networks
• Long-Range Navigation on Complex Networks using Lévy Random Walks
• Random walks on networks with stochastic resetting
• Extreme events on complex networks
• Fractional dynamics on networks: Emergence of anomalous diffusion and Lévy flights
• Flow graphs: interweaving dynamics and structure
• Efficient exploration of multiplex networks
• Mean first-passage time for random walks on undirected networks
• Extreme events and event size fluctuations in biased random walks on networks
• Epidemic spreading on modular networks: The fear to declare a pandemic
• Random Multi-Hopper Model. Super-Fast Random Walks on Graphs
• Encounter times in overlapping domains: application to epidemic spread in a population of territorial animals
• Slow Encounters of Particle Pairs in Branched Structures
• Random walks with long-range steps generated by functions of Laplacian matrices
• Onset of anomalous diffusion from local motion rules
• Exact encounter times for many random walkers on regular and complex networks
• Diffusion-annihilation proecesses in weighted scale-free networks with identical degree sequence
• Fractional dynamics on circulant multiplex networks: optimal coupling and long-range navigation for continuous-time random walks
• Random walks on weighted networks: Exploring local and non-local navigation strategies
• Random Walks on Complex Networks

Cited by in corpus (9)

• Diffusive transport on networks with stochastic resetting to multiple nodes
• A markovian random walk model of epidemic spreading
• A simple model of epidemic dynamics with memory effects
• Optimal exploration of random walks with local bias on networks
• Contact statistics in populations of noninteracting random walkers in two dimensions
• Mean first-encounter times of simultaneous random walkers with resetting on networks
• A measure of dissimilarity between diffusive processes on networks
• Tethering effects on first-passage variables of lattice random walks in linear and quadratic focal point potentials
• Smart Walkers in Discrete Space