SearcharxivSearch

arXiv · 1611.01115

Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$

Abstract

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 $\lambda$, and an independent set $I$ arises with probability proportional to $\lambda^{|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 ${\mathbb Z}^2$ this model has a critical value $\lambda_c \approx 3.796$ with the property that if $\lambda < \lambda_c$ then it exhibits uniqueness of phase, while if $\lambda > \lambda_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, \v{S}tefankovi\v{c} and Yin showing that there is a unique Gibbs measure for all $\lambda < 2.538$. Here we give the first non-trivial result in the other direction, showing that there are multiple Gibbs measures for all $\lambda > 5.3506$. There is some potential for lowering this bound, but with the methods we are using we cannot hope to replace $5.3506$ with anything below about $4.8771$. Our proof begins along the lines of the standard Peierls argument, but we add two innovations. First, following ideas of Koteck\'y 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 ${\mathbb Z}^2$.

Explore related subjects

Keep this discovery

BibTeXRIS

Antonio Blanca, Yuxuan Chen, David Galvin, Dana Randall, Prasad Tetali. 2016-11-03. Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$. https://arxiv.org/abs/1611.01115

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR