
doi: 10.1002/rsa.10066
AbstractThe Metropolis‐coupled Markov chain method (or “Swapping Algorithm”) is an empirically successful hybrid Monte Carlo algorithm. It alternates between standard transitions on parallel versions of the system at different parameter values, and swapping two versions. We prove rapid mixing for two bimodal examples, including the mean‐field Ising model. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 22: 66–97, 2002
Markov chain Monte Carlo, spectral gap, Metropolis-coupled Markov chains, Numerical methods of time-dependent statistical mechanics, Interacting random processes; statistical mechanics type models; percolation theory, Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics, mean-field Ising model decomposition
Markov chain Monte Carlo, spectral gap, Metropolis-coupled Markov chains, Numerical methods of time-dependent statistical mechanics, Interacting random processes; statistical mechanics type models; percolation theory, Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics, mean-field Ising model decomposition
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 25 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
