- Physical Review Journals
All JournalsPhysics Magazine
Access Provided by Xinjiang University

Physical Review E

Export citation

Export citation

Choose format for download:

Download Citation
  • Access by Xinjiang University

Encounter times of random walkers with simultaneous resetting on networks

Cristian D. Suarez-Jimenez1, Alejandro P. Riascos1, and Denis Boyer2

PDF

Phys. Rev. E 114, 044306 – Published 2 October, 2026

DOI: https://doi.org/10.1103/qftv-sbqs

Abstract

In this work, we study the dynamics of multiple random walkers on networks subject to a simultaneous resetting protocol, whereby all walkers are synchronously returned to their respective initial nodes. For this collective Markovian process, we derive exact analytical expressions for the mean first-encounter time, defined as the average time required for all walkers to meet for the first time at a given node. These results are formulated in terms of the eigenvalues and eigenvectors of the transition matrices governing the dynamics without resetting, providing a clear spectral interpretation of the impact of resetting on encounter processes. We further establish a general criterion for finite networks that determines when the introduction of a nonzero resetting probability reduces the mean first-encounter time and leads to an optimal resetting strategy. The theoretical predictions are illustrated through numerical results on regular and heterogeneous networks, for encounters involving two or more walkers, and for combinations of local and nonlocal dynamics. Our findings demonstrate that simultaneous resetting can significantly reduce encounter times for specific target nodes and initial conditions, while becoming ineffective for highly exploratory dynamics or distant targets. A comparison with independent resetting shows that simultaneous resetting is more efficient in homogeneous networks, whereas independent resetting can outperform it in heterogeneous structures, thereby revealing a trade-off between synchronization and exploration. The framework provides a unified approach to collective search and encounter problems on networks with resetting.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (82)

  1. M. R. Evans and S. N. Majumdar, Diffusion with stochastic resetting, Phys. Rev. Lett. 106, 160601 (2011 ).
  2. M. R. Evans and S. N. Majumdar, Diffusion with optimal resetting, J. Phys. A: Math. Theor. 44, 435001 (2011).
  3. S. Reuveni, Optimal stochastic restart renders fluctuations in first passage times universal, Phys. Rev. Lett. 116, 170601 (2016).
  4. M. R. Evans, S. N. Majumdar, and G. Schehr, Stochastic resetting and applications, J. Phys. A: Math. Theor. 53, 193001 (2020).
  5. A. Pal, A. Kundu, and M. R. Evans, Diffusion under time-dependent resetting, J. Phys. A: Math. Theor. 49, 225001 (2016).
  6. A. Nagar and S. Gupta, Diffusion with stochastic resetting at power-law times, Phys. Rev. E 93, 060102(R) (2016).
  7. U. Bhat, C. De Bacco, and S. Redner, Stochastic search with Poisson and deterministic resetting, J. Stat. Mech. (2016) 083401.
  8. A. Chechkin and I. M. Sokolov, Random search with resetting: A unified renewal approach, Phys. Rev. Lett. 121, 050601 (2018).
  9. A. Pal and V. V. Prasad, First passage under stochastic resetting in an interval, Phys. Rev. E 99, 032123 (2019).
  10. A. Nagar and S. Gupta, Stochastic resetting in interacting particle systems: A review, J. Phys. A: Math. Theor. 56, 283001 (2023).
  11. P. Julián-Salgado, L. Dagdug, and D. Boyer, Diffusion with two resetting points, Phys. Rev. E 109, 024134 (2024).
  12. S. N. Majumdar, S. Sabhapandit, and G. Schehr, Dynamical transition in the temporal relaxation of stochastic processes under resetting, Phys. Rev. E 91, 052131 (2015).
  13. M. Montero and J. Villarroel, Monotonic continuous-time random walks with drift and stochastic reset events, Phys. Rev. E 87, 012116 (2013).
  14. S. Ray, D. Mondal, and S. Reuveni, Péclet number governs transition to acceleratory restart in drift-diffusion, J. Phys. A: Math. Theor. 52, 255002 (2019).
  15. Ł. Kuśmierz and E. Gudowska-Nowak, Optimal first-arrival times in Lévy flights with resetting, Phys. Rev. E 92, 052127 (2015).
  16. L. Kusmierz, S. N. Majumdar, S. Sabhapandit, and G. Schehr, First order transition for the optimal search time of Lévy flights with resetting, Phys. Rev. Lett. 113, 220602 (2014).
  17. A. Masó-Puigdellosas, D. Campos, and V. Méndez, Transport properties and first-arrival statistics of random motion with stochastic reset times, Phys. Rev. E 99, 012141 (2019).
  18. Ł. Kuśmierz and E. Gudowska-Nowak, Subdiffusive continuous-time random walks with stochastic resetting, Phys. Rev. E 99, 052116 (2019).
  19. M. E. J. Newman, Networks: An Introduction (Oxford University Press, Oxford, 2010)
  20. A.-L. Barabási, Network Science (Cambridge University Press, Cambridge, UK, 2016).
  21. A. Barrat, M. Barthélemy, and A. Vespignani, Dynamical Processes on Complex Networks (Cambridge University Press, Cambridge, UK, 2008).
  22. P. Van Mieghem, Graph Spectra for Complex Networks (Cambridge University Press, New York, 2011).
  23. B. D. Hughes, Random Walks and Random Environments: Vol. 1: Random Walks (Oxford University Press, New York, 1995).
  24. L. Lovász, Random walks on graphs: A survey, in Combinatorics, Paul Erdős is Eighty, edited by D. Miklós, V. T. Sós, and T. Szőnyi (János Bolyai Mathematical Society, Budapest, 1996), Vol. 2, pp. 353–398.
  25. O. Mülken and A. Blumen, Continuous-time quantum walks: Models for coherent transport on complex networks, Phys. Rep. 502, 37 (2011).
  26. J. D. Noh and H. Rieger, Random walks on complex networks, Phys. Rev. Lett. 92, 118701 (2004).
  27. V. Tejedor, O. Bénichou, and R. Voituriez, Global mean first-passage times of random walks on complex networks, Phys. Rev. E 80, 065104(R) (2009).
  28. N. Masuda, M. A. Porter, and R. Lambiotte, Random walks and diffusion on networks, Phys. Rep. 716-717, 1 (2017).
  29. K. Avrachenkov, R. van der Hofstad, and M. Sokol, Personalized PageRank with node-dependent restart, in Algorithms and Models for the Web Graph, edited by A. Bonato, F. C. Graham, and P. Prałat (Springer, Cham, 2014), pp. 23–33.
  30. K. Avrachenkov, A. Piunovskiy, and Y. Zhang, Hitting times in Markov chains with restart and their application to network centrality, Methodol. Comput. Appl. Probab. 20, 1173 (2018).
  31. D. C. Rose, H. Touchette, I. Lesanovsky, and J. P. Garrahan, Spectral properties of simple classical and quantum reset processes, Phys. Rev. E 98, 022129 (2018).
  32. A. P. Riascos, D. Boyer, P. Herringer, and J. L. Mateos, Random walks on networks with stochastic resetting, Phys. Rev. E 101, 062147 (2020).
  33. L. Christophorov, Peculiarities of random walks with resetting in a one-dimensional chain, J. Phys. A: Math. Theor. 54, 015001 (2021).
  34. S. Wald and L. Böttcher, From classical to quantum walks with stochastic resetting on networks, Phys. Rev. E 103, 012122 (2021).
  35. O. L. Bonomo and A. Pal, First passage under restart for discrete space and time: Application to one-dimensional confined lattice random walks, Phys. Rev. E 103, 052129 (2021).
  36. F. H. González, A. P. Riascos, and D. Boyer, Diffusive transport on networks with stochastic resetting to multiple nodes, Phys. Rev. E 103, 062126 (2021).
  37. A. Li and X. Sun, Biased random walks on networks with stochastic resetting, Phys. Rev. E 111, 054309 (2025).
  38. A. P. Riascos, D. Boyer, and J. L. Mateos, Discrete-time random walks and Lévy flights on arbitrary networks: When resetting becomes advantageous? J. Phys. A: Math. Theor. 55, 274002 (2022).
  39. T. M. Michelitsch, G. D'Onofrio, F. Polito, and A. P. Riascos, Random walks with stochastic resetting in complex networks: A discrete-time approach, Chaos 35, 013119 (2025).
  40. T. Weng, J. Zhang, M. Small, and P. Hui, Multiple random walks on complex networks: A harmonic law predicts search time, Phys. Rev. E 95, 052103 (2017).
  41. A. P. Riascos and J. L. Mateos, Emergence of encounter networks due to human mobility, PLoS One 12, e0184532 (2017).
  42. R. Mastrandrea, J. Fournet, and A. Barrat, Contact patterns in a high school: A comparison between data collected using wearable sensors, contact diaries and friendship surveys, PLoS One 10, e0136497 (2015).
  43. R. Pastor-Satorras and A. Vespignani, Epidemic spreading in scale-free networks, Phys. Rev. Lett. 86, 3200 (2001).
  44. L. D. Valdez, L. A. Braunstein, and S. Havlin, Epidemic spreading on modular networks: The fear to declare a pandemic, Phys. Rev. E 101, 032309 (2020).
  45. M. Bestehorn, A. P. Riascos, T. M. Michelitsch, and B. A. Collet, A Markovian random walk model of epidemic spreading, Continuum Mech. Thermodyn. 33, 1207 (2021).
  46. L. Giuggioli and S. Sarvaharman, Spatio-temporal dynamics of random transmission events: From information sharing to epidemic spread, J. Phys. A: Math. Theor. 55, 375005 (2022).
  47. T. Granger, T. M. Michelitsch, M. Bestehorn, A. P. Riascos, and B. A. Collet, Stochastic compartment model with mortality and its application to epidemic spreading in complex networks, Entropy 26, 362 (2024).
  48. L. Giuggioli, S. Pérez-Becker, and D. P. Sanders, Encounter times in overlapping domains: Application to epidemic spread in a population of territorial animals, Phys. Rev. Lett. 110, 058103 (2013).
  49. M. E. Craft, Infectious disease transmission and contact networks in wildlife and livestock, Philos. Trans. R. Soc. B 370, 20140107 (2015).
  50. V. Kishore, M. S. Santhanam, and R. E. Amritkar, Extreme events on complex networks, Phys. Rev. Lett. 106, 188701 (2011).
  51. L. Dai, M. Dai, Y. Huang, Y. Li, J. Shen, H. Chi, and W. Su, Searching efficiency of multiple walkers on the weighted networks, Physica A 541, 123352 (2020).
  52. T. Weng, J. Zhang, M. Small, B. Harandizadeh, and P. Hui, Universal principles governing multiple random searchers on complex networks: The logarithmic growth pattern and the harmonic law, Phys. Rev. E 97, 032320 (2018).
  53. D. P. Sanders, Exact encounter times for many random walkers on regular and complex networks, Phys. Rev. E 80, 036119 (2009).
  54. A. P. Riascos and D. P. Sanders, Mean encounter times for multiple random walkers on networks, Phys. Rev. E 103, 042312 (2021).
  55. T. Weng, J. Zhang, M. Small, and P. Hui, Hunting for a moving target on a complex network, Europhys. Lett. 119, 48006 (2017).
  56. T. Weng, J. Zhang, M. Small, H. Yang, and P. Hui, Predicting search time when hunting for multiple moving targets: A recursive harmonic law, Chaos 28, 083109 (2018).
  57. D. Rubio-Gómez, A. P. Riascos, and J. L. Mateos, Mean first-encounter times of simultaneous random walkers with resetting on networks, J. Phys. A: Math. Theor. 58, 325003 (2025).
  58. M. Biroli, H. Larralde, S. N. Majumdar, and G. Schehr, Extreme statistics and spacing distribution in a Brownian gas correlated by resetting, Phys. Rev. Lett. 130, 207101 (2023).
  59. M. Biroli, S. N. Majumdar, and G. Schehr, Critical number of walkers for diffusive search processes with resetting, Phys. Rev. E 107, 064141 (2023).
  60. M. Biroli, H. Larralde, S. N. Majumdar, and G. Schehr, Exact extreme, order, and sum statistics in a class of strongly correlated systems, Phys. Rev. E 109, 014101 (2024).
  61. G. de Mauro, M. Biroli, S. N. Majumdar, and G. Schehr, Dynamically emergent correlations in Brownian particles subject to simultaneous non-Poissonian resetting protocols, Phys. Rev. E 113, 014120 (2026).
  62. D. Boyer and S. N. Majumdar, Emerging correlations between diffusing particles evolving via simultaneous resetting with memory, J. Phys. A: Math. Theor. 59, 125001 (2026).
  63. A. Biswas, S. N. Majumdar, and A. Pal, Target search optimization by threshold resetting, Phys. Rev. Lett. 135, 227101 (2025).
  64. R. Falcao and M. R. Evans, Interacting Brownian motion with resetting, J. Stat. Mech.: Theory Exp. (2017) 023204.
  65. R. K. Singh, T. Sandev, and S. Singh, Bernoulli trial under restarts: A comparative study of resetting transitions, Phys. Rev. E 108, L052106 (2023).
  66. R. K. Singh, R. Metzler, and T. Sandev, Bernoulli trial under subsystem restarts: Two competing searchers looking for a target, Chaos 35, 011103 (2025).
  67. J. Lee, S.-G. Yang, H. J. Park, and L. Lizana, General theory for group resetting with application to avoidance, Phys. Rev. Res. 8, 013227 (2026).
  68. J. Lee, S.-G. Yang, and L. Lizana, Beyond average: Heterogeneous first-passage dynamics in many-particle systems with resetting, arXiv:2604.24406.
  69. S. N. Majumdar and G. Schehr, Dynamically emergent correlations, Europhys. Lett. 155, 11001 (2026).
  70. A. P. Riascos and J. L. Mateos, Random walks on weighted networks: A survey of local and non-local dynamics, J. Complex Netw. 9, cnab032 (2021).
  71. M. Kac, On the notion of recurrence in discrete stochastic processes, Bull. Am. Math. Soc. 53, 1002 (1947).
  72. A. Pal and S. Reuveni, First passage under restart, Phys. Rev. Lett. 118, 030603 (2017).
  73. A. Pal, S. Kostinski, and S. Reuveni, The inspection paradox in stochastic resetting, J. Phys. A: Math. Theor. 55, 021001 (2022).
  74. A. Pal, V. Stojkoski, and T. Sandev, Random resetting in search problems, in Target Search Problems, edited by D. Grebenkov, R. Metzler, and G. Oshanin (Springer Nature Switzerland, Cham, 2024), pp. 323–355.
  75. A. Pal and V. V. Prasad, Landau-like expansion for phase transitions in stochastic resetting, Phys. Rev. Res. 1, 032001(R) (2019).
  76. J. Dall and M. Christensen, Random geometric graphs, Phys. Rev. E 66, 016121 (2002).
  77. P. Erdős and A. Rényi, On random graphs. I, Publ. Math. Debrecen 6, 290 (1959).
  78. D. J. Watts and S. H. Strogatz, Collective dynamics of ‘small-world’ networks, Nature (London) 393, 440 (1998).
  79. A.-L. Barabaśi and R. Albert, Emergence of scaling in random networks, Science 286, 509 (1999).
  80. A. P. Riascos and J. L. Mateos, Fractional dynamics on networks: Emergence of anomalous diffusion and Lévy flights, Phys. Rev. E 90, 032809 (2014).
  81. A. P. Riascos and J. L. Mateos, Long-range navigation on complex networks using Lévy random walks, Phys. Rev. E 86, 056110 (2012).
  82. T. M. Michelitsch, A. P. Riascos, B. A. Collet, A. F. Nowakowski, and F. C. G. A. Nicolleau, Fractional Dynamics on Networks and Lattices (ISTE/Wiley, London, 2019).

Outline

Information

Phys. Rev. E 114, 044306– Published 2 October, 2026
  • Received 21 April 2026
  • Accepted 11 September 2026
Crossmark - Check for updates button

©2026 American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation