SearcharxivSearch

arXiv · 2309.08470

Crossing estimates for the Ising model on general s-embeddings

Abstract

We prove Russo-Seymour-Welsh type crossing estimates for the FK-Ising model on general s-embeddings whose origami map has an asymptotic Lipschitz constant strictly smaller than $1$, provided a mild non-degeneracy assumption is satisfied. This result extends the original work of Chelkak and provides a general framework to prove that connection probabilities between boundaries of boxes remain bounded away from $0$ and $1$. It is explained that one cannot prove similar estimates without a similar assumption on the origami map, and allows to propose some notion of critical model for generic planar graphs, that can be rephrased from the perspective of the associated propagator operator. This paper reproves along the way corresponding results in almost all already known setups and also treats new ones of interest.

Explore related subjects

Keep this discovery

BibTeXRIS

Rémy Mahfouf. 2023-09-15. Crossing estimates for the Ising model on general s-embeddings. https://arxiv.org/abs/2309.08470

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