Mean first-encounter times of simultaneous random walkers with resetting on networks

Abstract

We investigate the dynamics of simultaneous random walkers with resetting on networks and derive exact analytical expressions for the mean first-encounter times of Markovian random walkers. Specifically, we consider two cases for the simultaneous dynamics of two random walkers on networks: when only one walker resets to the initial node, and when both walkers return to their initial positions. In both cases, the encounter times are expressed in terms of the eigenvalues and eigenvectors of the transition matrix of the normal random walk, providing a spectral interpretation of the impact of resetting. We validate our approach through examples on rings, Cayley trees, and random networks generated using the Erdős-Rényi, Watts-Strogatz, and Barabási-Albert algorithms, where resetting significantly reduces encounter times. The proposed framework can be extended to other types of random walk dynamics, transport processes, or multiple-walker scenarios, with potential applications in human mobility, epidemic spreading, and search strategies in complex systems.

24 pages, 5 figures

References in corpus (19)

• First order transition for the optimal search time of Lévy flights with resetting
• Dynamical transition in the temporal relaxation of stochastic processes under resetting
• Stochastic Search with Poisson and Deterministic Resetting
• Monotonous continuous-time random walks with drift and stochastic reset events
• Long-Range Navigation on Complex Networks using Lévy Random Walks
• Extreme events on complex networks
• Fractional dynamics on networks: Emergence of anomalous diffusion and Lévy flights
• First passage under restart for discrete space and time: application to one dimensional confined lattice random walks
• Stochastic resetting in interacting particle systems: A review
• Extreme statistics and spacing distribution in a Brownian gas correlated by resetting
• Diffusive transport on networks with stochastic resetting to multiple nodes
• Encounter times in overlapping domains: application to epidemic spread in a population of territorial animals
• A markovian random walk model of epidemic spreading
• From classical to quantum walks with stochastic resetting on networks
• Fractional random walk lattice dynamics
• Mean encounter times for multiple random walkers on networks
• Diffusion with two resetting points
• Critical number of walkers for diffusive search processes with resetting
• Random walks with stochastic resetting in complex networks: a discrete time approach