The domino shuffling algorithm and Anisotropic KPZ stochastic growth
Sunil Chhita, Fabio Lucio Toninelli

TL;DR
This paper demonstrates that the domino shuffling algorithm models a stochastic growth process in the anisotropic KPZ class, revealing properties of growth speed, fluctuations, and discontinuities at specific slopes, using geometric and probabilistic methods.
Contribution
It establishes the anisotropic KPZ classification for the domino shuffling growth model and analyzes the discontinuities and fluctuation behavior without explicit formulas.
Findings
Growth speed depends on slope and weights, belonging to the anisotropic KPZ class.
Height fluctuations grow at most logarithmically in time.
Discontinuities in growth speed occur at finitely many smooth slopes.
Abstract
The domino-shuffling algorithm can be seen as a stochastic process describing the irreversible growth of a -dimensional discrete interface. Its stationary speed of growth depends on the average interface slope , as well as on the edge weights , that are assumed to be periodic in space. We show that this growth model belongs to the Anisotropic KPZ class: one has and the height fluctuations grow at most logarithmically in time. Moreover, we prove that 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 periodic weights, analogous results have been recently proven in Chhita-Toninelli (2018) via an explicit computation of . In the general…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTheoretical and Computational Physics · Stochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods
The domino shuffling algorithm and Anisotropic KPZ stochastic growth
Sunil Chhita
Department of Mathematical Sciences, Durham University, Stockton Road, Durham, DH1 3LE, UK.
and
Fabio Lucio Toninelli
Technische Universität Wien, Institut für Stochastik und Wirtschaftsmathematik, Wiedner Hauptstraße 8-10/105-7, A-1040 Wien, Austria
Abstract.
The domino-shuffling algorithm [13, 30] can be seen as a stochastic process describing the irreversible growth of a -dimensional discrete interface [8, 36]. Its stationary speed of growth depends on the average interface slope , as well as on the edge weights , that are assumed to be periodic in space. We show that this growth model belongs to the Anisotropic KPZ class [35, 33]: one has and the height fluctuations grow at most logarithmically in time. Moreover, we prove that 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 periodic weights, analogous results have been recently proven [8] via an explicit computation of . 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.
1. Introduction
In the realm of stochastic interface growth [2], dimension (i.e., growth of a two-dimensional interface in three-dimensional physical space) plays a distinguished role. In dimensions, one finds a non-trivial KPZ growth exponent as soon as the growth process is genuinely non-linear, while in dimension a phase transition is expected [18] between a regime of small non-linearity, where the process behaves qualitatively like the stochastic heat equation (SHE) with additive noise, and a regime of large non-linearity, characterized by new growth and roughness critical exponents. See the recent [25, 12, 11] for mathematical progress on the small non-linearity regime of the KPZ equation for . On the other hand, dimension is the “critical” or “marginal” case: here, the critical exponents are expected to depend not so much on the intensity of the non-linearity, but rather on its structure. In fact, in this case, the existence of two different universality classes has been conjectured [35, 2] (see [33] for a recent mathematical review). The first, called Anisotropic KPZ (or AKPZ) class, is characterized by logarithmic growth of height fluctuations in space and time, like the two-dimensional SHE with additive noise. The second, called KPZ class tout court, has universal and non-trivial roughness and growth exponents, and respectively (these values are known only numerically, cf. e.g. [32, 17]). Conjecturally, the universality class of a model is determined by the properties of the average speed of growth of the interface height function , where is the macroscopic slope of the initial condition. Namely, a model is expected to belong to the AKPZ class if and only if , where is the Hessian matrix. From the mathematical point of view, the understanding of the AKPZ universality class has remarkably progressed lately but it is still limited to a few special cases (see Section 1.1 for references). For the KPZ class, very interesting recent developments (in a somewhat different direction) concern the weak non-linearity (or weak-disorder) regime [6, 5]: if non-linearity is scaled to zero as , with a noise regularization parameter and provided is smaller than a precisely identified critical value [5], then the KPZ equation scales to the SHE with additive noise. In this regime, the non-trivial exponents do not emerge.
In the present work, we focus on the so-called “domino shuffling algorithm”. This is a discrete-time Markov chain on perfect matchings (or “domino tilings”) of , that was originally devised [13, 30] as a way to exactly sample and to count perfect matchings of certain special two-dimensional domains (Aztec diamonds). When this algorithm is run on the infinite square grid, it can be seen also as a -dimensional growth model, and it is from this point of view that we consider it here. The shuffling algorithm is actually an infinite-dimensional family of growth processes, indexed by the edge weights , that we only assume to be positive and periodic in both lattice directions, with some period . Along the dynamics, the edge weights also evolve (deterministically) in time. In fact, the evolution of edge weights under the shuffling algorithm (or “spider moves”) has a a remarkable interest in itself, as a classical integrable dynamical system [16]. Its trajectories are in general not time-periodic.
For generic edge weights of period , there are special values for the slope (“smooth” or “gaseous” slopes), that correspond to “cusps” of the surface free energy of domino tilings with weights . The slopes at which is smooth are instead referred to as “rough slopes” (the reason for the nomenclature smooth/rough is reminded in Section 2.2). We let (resp. ) denote the set of smooth (resp. rough) slopes.
Our main result is that the domino shuffling algorithm (with general weights ) belongs to the AKPZ class, and that the speed of growth is singular at each of the smooth slopes (see Theorem 2.3 and Section 2.4.1 for more precise statements):
** Main Theorem**** (Informal version).**
For , the speed of growth function is and . On the other hand, the gradient is discontinuous at each of the finitely many slopes . For , the height fluctuations grow logarithmically in space (they scale to a Gaussian Free Field) and at most logarithmically in time. For , the variance of the height fluctuations is uniformly bounded in space and time.
In a special case of -periodic weights () analogous results have been proven recently in [8]. In that case, there is a single smooth slope () and the explicit computation of is doable, though rather involved, via Kasteleyn theory. In the general case we are considering here, computing directly using Kasteleyn theory seems very complicated, and we do not proceed that way. The first key point in the proof of the theorem is a simple relation (cf. (2.16)) between and the limit shape of the dimer model with edge weights in the Aztec diamond. The limit shape is nothing but the solution of the Euler-Lagrange equation [20] associated to the dimer model’s surface tension, with weights and boundary conditions determined by the geometry of the domain. This relation allows to translate analytic properties of into analytic properties of the limit shapes, for which we use results from [1, 31]. In particular, singularities of are in bijection with the facets (flat portions) of that do not touch the boundary of the Aztec diamond or, equivalently, with the holes of the amoeba of the spectral curve [22]. In [8], the discontinuity of at the unique smooth phase was found via the explicit formula, but the connection with the facet of the limit shape was not realized. Another point we wish to emphasize is that, since edge weights change non-periodically with time as , it is a priori not obvious that an asymptotic speed of growth even exists (the connection with the limit shape shows that it does, because the limit shape is actually independent of ).
Let us conclude this section by mentioning a recent article [36], that proves a hydrodynamic limit for the domino shuffling dynamics, in the form of the convergence of the rescaled height profile to the viscosity solution of the non-linear Hamilton-Jacobi PDE . The result of [36] is stated for the case of edge weights with space periodicity , but the same proof presumably works for general periodic edge weights, as in the framework of the present article.
1.1. Related works on AKPZ growth models
Historically, the first rigorous result we are aware of, on a -dimensional growth model in the AKPZ class, is [29], that computed the speed of growth of the Gates-Westcott model [15], verified that and proved that stationary states are only logarithmically rough, in agreement with the above conjecture (growth of flucutations in time was not studied there). More recently, a growth model that is a -dimensional, discrete, analog of Hammersley’s process has been introduced in [3]. Besides the computation of the speed of growth and the verification of , rigorous results on this model include the proof that height fluctuations grow at most logarithmically in space and time [3, 34], the study of stationary states [34], hydrodynamic limits for the height profile [3, 24], determinantal formulas for certain space-time correlations [3] and a CLT on scale for height flucutations under special initial conditions [3]. Some of these results have been extended to an AKPZ growth process defined in terms of the dimer model on the square grid, see [7].
Apart from the above references, that deal with specific models, let us mention [4], that gives a sufficient condition for a -dimensional growth model to belong to the AKPZ class. In simple terms, [4, Th. 2.1] states that if the hydrodynamic equation preserves solutions of the Euler-Lagrange equations associated to some strictly convex surface tension function , then . This condition can be verified on several growth models, e.g. the one defined in [3], and it is related to the fact that these stochastic processes preserve a certain “local Gibbs property” ( is then the surface tension corresponding with such Gibbs potential).
The rest of the paper is organized as follows. In Section 2, we introduce the dimer model on for general weights, give some dimer model theory and give a precise version of our theorem. In Section 3, we prove the existence of the speed and its formula, while the main properties of the speed are proven in Section 4.
2. Model and results
In this section, we introduce the shuffling algorithm for the dimer model on for general weights, some of the basic dimer model theory and we precisely formulate our results.
2.1. Shuffling algorithm for the dimer model on (general weights)
The vertices of the graph are colored black and white in a bipartite way and they are assigned Cartesian coordinates, that is the neighbouring vertices which share a common edge with the vertex are , and . We label a face if its center has coordinates ; see Fig. 1 for an example on a torus graph.
The discrete time index of the Markov chain will be denoted . We will say that a face is even if its bottom-left vertex is white, and odd otherwise. In the dynamics defined below, the colors of the vertices will interchange at each time step and we assume that initially the vertex is white. Therefore, a face with coordinates will be even at time if and odd otherwise.
Given a weighting of the edges, i.e. an assignment of a strictly positive weight to each edge, we first define a deterministic sequence of edge weightings with . To this purpose, note first that the weighting is uniquely defined if we specify the weights of edges on the boundary of every even face. We write then
[TABLE]
where the 4-tuple of positive numbers denotes the edge weights around the face at time , where and are the edges labelled clockwise around the face, with being the topmost horizontal edge on that face. Also for and , set
[TABLE]
The relation between and is, by definition,
[TABLE]
for and ; see Fig. 2.
We are now ready to define the shuffling algorithm. This is a discrete-time Markov chain on , the set of dimer coverings, or perfect matchings, of . That is, each is a subset of edges of , such that each vertex is contained in exactly one of them. Each edge contained in will be said to be “occupied by a dimer”. The chain is not time-homogeneous, since the transition rates depend on the time index , via the edge weights . For , we define a random map through the following four steps, cf. Fig. 3 (only the third one is actually random):
- (Deletion step)
All pairs of parallel dimers of covering two of the four boundary edges of any face that is even (at time ) are removed. 2. (Sliding step)
For every even face (at time ) with only one boundary edge covered by a dimer of , slide this dimer across that face. 3. (Creation step)
For each face that is even at time (call its coordinates), if there are no dimers of covering any of its four boundary edges, add two parallel vertical dimers to the face with probability
[TABLE]
or two parallel horizontal dimers with probability
[TABLE]
(the operations are performed independently for each and ). 4. (Interchange step)
Interchange the white and black colors of vertices of the graph.
It is well known, and easy to check, that if . The swapping of colors at each step, that may seem to be pointless at this stage, will appear more natural in the discussion below of the evolution of the height function.
The maps are independent but not identically distributed, since the edge weights depend on . Iteratively applying these maps and letting
[TABLE]
one obtains the desired Markov chain on .
2.1.1. Height function and its evolution
Each dimer configuration is in one-to-one correspondence (up to a height offset) with a height function which is defined on the faces of [19]. That is, one fixes the height to be zero at some reference face and one defines the height gradients as
[TABLE]
where the sum runs over the edges crossed by a nearest-neighbor path from to , is the indicator that is occupied by a dimer and or according to whether is crossed with the white vertex on the right or left. The r.h.s. of (2.2) is well-known to be independent of the choice of .
In order for the shuffling algorithm to define a Markovian evolution of the height profile, we have to complement the definition of the maps with a prescription of how the height offset evolves as time increases. The convention that we adopt here is slightly different from that of [36, 8]. We start with the following observation, which is immediately verified from the definition of and of the height function (recall that vertex colors are swapped at each step). Let be any two faces that are odd at time , i.e. they have coordinates and respectively, with and ; then,
[TABLE]
Therefore, we make the following choice:
Definition 2.1**.**
If is an odd face at time , then
[TABLE]
This convention fixes unambiguously the whole height function of and in particular the value of for even faces . Namely, let be any face and let (resp. ) be the restriction of the dimer configuration (resp. ) to the four boundary edges of . Then, one may check by direct inspection starting from the definition of that, if is even at time , then
[TABLE]
where (denoting the four boundary edges of , labeled clockwise from the top one),
[TABLE]
and
[TABLE]
see Fig. 4.
2.2. Periodic weights
In this section, we introduce briefly some of the main aspects of the dimer model machinery needed for the formulation of the main result. Since we are interested in stochastic growth in a translationally invariant situation, here we specialize to the case where the edge weights are periodic in both directions of space. Let the fundamental domain of size , consist of the vertices , half of which are black and half white. For , the vertices are identified with the vertices but are on the fundamental domain (obtained from via a horizontal translation by ), while for , the vertices are identified with the vertices but on the fundamental domain . The edge weights are chosen on all edges on and its boundary edges and then extented by periodicity to the whole graph. Call this weighting .
Underlying the dimer model theory is the characteristic polynomial . To define , consider embedded on a torus as above and let denote the weight of the edge for two vertices and of . Given , define to be the Kasteleyn matrix with rows indexed by white vertices and columns indexed by black vertices of , with
[TABLE]
where is a white vertex and is black vertex in , and
[TABLE]
and
[TABLE]
for . The Laurent polynomial is called “characteristic polynomial” [21]. Of course, depends on and on the weights.
From [21], the Newton Polygon (depending on ) is defined to be
[TABLE]
One can check, for the specified above, that is the (closed) square with vertices .
A probability measure on is said to be an ergodic Gibbs measure (corresponding to the edge weights ) if:
- •
it is invariant and ergodic with respect to horizontal/vertical translations by multiples of ;
- •
it satisfies the following Dobrushin-Lanford-Ruelle (DLR) property. Given any finite subset of edges and any dimer configuration , let be the (finite) set of dimer configurations that coincide with outside . Then, conditionally on outside , the -probability of a configuration is proportional to the product
[TABLE]
of -weights of the edges in occupied by dimers.
Thanks to translation invariance, one may associate to each ergodic Gibbs measure an average slope . Here, (resp. ) is the expected height difference between a face in and its translate in (resp. ). The slope is contained in the Newton polygon . Moreover, provided that belongs , the interior of , there exists a unique Gibbs measure with slope [21] and we denote it by . This measure is known to be determinantal, in the sense that the probability that given edges belong to is given by the determinant of an matrix, whose entries are elements of the so-called inverse Kasteleyn matrix.
Define the Ronkin function associated to as
[TABLE]
for . From [21], is the Legendre transform of the so-called surface tension of the dimer model with the given periodic weights, i.e.
[TABLE]
We will recall later the relation between and the “limit shapes” of the dimer model.
We write , the interior of the Newton polygon, as the disjoint union of (rough region) and (smooth region), whose definition we recall now. (Rough (resp. smooth) phases are called “liquid” (resp. “gaseous”) phases in [21].) From [21], it is known that if , two cases can occur:
- •
either the measure is rough, meaning that height fluctuations of grow logarithmically w.r.t. the distance between the faces . More precisely,
[TABLE]
as the distance between and diverges. Moreover, the scaling limit of the height profile is a Gaussian Free Field [19]. We call the set of such “rough slopes”;
- •
or the measure is smooth, meaning that height flucutations of have uniformly bounded variance. In this case, has a cone singularity (i.e. is discontinuous) at this value of . The set of “smooth slopes” is denoted .
In both cases, is strictly convex.
From [21], it is further known that is a finite set and moreover
[TABLE]
for generic edge weights , actually coincides with the whole , which contains points. However, this may fail for particular choices of weights: for instance, when all edge-weights are equal, then it is known that .
2.2.1. Shuffling algorithm with periodic weights
A remarkable feature of the shuffling algorithm is the following (see for instance [8, Proposition 3.1] and [36, Prop. 2.2]):
Proposition 2.2**.**
If the initial condition at time [math] is drawn from (i.e., ), then at time one has .
If we had not swapped vertex colors at each step, the slope would swap to at each step. There are two observations that we will need going forward. The first one is that the characteristic polynomial only changes by a multiplicative constant factor when the weights are replaced by [16] In particular, in view of (2.7) and (2.8), this implies that the surface tension for weights equals that for weights , up to an additive constant. Another consequence is the following: since the rough or smooth nature of depends on only through the zeros of the characteristic polynomial on the torus [21], we deduce that is rough (resp. smooth) iff is. In other words, the condition does not depend on .
Another important observation is the following: even though weights (and therefore ) are periodic in space, the sequence is in general not periodic w.r.t. the time index . Time-periodicity can, however, hold for special choices of and indeed the cases studied in [8, 36] are time-periodic.
2.3. The Aztec diamond
The Aztec diamond of size is the subset of the graph whose vertices have Cartesian coordinates satisfying the condition . We let denote the set of edges outgoing from , the set of faces not in but neighboring and the set of internal faces of .
Let be the probability measure on , the set of perfect matchings of , where the weight of a configuration is proportional to the product of the -weights of edges occupied by dimers. Since all vertices of are matched among themselves, all edges in are empty and therefore the height difference between two faces in is independent of the choice of . We assume that the coloring of the vertices is such that the vertex of coordinates is white. We fix the height offset as in Fig. 5, by setting the height to on the leftmost face of ; then, the boundary height ranges from to .
The height function in satisfies a limit shape phenomenon (or law of large numbers) as . Namely, rescale the lattice mesh by and call the rescaled Aztec diamond (and correspondingly denote the analog of ). The union of the faces of tends to the square
[TABLE]
Define the rescaled height function as
[TABLE]
with the face of that corresponds to before rescaling. Thanks to the factor in the rescaling, is a Lipschitz function whose gradient is contained in the Newton polygon . Note that, if is a face in whose center tends to as , then
[TABLE]
The limit shape theorem (cf. [9] for the model with uniform weights and [23] for the general periodic case) states that there exists a Lipschitz function that coincides with on , such that for every ,
[TABLE]
Here, with some abuse of notation, means computed at the center of the face . The “limit shape” is characterized by being the unique minimizer of the surface tension functional
[TABLE]
among Lipschitz functions that equal on the boundary. While the boundary condition does not depend on , the limit shape does (through the surface tension), but because, as we already mentioned, changes only by an additive constant when is changed into .
2.4. Statement of Main theorem
Our main result concerns the average speed of growth for the Markov process in the infinite graph, started from . By definition, this is given by the limit (provided it exists)
[TABLE]
with any face of and the law of the process started from the probability measure . Note that every second term in the sum is zero because every second time the face is odd.
Since with , each non-zero term in the sum could in principle be computed via (2.4) and Kasteleyn theory, using the determinantal structure of the measure . Following this route, however, it is not clear how to get any manageable expression or to prove that the limit in (2.14) even exists. One reason is that, for generic periodic weights, it is hard to invert the infinite-volume Kasteleyn matrix explicitly. Fortunately, an alternative way exists, that leads to:
Theorem 2.3**.**
For every and positive periodic weighting , there exists such that, for any face ,
[TABLE]
The speed is determined as follows: let be the limit shape for the dimer model in the Aztec diamond with weights and let (the interior of the unit square in (2.11)) be a point such that . Then
[TABLE]
On the rough region , is and . On the other hand, is discontinuous at every .
A few comments are in order:
- •
the existence of is part of the statement. Uniqueness in general fails (the limit shape may have “facets”, i.e. open regions where it is affine) but for , the point is unique (see Section 4).
- •
Using smoothness of on and (2.16), one sees that
[TABLE]
Note that the r.h.s. of (2.16) looks like (minus) the Legendre transform of , except that there is no infimum over and in fact neither nor have any definite convexity.
- •
It was observed in [20] that the Euler-Lagrange equation satisfied by the limit shape of dimer models can be written (in the “rough region” where the limit shape is ) in terms of a first-order PDE (“complex Burgers equation”) for a complex pair related by the relations and . Locally, these relations give a bijection between and . Then, using [4, Sec. 3], the above Theorem 2.3 can be complemented by the following statement:
[TABLE]
- •
For a special case of two-periodic weights (), it was found via explicit computation in [8, Th. 3.11] that the behavior of near the unique gas slope is of the type
[TABLE]
The absence of the term can be given an interesting interpretation. In fact, this is a simple consequence of formula (2.16) plus the fact that, if approaches a point on the boundary of the “facet” where , then generically vanishes as [20] (this behavior is referred to as “Pokrovsky-Talapov law” [28]).
2.4.1. Fluctuations
One can further prove that height fluctuations grow slowly (at most logarithmically) in time, as is typical for growth models in the AKPZ universality class. In fact, one has uniformly in
[TABLE]
for some constant , where if and if . The proof of this fact works the same as in [8] so we will not add details (the speed of convergence was not explicitly stated in [8], but it can be immediately extracted from the proof). Note in particular that
[TABLE]
and since the r.h.s. is summable in , one can upgrade (2.15) to the almost-sure convergence, with respect to the joint law of the initial condition and of the process,
[TABLE]
3. Identification of the speed of growth
In this section, we prove existence of the speed and formula (2.16).
3.1. General properties of the dynamics
We need two general facts: the dynamics is monotone (it preserves stochastic ordering among height profiles) and it is local (information travels at most ballistically through the system).
Let us start with monotonicity. Given two dimer configurations , we say that if for every face . Given two initial configurations , we can couple the two Markov chains in the following way (global monotone coupling): for any face , if in both configurations , then in the “creation step” of the shuffling map we choose the same randomness to decide whether we add two vertical or two horizontal dimers around . Then, the following statement holds (it implies the preservation of stochastic order mentioned above): if , then the same holds at all later times [36, Lemma 2.4].
As far as locality is concerned the point is that, by the definition of the shuffling algorithm, the value of is completely determined by the height at time at the face and at its four neighbors (this determines the dimer configuration on ), plus the randomness used to create parallel dimers at , if the face is even and . From this, it is immediate to deduce the following:
Proposition 3.1**.**
Let be two dimer configurations whose height coincides on all faces at -distance up to from a given face . Couple the Markov chains started from via the global monotone coupling. Then, for every .
Let us also describe in some more detail how the shuffling algorithm works on the Aztec diamond (this is the framework where the algorithm was originally introduced [13, 30]). In a step of the algorithm, a dimer configuration on is mapped to a configuration on the larger domain . Suppose that we have , i.e. a dimer configuration on the diamond of size . We can also view as a subset of edges of (but not a perfect matching, since the boundary vertices are necessarily unmatched). To construct , apply the map in to (with weights as above). Note that the faces in that are closest to the boundary, i.e. the faces in , are even. It is well known that the resulting dimer configuration is a perfect matching of . Due to the swapping of colors, at the next step the faces in are again even and the procedure goes on.
The analog of Proposition 2.2 in the Aztec diamond is the well known fact that, if we start at time zero with a configuration on such that for certain periodic weights , then at time one has .
There is an important point to be discussed: when we introduced the shuffling algorithm on the infinite lattice, we fixed the evolution of the height offset via Definition 2.1. On the other hand, on the Aztec diamond the height offset is fixed by the requirement that the left-most face in has height . These two conventions must be compatible, i.e., if we adopt the convention (2.4) for the evolution of the height function, then the height on the left-most face of must be deterministically. This is easily seen inductively in , as explained in the caption of Fig. 6.
3.2. The speed of growth
Here we prove the following:
Proposition 3.2**.**
Let and assume that there exists in the interior of , such that is in a neighborhood of and . Then, the limit in (2.15) exists and (2.16) holds.
The existence of for every in the interior of the Newton polygon will be proved in the next section.
Proof.
For an integer , let be a face of whose center is at minimal distance from . One should think of as being a large multiple of , the time in (2.15), with that will be sent to zero at the end. For later convenience, we let be the square box of side centered at the face . Recall that denotes the Aztec diamond and take the edge weights to be given by . We run the shuffling dynamics in the Aztec diamond, starting at time zero with the domain and with an initial condition sampled from . We denote the configuration at time , where the tilda is used just to distinguish this from the evolution in the infinite graph. The height function of is concentrated at the limit shape . In particular, from (2.13) with we have
[TABLE]
As before, we identify with some abuse of notation a face with the point at its center. As observed in Section 3.1, at time , the configuration has law and we still have (3.1) with replaced by . Altogether, we see that
[TABLE]
where we used that and the error term vanishes as , since the limit shape is around . We also used the fact that are uniformly bounded for , to deduce from (3.1) a statement about their average.
Our goal now is to prove a statement analogous to (LABEL:eq:perA) for the dynamics on the infinite graph. By Proposition 3.1, the evolution of is not influenced by the height function of outside . Recall that is sampled from the infinite-volume measure . Under this probability measure, the height function is essentially linear, with slope and sub-linear fluctuations. More precisely,
[TABLE]
where once more we have identified a face with its center and the factor is there because is the average height change per fundamental domain. To get (3.3), observe first that
[TABLE]
uniformly in (the error term is there because is not necessarily an exact translation of in a different fundamental domain). Also, recall that the fourth centered moment of under grows at most like for large (see [21, Section 4] for a bound on the variance; higher moments are treated analogously). Then, a union bound over and an application of Chebyshev’s inequality leads to (3.3).
Note that we have not yet specified the height offset at time zero. We will fix it in such a way that, with high probability (w.h.p.) as ,
[TABLE]
For this, note that (3.3) implies that w.h.p.
[TABLE]
while (3.1) and continuity of the limit shape implies that w.h.p.
[TABLE]
with . Then, (3.4) holds provided we choose
[TABLE]
By monotonicity of the dynamics and Proposition 3.1 we see that and therefore, w.h.p.,
[TABLE]
where we used (3.1) in the last step and . Note that is deterministically bounded by , so we can turn the statement w.h.p. into a statement in average and obtain that
[TABLE]
where we used also (LABEL:eq:perA). Note that the face depends on the time . However, since the measure is invariant by translations of multiples of and the height function has bounded Lipschitz constant, we have (3.9) also for any fixed face . Finally, we let .
A lower bound is proven in the very same way and altogether the statements (2.15) and (2.16) follow. ∎
With similar arguments, we also obtain the following result, that will be useful later:
Proposition 3.3**.**
If there exists in the interior of such that is in a neighborhood of and with at one of the four corners of the Newton polygon (i.e., or ) then
[TABLE]
Proof.
Assume to fix ideas that . As above, let be the face of closest to , let and be the square of side centered around . One has, in analogy with (LABEL:eq:perA) and with the same argument,
[TABLE]
On the other hand, let be the collection of faces in (there are approximately of them). Write , where contains the faces that are even at time and all the others. Because of (2.13) and the fact that in an -neighborhood of , from the definition of height function we see that, with probability , a proportion of the dimers of in occupy a vertical edge with bottom white vertex. The same holds for , because has the same limit shape as . Therefore, a proportion of the faces in have a single vertical dimer of along their boundary. From (2.4) we see that each such even face contributes to the height change from time to . Since , the l.h.s. of (3.11) equals also and (3.10) follows. ∎
3.3. The limit shape
Here we give some analytic properties of the limit shape and prove the existence of :
Theorem 3.4**.**
There exists a non-empty, open subset of the rescaled Aztec diamond (cf. (2.11)) where is and the gradient . For every , there exists such that
[TABLE]
Proof of Theorem 3.4.
For , let
[TABLE]
and note that (resp. ) is the mimimal (resp. maximal) Lipschitz function with gradient in that equals on We let
[TABLE]
It is easy to see the following (the proof is given below):
Lemma 3.5**.**
The set is non-empty.
We need some regularity properties of the limit shape , and for this we appeal to [31, 1]. Let us compactify the Newton polygon by introducing a continuous map (the two-dimensional sphere) in such a way that is mapped to a point of while is a homeomorphism between and . Then one has:
Proposition 3.6**.**
[31*, Th. 4.1 and Th. 1.3]**
The map is continuous in the interior of . Moreover, is in .*
Define further the open set
[TABLE]
that is the one appearing in the statement of Theorem 3.4. Decompose as the union of the open set
[TABLE]
and the closed set
[TABLE]
Proposition 3.7**.**
The set is non-empty.
Let us assume for the moment Proposition 3.7 (the proof is given below) and let us proceed with the proof of Theorem 3.4. In general, consists of a collection of disjoint, simply connected sets (these were called “bubbles” in [20]); on each bubble, the gradient is constant and belongs to one of the finitely many slopes in . It is also known [26] that, on , the limit shape is not just but actually , since the surface tension is for . Therefore, in particular, the map is a map from to . The next step requires the following:
Theorem 3.8**.**
[1*]**
The map is a proper map111 Properness does not hold for general domains and boundary values . Theorem 3.8 holds for the Aztec diamond because in this case is a convex polygonal domain with sides perpendicular to the sides of the Newton polygon, and in (2.12) is a “natural boundary value” for . The notion of “natural boundary value” is defined in [1] and it requires in particular that, if the side of is perpendicular to the side of the Newton polygon with two of its adjacent corners, then the derivative of along equals with the tangent vector to along . from to (i.e. the pre-image of every compact subset of is compact). *
Let us prove that the Jacobian of the map is everywhere non-positive on and not identically zero. The Jacobian matrix equals
[TABLE]
On the other hand, on , satisfies the Euler-Lagrange equation
[TABLE]
with the derivative of w.r.t. the arguments , computed at . For , the matrix is strictly positive definite, in particular . From this, we deduce that
[TABLE]
In fact, assume first that . Then, (because ) but on the other hand (3.18) reduces to
[TABLE]
Since both are strictly positive, the only possibility is that . On the other hand, assume (by contradiction) that , so that . Then
[TABLE]
which is a contradiction because the second inequality is strict. Altogether, (3.19) follows. From this, we see that can vanish identically on only if is affine, which is clearly not possible in view of Proposition 3.8.
We have that the map is proper and its Jacobian is non-negative and not identically vanishing. Then, by [27, Th. 1], we deduce that the map is onto: for every , there exists with .
It remains to show the existence of for every . Let be a sequence of slopes in that converges to . Any limit point of is in (because of Proposition 3.8). Due to Proposition 3.6, the slope of at is , so we can set . ∎
We conclude this section by proving the two technical results, Lemma 3.5 and Proposition 3.7 that were stated above.
Proof of Lemma 3.5.
Since for every in the interior of and is continuous, we have just to exclude that or . Assume for instance that ; we are going to exhibit a function , with the right boundary value, such that
[TABLE]
For this purpose, let for small
[TABLE]
It is immediate to see that in
[TABLE]
and in , so in particular equals on . The difference between the r.h.s. and the l.h.s. of (3.23) is then
[TABLE]
Since is strictly convex, one has
[TABLE]
Therefore, using continuity of , for small enough the difference (3.24) is strictly positive and, as a consequence, the minimizer of the surface tension functional cannot coincide with . ∎
Proof of Propoposition 3.7.
We begin by making an observation on the shape of . Recall from (3.12) the definition of and define the (possibly empty) regions
[TABLE]
belongs to the triangle , otherwise would exceed the maximal function ; similar statements hold for . See Fig. 7. Also, it follows from [31, Th. 4.2] that is the graph of a concave function; analogously, for is the graph of a concave function in a reference frame rotated clockwise by and respectively.
Because of the definition of , we see that
[TABLE]
Note that is convex.
Before proving that is non-empty, let us show that is non-empty. Let be the the gradient of (these are also the four corners of ) and the open segment connecting to etc. Remark that if , then cannot coincide with any of the slopes . In fact, thanks to Proposition 3.3, in this case one would have
[TABLE]
which contradicts the fact that . Therefore, we have that
[TABLE]
with
[TABLE]
In general, the region is a proper subset of , see Fig. 8.
Using also the second statement in Proposition 3.6, we conclude that if (by contradiction) is empty, then necessarily must coincide with one of the four sets . To fix ideas, say that , i.e. everywhere in , is a non-trivial convex combination of and . Let be the curve along from point to point , as in Fig. 9, and let be the tangent vector at a point .
From the definition of one has that the directional derivative of in direction equals , with . On the other hand, if is a curve from to that runs slightly inside at distance from , we have that the directional derivative along at a point equals , with , because by assumption. Taking , one easily sees that these two facts are not compatible with being continuous along . This proves that is not empty.
Finally, the fact that follows easily from . In fact, if were empty, then would belong to for every and (because of Proposition 3.6) it would actually take a constant value on . If , this is a contradiction since the affine function with slope cannot match the boundary datum . If on the other hand , then take a sequence of points and a sequence that have the same limit in the interior of . One has while , which contradicts Proposition 3.6. ∎
4. Properties of
We start with the following statement, whose proof is given below:
Proposition 4.1**.**
The function is on .
Remark 4.2**.**
We know that the determinant of the Hessian matrix of is negative or zero on the rough region ; if we knew that the inequality is everywhere strict, continuity of would easily follow from formula (4.2) below and from further derivation w.r.t. . On the other hand, non-vanishing of in the rough region is not a general property of macroscopic shapes of dimer models. For instance, for the dimer model on the honeycomb graph with uniform weights, one can verify from the explicit solution [10] that the macroscopic shape in a hexagonal domain has a Hessian with strictly negative determinant in the whole rough region, except at a single point (the center of the domain), where all entries of the Hessian matrix are zero. To overcome this problem, for the proof of Proposition 4.1 we will not rely directly on analytic properties of the limit shapes, bur rather on the definition (2.14) of the speed and on the properties of the dimer measure under the dynamics of the edge weights (“spider move dynamics”).
From Proposition 4.1 and the formula (2.16) for the speed, we deduce
[TABLE]
By the way, this shows that is unique for in the rough region. This formula also allows to prove that the speed is not at smooth slopes. Indeed, we know from Theorem 3.4 that for every , there exists in the interior of , where the slope of is . Moreover, it is known [1] that, since the boundary condition is “natural” (cf. footnote 1), the set is a closed set with non-empty interior. Letting approach different points of (so that approaches , by continuity of ), we see from (4.1) that does not have a unique limit as .
From (4.1) we see also that, for ,
[TABLE]
where the Jacobian matrix is as in (3.17). We already know that , and the fact that the speed is means that the inequality is strict. In particular,
[TABLE]
as wished.
Proof of Proposition 4.1.
Let be an even face. From (2.14) and (2.4) one has, with ,
[TABLE]
On the other hand, recall from (2.5) and (2.6) that are sums of dimer indicator functions. From the determinantal structure of the measures , one has an explicit expression for the probability that an edge is occupied. Assume that the white endpoint of is in the fundamental domain (that is the translation of by in the horizontal direction and by in the vertical one) and that, modulo this translation, it is equivalent to the white vertex of the fundamental domain . Similarly, assume that the black endpoint is in and that it is equivalent to the black vertex in . Then,
[TABLE]
where equals the -weight of , times the complex unit if the edge is vertical, while
[TABLE]
We recall that is the Kasteleyn matrix of the fundamental domain (recall Section 2.2) and is the value that realizes the supremum in (2.8). For the maximizer is unique and the relation between and , through
[TABLE]
is a diffeomorphism between and (the amoeba of , , defined as the image of the curve in under the map ) [22]. We will prove:
Lemma 4.3**.**
The r.h.s. of (4.6) is a function of .
As a consequence, (4.5) and therefore the sum in (4.4), for every fixed , are functions of . To conclude the proof of the proposition, we will prove:
Lemma 4.4**.**
Let . The derivatives (of any order) of (4.5) w.r.t. can be bounded uniformly w.r.t. the index .
The smoothness claim for then easily follows from (4.4). ∎
Proof of Lemma 4.3.
Assume without loss of generality (by translation invariance) that . Write
[TABLE]
with the characteristic polynomial and (that is also a Laurent polynomial in ) the cofactor of , so that (4.6) reduces to
[TABLE]
The prefactor of the integral is smooth and will be dropped; also, we write for . If as in (4.7) with , it is known that has two distinct simple zeros [21], call them . Write
[TABLE]
where is the first-order Taylor expansion around . The zeros and also are real analytic functions of , and the ratio is not real. Write
[TABLE]
where
[TABLE]
and is a function that equals (resp. [math]) when its argument is smaller than (resp. larger than ), with sufficiently small so that the supports of are disjoint. The integral of
[TABLE]
is w.r.t. . Now look at the integral of . Suppose we want to prove it is w.r.t . Write
[TABLE]
with and . Write
[TABLE]
Since the ratio is not real, the Jacobian of the change of variables is non-singular. One has then
[TABLE]
which is zero by symmetry. Next look at
[TABLE]
where, with some abuse of notation, we write
[TABLE]
The constant prefactor has a (in fact, real analytic) dependence on . Also, is a polynomial with real analytic coefficients and it vanishes at least linearly when tends to zero. Then, it is easy to deduce that (4.18) is a function of . Finally, we look at
[TABLE]
with the same convention as in (4.19). Since is at least quadratic for close to zero, the derivatives of order (w.r.t. the components of ) of the integrand are upper bounded by
[TABLE]
uniformly for in compact sets of the amoeba . The function (4.21) is integrable and the claim of the Lemma easily follows. ∎
Proof of Lemma 4.4.
We have seen that for each choice of , the derivatives of (4.5) w.r.t. are bounded. Now we let and we need to show uniformity of the bounds w.r.t. . It is immediate to see that uniformity follows if all edge weights stay bounded away from [math] and , uniformly in .
Let us recall that the probability measure depends on the edge weights only modulo gauge transformations [19, Sec. 3.2]. That is, if edge weights are changed as , with the edge with black/white endpoints and two non-vanishing functions defined on black/white vertices, then the measure is unchanged. In the () periodic setting with fundamental domain as in the present work, the knowledge of the edge weights modulo gauge is equivalent to the knowledge of:
- (1)
the “face weights”: for each of the faces of the fundamental domain , one lets be the alternate product
[TABLE]
with the four boundary edges of labeled cyclically clocwise, with chosen such that it is clockwise oriented from white to black endpoint. Actually, the product of face weights over all faces gives , so we need to know only of them. 2. (2)
the “magnetic coordinates”, i.e. the alternate product (resp. ) of the weights of the edges belonging to a cycle on with winding number (resp. ).
If the face weights, as well as , are all bounded away from [math] and , then there exists a suitable gauge such that edge weights are also all bounded away from [math] and .
When the weights evolve along the sequence associated to the shuffling algorithm, the magnetic coordinates stay constant [16]. This is related to the fact that the measure is mapped to and the slope is unchanged, recall Proposition 2.2. On the other hand, the face weights do change with : in general they are not periodic in time but only quasi-periodic, they stay in a compact set (that depends on the initial weights ) and they approach neither zero nor infinity. This can be extracted from the classical integrability of the dynamics of the face weights under the spider moves [16] (cf. also [14] and [22, Sec. 3]). More explicitly, the spider move preserves the spectral curve and for positive-real-valued edge weights, the common level set of the Hamiltonians is homeomorphic to a finite cover of the product of the compact ovals of the spectral curve. ∎
Acknowledgements We would like to thank Sanjay Ramassamy for discussions on the Goncharov-Kenyon dynamical system, and Erik Duse for sharing the results of [1] before publication and for discussions on the variational principle. We would also like to thank the referees for their careful reading and constructive comments. F.T. was partially supported by the CNRS PICS grant 151933, by ANR-15-CE40-0020-03 Grant LSD and ANR-18-CE40-0033 Grant DIMERS. S.C acknowledges the support of EPSRC grant EP /T004290/1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] K. Astala, E. Duse, I. Prause, and X. Zhong. Dimer models and conformal structures. ar Xiv preprint ar Xiv:2004.02599 , 2004.
- 2[2] A.L. Barabási and H.E. Stanley. Fractal Concepts in Surface Growth . Cambridge University Press, Cambridge, 1995.
- 3[3] A. Borodin and P.L. Ferrari. Anisotropic Growth of Random Surfaces in 2 + 1 2 1 2+1 Dimensions. Comm. Math. Phys. , 325:603–684, 2014.
- 4[4] Alexei Borodin and Fabio Toninelli. Two-dimensional anisotropic KPZ growth and limit shapes. J. Stat. Mech. Theory Exp. , (8):083205, 17, 2018.
- 5[5] Francesco Caravenna, Rongfeng Sun, and Nikos Zygouras. The two-dimensional KPZ equation in the entire subcritical regime. Ann. Probab. , 48(3):1086–1127, 2020.
- 6[6] Sourav Chatterjee and Alexander Dunlap. Constructing a solution of the ( 2 + 1 ) 2 1 (2+1) -dimensional KPZ equation. Ann. Probab. , 48(2):1014–1055, 2020.
- 7[7] Sunil Chhita, Patrik L. Ferrari, and Fabio L. Toninelli. Speed and fluctuations for some driven dimer models. Ann. Inst. Henri Poincaré D , 6(4):489–532, 2019.
- 8[8] Sunil Chhita and Fabio Lucio Toninelli. A ( 2 + 1 ) 2 1 (2+1) -dimensional anisotropic KPZ growth model with a smooth phase. Comm. Math. Phys. , 367(2):483–516, 2019.
