The domino shuffling algorithm and Anisotropic KPZ stochastic growth

Abstract

The domino-shuffling algorithm can be seen as a stochastic process describing the irreversible growth of a (2+1)-dimensional discrete interface. Its stationary speed of growth v w() depends on the average interface slope , as well as on the edge weights w, that are assumed to be periodic in space. We show that this growth model belongs to the Anisotropic KPZ class: one has [D2 v w()]<0 and the height fluctuations grow at most logarithmically in time. Moreover, we prove that D v w() is discontinuous at each of the (finitely many) smooth (or "gaseous") slopes ; at these slopes, fluctuations do not diverge as time grows. For a special case of spatially 2-periodic weights, analogous results have been recently proven in Chhita-Toninelli (2018) via an explicit computation of v w(). In the general case, such a computation is out of reach; instead, our proof goes through a relation between the speed of growth and the limit shape of domino tilings of the Aztec diamond.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…