اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHeight Fluctuations of Random Lozenge Tilings Through Nonintersecting Random Walks
88
0
0.0
(
0
)
تأليف
Jiaoyang Huang
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we study height fluctuations of random lozenge tilings of polygonal domains on the triangular lattice through nonintersecting Bernoulli random walks. For a large class of polygons which have exactly one horizontal upper boundary edge, we show that these random height functions converge to a Gaussian Free Field as predicted by Kenyon and Okounkov [28]. A key ingredient of our proof is a dynamical version of the discrete loop equations as introduced by Borodin, Guionnet and Gorin [5], which might be of independent interest.
قيم البحث
اقرأ أيضاً
We study random walks on the giant component of the ErdH{o}s-Renyi random graph ${cal G}(n,p)$ where $p=lambda/n$ for $lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently by Benjamini, Ko
zma and Wormald, to have order $log^2 n$. We prove that starting from a uniform vertex (equivalently, from a fixed vertex conditioned to belong to the giant) both accelerates mixing to $O(log n)$ and concentrates it (the cutoff phenomenon occurs): the typical mixing is at $( u {bf d})^{-1}log n pm (log n)^{1/2+o(1)}$, where $ u$ and ${bf d}$ are the speed of random walk and dimension of harmonic measure on a ${rm Poisson}(lambda)$-Galton-Watson tree. Analogous results are given for graphs with prescribed degree sequences, where cutoff is shown both for the simple and for the non-backtracking random walk.
We study tilings of the square lattice by linear trimers. For a cylinder of circumference m, we construct a conserved functional of the base of the tilings, and use this to block-diagonalize the transfer matrix. The number of blocks increases exponen
tially with m. The dimension of the ground-state block is shown to grow as (3 / 2^{1/3})^m. We numerically diagonalize this block for m <= 27, obtaining the estimate S = 0.158520 +- 0.000015 for the entropy per site in the thermodynamic limit. We present numerical evidence that the continuum limit of the model has conformal invariance. We measure several scaling dimensions, including those corresponding to defects of dimers and L-shaped trimers. The trimer tilings of a plane admits a two-dimensional height representation. Monte Carlo simulations of the height variables show that the height-height correlations grows logarithmically at large separation, and the orientation-orientation correlations decay as a power law.
We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results allow us t
o prove a conjecture and settle an open problem of Janson (https://doi.org/10.1214/11-PS188), and nearly prove another conjecture and settle another open problem from the same work (up to a polylogarithmic factor). The key tool for our work is an equivalence in law between the degrees along the path to a random node in a random tree with given degree statistics, and a random truncation of a size-biased ordering of the degrees of such a tree. We also exploit a Poissonization trick introduced by Camarri and Pitman (https://doi.org/10.1214/EJP.v5-58) in the context of inhomogeneous continuum random trees, which we adapt to the setting of random trees with fixed degrees. Finally, we propose and justify a change to the conventions of branching process nomenclature: the name Galton-Watson trees should be permanently retired by the community, and replaced with the name Bienayme trees.
In this paper we study uniformly random lozenge tilings of strip domains. Under the assumption that the limiting arctic boundary has at most one cusp, we prove a nearly optimal concentration estimate for the tiling height functions and arctic boundar
ies on such domains: with overwhelming probability the tiling height function is within $n^delta$ of its limit shape, and the tiling arctic boundary is within $n^{1/3+delta}$ to its limit shape, for arbitrarily small $delta>0$. This concentration result will be used in [AH21] to prove that the edge statistics of simply-connected polygonal domains, subject to a technical assumption on their limit shape, converge to the Airy line ensemble.
Consider a system of coalescing random walks where each individual performs random walk over a finite graph G, or (more generally) evolves according to some reversible Markov chain generator Q. Let C be the first time at which all walkers have coales
ced into a single cluster. C is closely related to the consensus time of the voter model for this G or Q. We prove that the expected value of C is at most a constant multiple of the largest hitting time of an element in the state space. This solves a problem posed by Aldous and Fill and gives sharp bounds in many examples, including all vertex-transitive graphs. We also obtain results on the expected time until only k>1 clusters remain. Our proof tools include a new exponential inequality for the meeting time of a reversible Markov chain and a deterministic trajectory, which we believe to be of independent interest.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
