{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T07:58:27Z","timestamp":1787385507292,"version":"3.56.0"},"reference-count":30,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/S016694\/1"],"award-info":[{"award-number":["EP\/S016694\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:p>We present a simple algorithm that perfectly samples configurations from the unique Gibbs measure of a spin system on a potentially infinite graph $G$. The sampling algorithm assumes strong spatial mixing together with subexponential growth of $G$. It produces a finite window onto a perfect sample from the Gibbs distribution. The run-time is linear in the size of the window, in particular it is constant for each vertex.<\/jats:p>","DOI":"10.1137\/21m1437433","type":"journal-article","created":{"date-parts":[[2022,7,26]],"date-time":"2022-07-26T12:23:23Z","timestamp":1658838203000},"page":"1280-1295","source":"Crossref","is-referenced-by-count":10,"title":["Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing"],"prefix":"10.1137","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5778-9397","authenticated-orcid":true,"given":"Konrad","family":"Anand","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0863-7279","authenticated-orcid":true,"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2022,7,26]]},"reference":[{"key":"atypb1","volume-title":"Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid, preprint, arXiv:1811.01816 [cs.DS]","author":"Anari N.","year":"2018"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-016-3357-2"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01012867"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250809"},{"key":"atypb5","volume-title":"Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansion, preprint, arXiv:2011.02075 [cs.DM]","author":"Chen Z.","year":"2020"},{"key":"atypb6","volume-title":"Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction, preprint, arXiv:2004.09083 [cs.DS]","author":"Chen Z.","year":"2020"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"J. Ding, J. Song, and R. Sun,\n                      A new correlation inequality for Ising models with external fields\n                      , Probab. Theory Related Fields, in press,https:\/\/doi.org\/10.1007\/s00440-022-01132-1.","DOI":"10.1007\/s00440-022-01132-1"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20004"},{"key":"atypb9","volume-title":"Proc. Inform. 145","author":"Efthymiou C.","year":"2019"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892138"},{"key":"atypb12","volume-title":"Statistical Mechanics of Lattice Systems","author":"Friedli S.","year":"2018"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1063\/1.1703954"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704445470"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1145\/3310131"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1201\/b19235"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/0218077"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-019-3847-0"},{"key":"atypb19","volume-title":"Proc. Inform. 207","author":"Liu K.","year":"2021"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02099735"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/16M1101003"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0917"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-021-02831-0"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-016-0708-2"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.40"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOP1405"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1063\/1.533198"},{"key":"atypb28","first-page":"1501","volume":"27","author":"van den Berg J.","year":"1999","journal-title":"Ann. Probab."},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/140976923"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132538"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.04.012"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/21M1437433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:44:50Z","timestamp":1787337890000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/21M1437433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,26]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["10.1137\/21M1437433"],"URL":"https:\/\/doi.org\/10.1137\/21m1437433","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,26]]}}}