Metraipolis › archive › dc_80d19e770b41

Rare-event sampling for stochastic dynamics in network systems using cluster updates — arXiv:2608.16171

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.16171
License (as archived)
CC0-1.0
Archived
2026-10-16T07:54:34.951Z
SHA-256 of the archived text
b3dea1d9ca83578580ec969a99f6111891a45429d8f60d9079302907c8331c01
Stable URL of this page
https://metraipolis.com/documento/dc_80d19e770b41

How to cite

Rare-event sampling for stochastic dynamics in network systems using cluster updates — arXiv:2608.16171 — arXiv (en), https://arxiv.org/abs/2608.16171 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_80d19e770b41 (Metraipolis archive dc_80d19e770b41, sha256 b3dea1d9ca83578580ec969a99f6111891a45429d8f60d9079302907c8331c01)
BibTeX
@misc{dc80d19e770b41,
  title = {Rare-event sampling for stochastic dynamics in network systems using cluster updates — arXiv:2608.16171},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.16171},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_80d19e770b41; sha256 b3dea1d9ca83578580ec969a99f6111891a45429d8f60d9079302907c8331c01},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16171. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Understanding the stochastic evolution in complex networks is a central challenge across physics, biology, engineering, social science, and finance. The most consequential macroscopic events, like cascading failures in communication networks, widespread epidemic outbreaks, and rapid shifts in societal opinions, often emerge from a confluence of rare, localized stochastic processes and need to pass certain bottlenecks. Standard forward-time simulation algorithms like the Gillespie method are inefficient for the investigation of such phenomena due to catastrophic rejection rates. Advanced rare-event techniques like splitting methods and transition-path sampling often suffer from kinetic trapping, path degeneracy, genealogical correlations, or critical slowing down when applied to complex heterogeneous networks. We propose to overcome this challenge by establishing a novel technique called conditional-path Monte Carlo (CPMC), inspired by loop algorithms from equilibrium condensed-matter physics. By employing non-local updates on spacetime clusters without rejections, CPMC generates a Markov chain of trajectories that all strictly respect the targeted macroscopic boundary conditions like the occurrence of a massive network failure. We demonstrate the framework's potential by performing a simple risk factor analysis for rare large-scale epidemic outbreaks in SIS dynamics on kinship networks.

Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-10 in cs.SI).
Categorie arXiv: Statistical Mechanics (cond-mat.stat-mech) ; Social and Information Networks (cs.SI); Computational Physics (physics.comp-ph); Physics and Society (physics.soc-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.16171 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T07:35:38.035Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).