Search arXivSearch

arXiv · 1101.4190

Mixing times of monotone surfaces and SOS interfaces: a mean curvature approach

Abstract

We consider stochastic spin-flip dynamics for: (i) monotone discrete surfaces in Z^3 with planar boundary height and (ii) the one-dimensional discrete Solid-on-Solid (SOS) model confined to a box. In both cases we show almost optimal bounds O(L^2polylog(L)) for the mixing time of the chain, where L is the natural size of the system. The dynamics at a macroscopic scale should be described by a deterministic mean curvature motion such that each point of the surface feels a drift which tends to minimize the local surface tension. Inspired by this heuristics, our approach consists in bounding the dynamics with an auxiliary one which, with very high probability, follows quite closely the deterministic mean curvature evolution. Key technical ingredients are monotonicity, coupling and an argument due to D.B. Wilson in the framework of lozenge tiling Markov Chains. Our approach works equally well for both models despite the fact that their equilibrium maximal height fluctuations occur on very different scales (logarithmic for monotone surfaces and L^{1/2} for the SOS model). Finally, combining techniques from kinetically constrained spin systems together with the above mixing time result, we prove an almost diffusive lower bound of order 1/L^2 up to logarithmic corrections for the spectral gap of the SOS model with horizontal size L and unbounded heights.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pietro Caputo, Fabio Martinelli, Fabio Lucio Toninelli. 2011-01-21. Mixing times of monotone surfaces and SOS interfaces: a mean curvature approach. https://doi.org/10.1007/s00220-012-1425-z

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR