Papers › All-atom computations with irreversible Markov chains

All-atom computations with irreversible Markov chains

16 Apr 2018arXiv:1804.05795links table onlyarchive 2025-07-28

Michael F. Faulkner, Liang Qin, A. C. Maggs, Werner Krauth

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.

The event-chain Monte Carlo (ECMC) method is an irreversible Markov process based on the factorized Metropolis filter and the concept of lifted Markov chains. Here, ECMC is applied to all-atom models of multi-particle interactions that include the long-ranged Coulomb potential. We discuss a line-charge model for the Coulomb potential and demonstrate its equivalence with the standard Coulomb model with tin-foil boundary conditions. Efficient factorization schemes for the potentials used in all-atom water models are presented, before we discuss the best choice for lifting schemes for factors of more than three particles. The factorization and lifting schemes are then applied to simulations of point-charge and charged-dipole Coulomb gases, as well as to small systems of liquid water. For a locally charge-neutral system in three dimensions, the algorithmic complexity is O(N log N) in the number N of particles. In ECMC, a Particle-Particle method, it is achieved without the interpolating mesh required for the efficient implementation of other modern Coulomb algorithms. An event-driven, cell-veto-based implementation samples the equilibrium Boltzmann distribution using neither time-step approximations nor spatial cutoffs on the range of the interaction potentials. We discuss prospects and challenges for ECMC in soft condensed-matter and biological physics.

PaperPDFCode

Code

jellyfysh/JeLLyFysh mentioned on GitHub report

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