SearcharxivSearch

arXiv · 1507.04109

The 1-2 model

Abstract

The current paper is a short review of rigorous results for the 1-2 model. The 1-2 model on the hexagonal lattice is a model of statistical mechanics in which each vertex is constrained to have degree either 1 or 2. It was proposed in a study by Schwartz and Bruck of constrained coding systems, and is strongly connected to the dimer model on a decoration of the lattice, and to an enhanced Ising model and an associated polygon model on the graph derived from the hexagonal lattice by adding a further vertex in the middle of each edge. The general 1-2 model possesses three parameters $a$, $b$, $c$. The fundamental technique is to represent probabilities of interest as ratios of counts of dimer coverings of certain associated graphs, and to apply the Pfaffian method of Kasteleyn, Fisher, and Temperley. Of special interest is the existence (or not) of phase transitions. It turns out that all clusters of the infinite-volume limit are almost surely finite. On the other hand, the existence (with strictly positive probability) of infinite `homogeneous' clusters, containing vertices of given type, depends on the values of the parameters. A further type of phase transition emerges in the study of the two-edge correlation function, and in this case the critical surface may be found explicitly. For instance, when $a \ge b \ge c > 0$, the surface given by $\sqrt a = \sqrt b + \sqrt c$ is critical.

Explore related subjects

Keep this discovery

BibTeXRIS

Geoffrey R. Grimmett, Zhongyang Li. 2015-07-15. The 1-2 model. https://arxiv.org/abs/1507.04109

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