Search arXiv⌕ Search

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-08-15. 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

Distribution-uniform strong laws of large numbers

We revisit the question of whether the strong law of large numbers (SLLN) holds uniformly in a rich family of distributions, culminating in a distribution-uniform generalization of the Marcinkiewicz-Zygmund SLLN. These results can be viewed as extensions of Chung's distribution-uniform SLLN to random variables with uniformly integrable $q^\text{th}$ absolute central moments for $0 < q < 2$. Furthermore, we show that uniform integrability of the $q^\text{th}$ moment is both sufficient and necessary for the SLLN to hold uniformly at the Marcinkiewicz-Zygmund rate of $n^{1/q - 1}$. These proofs centrally rely on novel distribution-uniform analogues of some familiar almost sure convergence results including the Khintchine-Kolmogorov convergence theorem, Kolmogorov's three-series theorem, a stochastic generalization of Kronecker's lemma, and the Borel-Cantelli lemmas. We also consider the non-identically distributed case.

math.PR↗

Malliavin Calculus for rough stochastic differential equations

In this work we show that rough stochastic differential equations (RSDEs), as introduced by Friz, Hocquet, and Lê (2021), are Malliavin differentiable. We use this to prove existence of a density when the diffusion coefficients satisfies standard ellipticity assumptions. Moreover, when the coefficients are smooth and the diffusion coefficients satisfies a Hörmander condition, the density is shown to be smooth. The key ingredient is to develop a comprehensive theory of linear rough stochastic differential equations, which could be of independent interest.

math.PR↗

Nonasymptotic and distribution-uniform Komlós-Major-Tusnády approximation

We present nonasymptotic concentration inequalities for sums of independent and identically distributed random variables that yield asymptotic strong Gaussian approximations of Komlós, Major, and Tusnády (KMT) [1975,1976]. The constants appearing in our inequalities are either universal or explicit, and thus as corollaries, they imply distribution-uniform generalizations of the aforementioned KMT approximations. In particular, it is shown that uniform integrability of a random variable's $q^{\text{th}}$ moment is both necessary and sufficient for the KMT approximations to hold uniformly at the rate of $o(n^{1/q})$ for $q > 2$ and that having a uniformly lower bounded Sakhanenko parameter -- equivalently, a uniformly upper-bounded Bernstein parameter -- is both necessary and sufficient for the KMT approximations to hold uniformly at the rate of $O(\log n)$. Instantiating these uniform results for a single probability space yields the analogous results of KMT exactly.

math.PR↗