Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point

From MaRDI portal
Publication:2428505


DOI10.1007/s00440-010-0329-0zbMath1250.60034arXiv1011.3058MaRDI QIDQ2428505

Prasad Tetali, Christian Borgs, Jennifer T. Chayes

Publication date: 26 April 2012

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.3058


60J22: Computational methods in Markov chains

60K35: Interacting random processes; statistical mechanics type models; percolation theory

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)


Related Items



Cites Work