SearcharxivSearch

arXiv · 1806.06668

Critical Ising model on random triangulations of the disk: enumeration and local limits

Abstract

We consider Boltzmann random triangulations coupled to the Ising model on their faces, under Dobrushin boundary conditions and at the critical point of the model. The first part of this paper computes explicitly the partition function of this model by solving its Tutte's equation, extending a previous result by Bernardi and Bousquet-M\'elou to the model with Dobrushin boundary conditions. We show that the perimeter exponent of the model is 7/3 in contrast to the exponent 5/2 for uniform triangulations. In the second part, we show that the model has a local limit in distribution when the two components of the Dobrushin boundary tend to infinity one after the other. The local limit is constructed explicitly using the peeling process along an Ising interface. Moreover, we show that the main interface in the local limit touches the (infinite) boundary almost surely only finitely many times, a behavior opposite to that of the Bernoulli percolation on uniform maps. Some scaling limits closely related to the perimeters of finite clusters are also obtained.

Explore related subjects

Keep this discovery

BibTeXRIS

Linxiao Chen, Joonas Turunen. 2018-06-18. Critical Ising model on random triangulations of the disk: enumeration and local limits. https://doi.org/10.1007/s00220-019-03672-5

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