Fast algorithms at low temperatures via Markov chains

Efficient algorithms for approximate counting and sampling in spin systems typically apply in the so‐called high‐temperature regime, where the interaction between neighboring spins is “weak.” Instead, recent work of Jenssen, Keevash, and Perkins yields polynomial‐time algorithms in the low‐temperatu...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 58; no. 2; pp. 294 - 321
Main Authors:	Chen, Zongchen, Galanis, Andreas, Goldberg, Leslie A., Perkins, Will, Stewart, James, Vigoda, Eric
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.03.2021 Wiley Subscription Services, Inc
Subjects:	Algorithms approximate counting expander graphs Ferromagnetism Graphs hard‐core model Low temperature Markov analysis Markov chains Polymers Polynomials Potts model Run time (computers) Sampling Temperature
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!