SearcharxivSearch

arXiv · 2509.08928

The near critical random bond ising model via embedding deformation

Abstract

Using the formalism of differential equations, we introduce a new method to continuously deform the $s$-embeddings associated with a family of Ising models as their coupling constants vary. This provides a geometric interpretation of the critical scaling window $\asymp n^{-1}$ for the model on the $n \times n$ box. We then drive this deterministic deformation process by i.i.d.\ Brownian motions on each edge, centered at the critical model, thereby generating random $s$-embeddings as solutions to stochastic differential equations attached to near-critical random bond Ising models. In this setting, with high probability with respect to the random environment, the Ising model remains conformally invariant in the scaling limit, even when the standard deviation of the random variables (up to logarithmic corrections) is $n^{-\frac{1}{3}} \gg n^{-1}$, far exceeding the deterministic critical window. We also construct an Ising model with slightly correlated (in space) random coupling constants, whose critical window is $ \asymp \log(n)^{-1}$ on the $n \times n$ box. Our method, which can also be applied to the dimer context, naturally extends to a much broader class of graphs and opens a new approach to understanding the critical Ising model in random environments.

Explore related subjects

Keep this discovery

BibTeXRIS

Remy Mahfouf. 2025-09-10. The near critical random bond ising model via embedding deformation. https://arxiv.org/abs/2509.08928

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