Search arXivSearch

arXiv · 1007.0109

Universality in one-dimensional hierarchical coalescence processes

Abstract

Motivated by several models introduced in the physics literature to study the nonequilibrium coarsening dynamics of one-dimensional systems, we consider a large class of "hierarchical coalescence processes" (HCP). An HCP consists of an infinite sequence of coalescence processes ${ξ^{(n)}(\cdot)}_{n\ge1}$: each process occurs in a different "epoch" (indexed by $n$) and evolves for an infinite time, while the evolution in subsequent epochs are linked in such a way that the initial distribution of $ξ^{(n+1)}$ coincides with the final distribution of $ξ^{(n)}$. Inside each epoch the process, described by a suitable simple point process representing the boundaries between adjacent intervals (domains), evolves as follows. Only intervals whose length belongs to a certain epoch-dependent finite range are active, that is, they can incorporate their left or right neighboring interval with quite general rates. Inactive intervals cannot incorporate their neighbors and can increase their length only if they are incorporated by active neighbors. The activity ranges are such that after a merging step the newly produced interval always becomes inactive for that epoch but active for some future epoch. Without making any mean-field assumption we show that: (i) if the initial distribution describes a renewal process, then such a property is preserved at all later times and all future epochs; (ii) the distribution of certain rescaled variables, for example, the domain length, has a well-defined and universal limiting behavior as $n\to \infty$ independent of the details of the process (merging rates, activity ranges$,...$). This last result explains the universality in the limiting behavior of several very different physical systems (e.g., the East model of glassy dynamics or the Paste-all model) which was observed in several simulations and analyzed in many physics papers. The main idea to obtain the asymptotic result is to first write down a recursive set of nonlinear identities for the Laplace transforms of the relevant quantities on different epochs and then to solve it by means of a transformation which in some sense linearizes the system.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alessandra Faggionato, Fabio Martinelli, Cyril Roberto, Cristina Toninelli. 2012-08-07. Universality in one-dimensional hierarchical coalescence processes. https://doi.org/10.1214/11-aop654

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