- 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

Resetting-based designated information distribution

Xiaojuan Ma1,*, Yan Wang2,3,*, and Indranil Gupta1

  • *These authors contributed equally to this work and are listed alphabetically.
PDF

Phys. Rev. E 114, 054309 – Published 9 November, 2026

DOI: https://doi.org/10.1103/pgt1-cs46

Abstract

For a network of n nodes under random gossip dynamics, we show that by introducing the additional resetting mechanism (with rate β) to a designated subset of r nodes, the expected sum of all node values is asymptotically equal to nr times the sum of the initial values of the r designated nodes, in the small-β and long-time limit. We also analyze the convergence speed to this asymptotic state and provide an approximate high-probability confidence interval for the expected sum at finite time t and finite β. Operationally, we propose a protocol that distributes the initial node values over the designated subset evenly (up to a prescribed precision), by appropriately turning on and off the resetting dynamics. Our work not only offers insights into classical problems such as distributed computing and network control, but also serves as a potential foundation for designing quantum algorithms that prepare desired states in quantum networks using only local operations.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (49)

  1. C. Külske, The Ising model: Highlights and perspectives, Math. Phys. Anal. Geom. 28, 20 (2025).
  2. M. Mobilia, Does a single zealot affect an infinite group of voters? Phys. Rev. Lett. 91, 028701 (2003).
  3. P. Clifford and A. Sudbury, A model for spatial conflict, Biometrika 60, 581 (1973).
  4. R. A. Holley and T. M. Liggett, Ergodic theorems for weakly interacting infinite systems and the voter model, Ann. Probab. 3, 643 (1975).
  5. C. Castellano, S. Fortunato, and V. Loreto, Statistical physics of social dynamics, Rev. Mod. Phys. 81, 591 (2009).
  6. M. Starnini, A. Baronchelli, and R. Pastor-Satorras, Ordering dynamics of the multi-state voter model, J. Stat. Mech. (2012) P10027.
  7. G. A. Böhme and T. Gross, Fragmentation transitions in multistate voter models, Phys. Rev. E 85, 066117 (2012).
  8. M. H. Degroot, Reaching a consensus, J. Am. Stat. Assoc. 69, 118 (1974).
  9. D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, Next century challenges: Scalable coordination in sensor networks, in Proceedings of the ACM/IEEE International Conference on Mobile Computing Networks (MobiCom) (Association for Computing Machinery, New York, 1999), pp. 263–270.
  10. W. R. Heinzelman, J. Kulik, and H. Balakrishnan, Adaptive protocols for information dissemination in wireless sensor networks, in Proceedings of the ACM/IEEE International Conference on Mobile Computing Networks (MobiCom) (Association for Computing Machinery, New York, 1999), pp. 174–185.
  11. C. Sengul, M. J. Miller, and I. Gupta, Adaptive probability-based broadcast forwarding in energy-saving sensor networks, ACM Trans. Sen. Netw. 4, 1 (2008).
  12. A. Lalitha, S. Shekhar, T. Javidi, and F. Koushanfar, Fully decentralized federated learning, in Third Workshop on Bayesian Deep Learning at NeurIPS, Vol. 12, 2018 (unpublished).
  13. X. Lian, C. Zhang, H. Zhang, C.-J. Hsieh, W. Zhang, and J. Liu, Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent, in Advances in Neural Information Processing Systems (Curran Associates, Inc, Red Hook, NY, USA, 2017), Vol. 30, pp. 5336–5346.
  14. I. Hegedűs, G. Danner, and M. Jelasity, Gossip learning as a decentralized alternative to federated learning, in IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS) (Springer, Berlin, 2019), pp. 74–90.
  15. L. Yuan, Z. Wang, L. Sun, P. S. Yu, and C. G. Brinton, Decentralized federated learning: A survey and perspective, IEEE Internet Things J. 11, 34617 (2024).
  16. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomized gossip algorithms, IEEE Trans. Inf. Theory 52, 2508 (2006).
  17. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Gossip algorithms: design, analysis and applications, in IEEE International Conference on Computer Communications (IEEE INFOCOM) (IEEE Computer Society, Washington, DC, 2005), Vol. 3, pp. 1653–1664.
  18. D. Kempe, J. Kleinberg, and A. Demers, Spatial gossip and resource location protocols, J. ACM 51, 943 (2004).
  19. Z. J. Haas, J. Y. Halpern, and L. Li, Gossip-based ad hoc routing, in IEEE International Conference on Computer Communications (IEEE INFOCOM) (IEEE Computer Society, Washington, DC, 2002), Vol. 3, pp. 1707–1716.
  20. M. Jelasity, A. Montresor, and O. Babaoglu, Gossip-based aggregation in large dynamic networks, ACM Trans. Comput. Syst. 23, 219 (2005).
  21. R. J. Baxter, Exactly Solved Models in Statistical Mechanics (Elsevier, Amsterdam, 2016).
  22. M. Newman, Networks (Oxford University Press, Oxford, 2018).
  23. R. Olfati-Saber, J. A. Fax, and R. M. Murray, Consensus and cooperation in networked multi-agent systems, Proc. IEEE 95, 215 (2007).
  24. S. H. Strogatz, From Kuramoto to Crawford: Exploring the onset of synchronization in populations of coupled oscillators, Phys. D 143, 1 (2000).
  25. A.-L. Barabási, Network science, Philos. Trans. R. Soc. A 371, 20120375 (2013).
  26. D. Shah, Gossip algorithms, Found. Trends Netw. 3, 1 (2009).
  27. D. Kempe, A. Dobra, and J. Gehrke, in IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Wahington, DC, 2003), pp. 482–491.
  28. L. Mazzarella, A. Sarlette, and F. Ticozzi, Consensus for quantum networks: Symmetry from gossip interactions, IEEE Trans. Autom. Control 60, 158 (2015).
  29. R. Olfati-Saber and R. M. Murray, Consensus problems in networks of agents with switching topology and time-delays, IEEE Trans. Autom. Control 49, 1520 (2004).
  30. R. Carli, A. Chiuso, L. Schenato, and S. Zampieri, A PI consensus controller for networked clocks synchronization, IFAC Proc. Vol. 41, 10289 (2008).
  31. L. Schenato and F. Fiorentin, Average TimeSynch: A consensus-based protocol for clock synchronization in wireless sensor networks, Automatica 47, 1878 (2011).
  32. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed optimization and statistical learning via the alternating direction method of multipliers, Found. Trends Mach. Learn. 3, 1 (2011).
  33. A. Nedic and A. Ozdaglar, Distributed subgradient methods for multi-agent optimization, IEEE Trans. Autom. Control 54, 48 (2009).
  34. S. R. Madden, M. J. Franklin, J. M. Hellerstein, and W. Hong, TinyDB: An acquisitional query processing system for sensor networks, ACM Trans. Database Syst. 30, 122 (2005).
  35. H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. Agüera y Arcas, Communication-efficient learning of deep networks from decentralized data, in Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, edited by A. Singh and J. Zhu (PMLR, 2017), Vol. 54, pp. 1273–1282.
  36. A. Pal and S. Reuveni, First passage under restart, Phys. Rev. Lett. 118, 030603 (2017).
  37. R. K. Singh, R. Metzler, and T. Sandev, Competing random searchers under restarts, arXiv:2409.09390.
  38. A. Biswas, A. Kundu, and A. Pal, Search with stochastic home returns can expedite classical first passage under resetting, Phys. Rev. E 110, L042101 (2024).
  39. S. Belan, Restart could optimize the probability of success in a Bernoulli trial, Phys. Rev. Lett. 120, 080601 (2018).
  40. R. K. Singh, T. Sandev, and S. Singh, Bernoulli trial under restarts: A comparative study of resetting transitions, Phys. Rev. E 108, L052106 (2023).
  41. B. De Bruyne, J. Randon-Furling, and S. Redner, Optimization in first-passage resetting, Phys. Rev. Lett. 125, 050602 (2020).
  42. Y. Xu, M. Deng, X. Cheng, Y. Tian, Z. Liu, and T. Jaakkola, Restart sampling for improving generative processes, in Advances in Neural Information Processing Systems (NeurIPS, 2023), Vol. 36, pp. 76806–76838.
  43. N. E. Friedkin and E. C. Johnsen, Social influence and opinions, J. Math. Sociol. 15, 193 (1990).
  44. J. Ghaderi and R. Srikant, Opinion dynamics in social networks with stubborn agents: Equilibrium and convergence rate, Automatica 50, 3209 (2014).
  45. Y. Xing and K. H. Johansson, Concentration in gossip opinion dynamics over random graphs, SIAM J. Control Optim. 62, 1521 (2024).
  46. L. Wang, Y. Xing, and K. H. Johansson, On final opinions of the Friedkin-Johnsen model over random graphs with partially stubborn community, in Proceedings of the IEEE Conference on Decision and Control (IEEE, Piscataway, NJ, 2024), pp. 4562–4567.
  47. R. van Handel, Probability in high dimension, Lecture Notes (Princeton University) (Princeton University, Princeton, NJ, 2014).
  48. P. Erdös and A. Rényi, On random graphs I, Publ. Math. Debrecen 6, 18 (1959).
  49. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286, 509 (1999).

Outline

Information

Phys. Rev. E 114, 054309– Published 9 November, 2026
  • Received 26 November 2025
  • Revised 29 July 2026
  • Accepted 23 October 2026
Article part of CHORUS
Crossmark - Check for updates button

©2026 American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation