On the swapping algorithm
From MaRDI portal
Publication:4798182
DOI10.1002/rsa.10066zbMath1013.60074OpenAlexW2130047894MaRDI QIDQ4798182
Publication date: 19 March 2003
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10066
Markov chain Monte Carlospectral gapmean-field Ising model decompositionMetropolis-coupled Markov chains
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)
Related Items
Equi-energy sampling does not converge rapidly on the mean-field Potts model with three colors close to the critical temperature ⋮ Hierarchical models for relational event sequences ⋮ Simulated tempering and swapping on mean-field models ⋮ Some remarks on replicated simulated annealing ⋮ Finite sample complexity of sequential Monte Carlo estimators on multimodal target distributions ⋮ Quantitative approximations of evolving probability measures and sequential Markov chain Monte Carlo methods ⋮ Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo ⋮ Convergence rate of Markov chain methods for genomic motif discovery ⋮ Error bounds for sequential Monte Carlo samplers for multimodal distributions ⋮ A bound for the convergence rate of parallel tempering for sampling restricted Boltzmann machines ⋮ Eigenvalue bounds on restrictions of reversible nearly uncoupled Markov chains ⋮ The swapping algorithm for the Hopfield model with two patterns ⋮ Convergence rates of Markov chains for some self-assembly and non-saturated Ising models ⋮ Poincaré and logarithmic Sobolev constants for metastable Markov chains via capacitary inequalities ⋮ Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions ⋮ On swapping and simulated tempering algorithms. ⋮ Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model
Cites Work
