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...

Celý popis

Podrobná bibliografia

Vydané v:	Random structures & algorithms Ročník 58; číslo 2; s. 294 - 321
Hlavní autori:	Chen, Zongchen, Galanis, Andreas, Goldberg, Leslie A., Perkins, Will, Stewart, James, Vigoda, Eric
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York John Wiley & Sons, Inc 01.03.2021 Wiley Subscription Services, Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!