TY - JOUR
T1 - Phase Coexistence for the Hard-Core Model on ℤ 2
AU - Blanca, Antonio
AU - Chen, Yuxuan
AU - Galvin, David
AU - Randall, Dana
AU - Tetali, Prasad
N1 - Funding Information:
Research supported in part by NSF grants CCF-1420934, CCF-1555579 and CCF-1617306. Research supported in part by Simons Foundation grant 360240. Research supported in part by Simons Foundation grant 360240 and by National Security Agency grant NSA H98230-13-1-0248. Research supported in part by NSF grant CCF-1526900. Research supported in part by NSF grant DMS-1407657.
Funding Information:
† Research supported in part by NSF grants CCF-1420934, CCF-1555579 and CCF-1617306. ‡ Research supported in part by Simons Foundation grant 360240. §Research supported in part by Simons Foundation grant 360240 and by National Security NSA H98230-13-1-0248. ¶ Research supported in part by NSF grant CCF-1526900. ‖ Research supported in part by NSF grant DMS-1407657.
Publisher Copyright:
© Cambridge University Press 2018.
PY - 2019/1/1
Y1 - 2019/1/1
N2 - The hard-core model has attracted much attention across several disciplines, representing lattice gases in statistical physics and independent sets in discrete mathematics and computer science. On finite graphs, we are given a parameter λ, and an independent set I arises with probability proportional to λ |I| . On infinite graphs a Gibbs measure is defined as a suitable limit with the correct conditional probabilities, and we are interested in determining when this limit is unique and when there is phase coexistence, i.e., existence of multiple Gibbs measures. It has long been conjectured that on ℤ 2 this model has a critical value λ c ≈ 3.796 with the property that if λ < λ c then it exhibits uniqueness of phase, while if λ > λ c then there is phase coexistence. Much of the work to date on this problem has focused on the regime of uniqueness, with the state of the art being recent work of Sinclair, Srivastava, Štefankovič and Yin showing that there is a unique Gibbs measure for all λ < 2.538. Here we explore the other direction and prove that there are multiple Gibbs measures for all λ > 5.3506. We also show that with the methods we are using we cannot hope to replace 5.3506 with anything below 4.8771. Our proof begins along the lines of the standard Peierls argument, but we add two innovations. First, following ideas of Kotecký and Randall, we construct an event that distinguishes two boundary conditions and always has long contours associated with it, obviating the need to accurately enumerate short contours. Second, we obtain improved bounds on the number of contours by relating them to a new class of self-avoiding walks on an oriented version of ℤ 2 .
AB - The hard-core model has attracted much attention across several disciplines, representing lattice gases in statistical physics and independent sets in discrete mathematics and computer science. On finite graphs, we are given a parameter λ, and an independent set I arises with probability proportional to λ |I| . On infinite graphs a Gibbs measure is defined as a suitable limit with the correct conditional probabilities, and we are interested in determining when this limit is unique and when there is phase coexistence, i.e., existence of multiple Gibbs measures. It has long been conjectured that on ℤ 2 this model has a critical value λ c ≈ 3.796 with the property that if λ < λ c then it exhibits uniqueness of phase, while if λ > λ c then there is phase coexistence. Much of the work to date on this problem has focused on the regime of uniqueness, with the state of the art being recent work of Sinclair, Srivastava, Štefankovič and Yin showing that there is a unique Gibbs measure for all λ < 2.538. Here we explore the other direction and prove that there are multiple Gibbs measures for all λ > 5.3506. We also show that with the methods we are using we cannot hope to replace 5.3506 with anything below 4.8771. Our proof begins along the lines of the standard Peierls argument, but we add two innovations. First, following ideas of Kotecký and Randall, we construct an event that distinguishes two boundary conditions and always has long contours associated with it, obviating the need to accurately enumerate short contours. Second, we obtain improved bounds on the number of contours by relating them to a new class of self-avoiding walks on an oriented version of ℤ 2 .
UR - http://www.scopus.com/inward/record.url?scp=85047202260&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85047202260&partnerID=8YFLogxK
U2 - 10.1017/S0963548318000238
DO - 10.1017/S0963548318000238
M3 - Article
AN - SCOPUS:85047202260
SN - 0963-5483
VL - 28
SP - 1
EP - 22
JO - Combinatorics Probability and Computing
JF - Combinatorics Probability and Computing
IS - 1
ER -