SearcharxivSearch

arXiv · 1901.09258

Hard-Core and Soft-Core Widom-Rowlinson models on Cayley trees

Abstract

We consider both Hard-Core and Soft-Core Widom-Rowlinson models with spin values $-1,0,1$ on a Cayley tree of order $k\geq 2$ and we are interested in the Gibbs measures of the models. The models depend on 3 parameters: the order $k$ of the tree, $\theta$ describing the strength of the (ferromagnetic or antiferromagnetic) interaction, and $\lambda$ describing the intensity for particles. The Hard-Core Widom-Rowlinson model corresponds to the case $\theta=0$. For the binary tree $k=2$, and for $k=3$ we prove that the ferromagnetic model has either one or three splitting Gibbs measures (tree-automorphism invariant Gibbs measures (TISGM) which are tree-indexed Markov chains). We also give the exact form of the corresponding critical curves in parameter space. For higher values of $k$ we give an explicit sufficient bound ensuring non-uniqueness which we conjecture to be the exact curve. Moreover, for the antiferromagnetic model we explicitly give two critical curves and prove that on these curves there are exactly two TISGMs; between these curves there are exactly three TISGMs; otherwise there exists a unique TISGM. Also some periodic and non-periodic SGMs are constructed in the ferromagnetic model.

Explore related subjects

Keep this discovery

BibTeXRIS

Sascha Kissel, Christof Kuelske, Utkir A. Rozikov. 2019-01-26. Hard-Core and Soft-Core Widom-Rowlinson models on Cayley trees. https://doi.org/10.1088/1742-5468%2Fab081e

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