Metraipolis › archive › dc_06f95eb4a60a
Optimal sampling strategies in event-chain Monte Carlo — arXiv:2610.01659
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.01659
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T15:52:27.213Z
- SHA-256 of the archived text
772b80958057a1ceeed22233f4116fae9849470f7849c677cbb59db2a77599a4- Stable URL of this page
https://metraipolis.com/documento/dc_06f95eb4a60a
How to cite
Optimal sampling strategies in event-chain Monte Carlo — arXiv:2610.01659 — arXiv (en), https://arxiv.org/abs/2610.01659 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_06f95eb4a60a (Metraipolis archive dc_06f95eb4a60a, sha256 772b80958057a1ceeed22233f4116fae9849470f7849c677cbb59db2a77599a4)
BibTeX
@misc{dc06f95eb4a60a,
title = {Optimal sampling strategies in event-chain Monte Carlo — arXiv:2610.01659},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.01659},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_06f95eb4a60a; sha256 772b80958057a1ceeed22233f4116fae9849470f7849c677cbb59db2a77599a4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01659. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Event-chain Monte Carlo (ECMC) has revolutionised computational sampling over recent years, providing a powerful alternative to the molecular-dynamics (MD) and Hamiltonian Monte Carlo (HMC) algorithms. Each method outperforms the ubiquitous random-walk Metropolis algorithm by advancing particles along deterministic trajectories, but ECMC achieves this without being constrained by Newtonian dynamics. Recent advances exploited this dynamical freedom to induce a collective particle dynamics that relax local density variations on fast timescales. In a foundational model of $N$ pairwise-interacting particles on the 1D torus, this led to an $O(N^{3/4})$ improvement on the industry-leading computational efficiency of MD and HMC - but with an impractically small prefactor at low/high mean particle density for general attractive/repulsive interactions. Here we present a universal framework that generalises this high-efficiency sampling strategy to all translationally symmetric pairwise models on the torus - creating the potential to surpass MD and HMC as the state of the art. We also numerically elucidate the collective particle dynamics and discuss broad impact across the physical sciences and computational statistics.
Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-10-02 in stat.CO).
Categorie arXiv: Statistical Mechanics (cond-mat.stat-mech) ; Computation (stat.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.01659 — 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-06T15:14:21.437Z dalla pagina https://arxiv.org/catchup/stat.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).