SearcharxivSearch

arXiv · 2306.01178

Pearcey universality at cusps of polygonal lozenge tiling

Abstract

We study uniformly random lozenge tilings of general simply connected polygons. Under a technical assumption that is presumably generic with respect to polygon shapes, we show that the local statistics around a cusp point of the arctic curve converge to the Pearcey process. This verifies the widely predicted universality of edge statistics in the cusp case. Together with the smooth and tangent cases proved in Aggarwal-Huang and Aggarwal-Gorin, these are believed to be the three types of edge statistics that can arise in a generic polygon. Our proof is via a local coupling of the random tiling with non-intersecting Bernoulli random walks (NBRW). To leverage this coupling, we establish an optimal concentration estimate for the tiling height function around the cusp. As another step and also a result of potential independent interest, we show that the local statistics of NBRW around a cusp converge to the Pearcey process when the initial configuration consists of two parts with proper density growth, via careful asymptotic analysis of the determinantal formula.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiaoyang Huang, Fan Yang, Lingfu Zhang. 2023-06-01. Pearcey universality at cusps of polygonal lozenge tiling. https://doi.org/10.1002/cpa.22202

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