Maxwell's Demon in Markov Chain Monte Carlo: Cooling Information Flow and Entropy Balance

Abstract

Markov chain Monte Carlo algorithms can be viewed as feedback devices that compare a proposed move with the target distribution and then accept or reject it. In this paper the Maxwell demon is identified with the acceptance module: it measures a proposed edge, stores the outcome in the accept/reject bit, and uses that bit to shape the probability current. The decision bit carries a genuine Shannon mutual information about the proposal, whereas only its directional part is converted into a cooling information flow. The relative-entropy relaxation rate obeys $v(t)={\dot{\mathcal{I}}}_{\mathrm{cool}}(t)+\dot{S}(t)$, which separates useful cooling from housekeeping circulation in nonreversible chains.

10 pages, 1 figure