Papers › Computing probabilities of very rare events for Langevin processes: a new method based...
Computing probabilities of very rare events for Langevin processes: a new method based on importance sampling
O. Mazonka, C. Jarzynski, J. Blocki
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Langevin equations are used to model many processes of physical interest, including low-energy nuclear collisions. In this paper we develop a general method for computing probabilities of very rare events (e.g. small fusion cross-sections) for processes described by Langevin dynamics. As we demonstrate with numerical examples as well as an exactly solvable model, our method can converge to the desired answer at a rate which is orders of magnitude faster than that achieved with direct simulations of the process in question.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections