Mixing and perfect sampling in one-dimensional particle systems

Abstract

We study the approach to equilibrium of the event-chain Monte Carlo (ECMC) algorithm for the one-dimensional hard-sphere model. Using the connection to the coupon-collector problem, we prove that a specific version of this local irreversible Markov chain realizes perfect sampling in O(N^2 log N) events, whereas the reversible local Metropolis algorithm requires O(N^3 log N) time steps for mixing. This confirms a special case of an earlier conjecture about O(N^2 log N) scaling of mixing times of ECMC and of the forward Metropolis algorithm, its discretized variant. We furthermore prove that sequential ECMC (with swaps) realizes perfect sampling in O(N^2) events. Numerical simulations indicate a cross-over towards O(N^2 log N) mixing for the sequential forward swap Metropolis algorithm, that we introduce here. We point out open mathematical questions and possible applications of our findings to higher-dimensional statistical-physics models.

7 pages, 7 figures

References in corpus (2)

• All-atom computations with irreversible Markov chains
• TASEP on a ring in sub-relaxation time scale

Cited by in corpus (9)

• Event-chain Monte Carlo: foundations, applications, and prospects
• Triangle-Well and Ramp Interactions in One-Dimensional Fluids: A Fully Analytic Exact Solution
• JeLLyFysh-Version1.0 -- a Python application for all-atom event-chain Monte Carlo
• Event-chain Monte Carlo with factor fields
• Hard-disk dipoles and non-reversible Markov chains
• Lifted TASEP: a Bethe ansatz integrable paradigm for non-reversible Markov chains
• Direction-sweep Markov chains
• Non-reversible lifts of reversible diffusion processes and relaxation times
• Lifted TASEP: long-time dynamics,generalizations, and continuum limit