Search arXivSearch

arXiv · 1611.04912

Metastability on the hierarchical lattice

Abstract

We study metastability for Glauber spin-flip dynamics on the $N$-dimensional hierarchical lattice with $n$ hierarchical levels. Each vertex carries an Ising spin that can take the values $-1$ or $+1$. Spins interact with an external magnetic field $h>0$. Pairs of spins interact with each other according to a ferromagnetic pair potential $\vec{J}=\{J_i\}_{i=1}^n$, where $J_i>0$ is the strength of the interaction between spins at hierarchical distance $i$. Spins flip according to a Metropolis dynamics at inverse temperature $β$. In the limit as $β\to\infty$, we analyse the crossover time from the metastable state $\boxminus$ (all spins $-1$) to the stable state $\boxplus$ (all spins $+1$). Under the assumption that $\vec{J}$ is non-increasing, we identify the mean transition time up to a multiplicative factor $1+o_β(1)$. On the scale of its mean, the transition time is exponentially distributed. We also identify the set of configurations representing the gate for the transition. For the special case where $J_i = \tilde{J}/N^i$, $1 \leq i \leq n$, with $\tilde{J}>0$ the relevant formulas simplify considerably. Also the hierarchical mean-field limit $N\to\infty$ can be analysed in detail.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frank den Hollander, Oliver Jovanovski. 2016-11-15. Metastability on the hierarchical lattice. https://doi.org/10.1088/1751-8121%2Faa783c

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