Singular relaxation of a random walk in a box with a Metropolis Monte Carlo dynamics
- 1 June 2023
- journal article
- research article
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 56 (25) , 255003
Abstract
We study analytically the relaxation eigenmodes of a simple Monte Carlo algorithm, corresponding to a particle in a box which moves by uniform random jumps. Moves outside of the box are rejected. At long times, the system approaches the equilibrium probability density, which is uniform inside the box. We show that the relaxation towards this equilibrium is unusual: for a jump length comparable to the size of the box, the number of relaxation eigenmodes can be surprisingly small, one or two. We provide a complete analytic description of the transition between these two regimes. When only a single relaxation eigenmode is present, a suitable choice of the symmetry of the initial conditions gives a localizing decay to equilibrium. In this case, the deviation from equilibrium concentrates at the edges of the box where the rejection probability is maximal. Finally, in addition to the relaxation analysis of the Master equation, we also describe the full eigen-spectrum of the Master equation including its sub-leading eigen-modes.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Gibbs/Metropolis algorithms on a convex polytopeMathematische Zeitschrift, 2011
- The Markov chain Monte Carlo revolutionBulletin of the American Mathematical Society, 2008
- Escape of a Uniform Random Walk from an IntervalJournal of Statistical Physics, 2006
- Numerical Results for the Metropolis AlgorithmExperimental Mathematics, 2004
- General state space Markov chains and MCMC algorithmsProbability Surveys, 2004
- Optimum Monte Carlo simulations: some exact resultsJournal of Physics A: General Physics, 2003
- TRANSITIONPATHSAMPLING: Throwing Ropes Over Rough Mountain Passes, in the DarkAnnual Review of Physical Chemistry, 2002
- Weak convergence and optimal scaling of random walk Metropolis algorithmsThe Annals of Applied Probability, 1997
- Optimum Monte-Carlo sampling using Markov chainsBiometrika, 1973
- The Monte Carlo MethodJournal of the American Statistical Association, 1949