Event-Chain Monte Carlo: The global-balance breakthrough

TL;DR

The paper reviews the Event-Chain Monte Carlo (ECMC) algorithm, highlighting its rejection-free, deterministic sampling approach that accelerates equilibration in dense particle systems by leveraging global balance instead of detailed balance.

Contribution

It explains the foundational ECMC algorithm, its generalization to continuous potentials, and its significance within the broader framework of lifted Markov chain Monte Carlo methods.

Findings

ECMC achieves rejection-free, deterministic sampling for hard spheres.

Global balance enables faster equilibration compared to detailed balance.

The framework generalizes to continuous potentials and modern algorithms.

Abstract

The seminal 2009 paper by Bernard, Krauth, and Wilson marked a paradigm shift in Monte Carlo sampling. By abandoning the restrictive condition of detailed balance in favor of the more fundamental principle of global balance, they introduced the Event-Chain Monte Carlo (ECMC) algorithm, which achieves rejection-free, deterministic sampling for hard spheres. This breakthrough demonstrated that persistent, directional dynamics could dramatically accelerate equilibration in dense particle systems. In this commentary, we review this foundational work and elucidate its underlying mechanism using the broader Event-Driven Monte Carlo (EDMC) framework developed in subsequent years. We show how the original hard-sphere concept naturally generalizes to continuous potentials and modern lifted Markov chain formalisms, transforming a surprising specific result into a powerful general class of sampling algorithms.