Search arXivSearch

arXiv · 1307.0490

The small noise limit of order-based diffusion processes

Abstract

We introduce order-based diffusion processes as the solutions to multidimensional stochastic differential equations, with drift coefficient depending only on the ordering of the coordinates of the process and diffusion matrix proportional to the identity. These processes describe the evolution of a system of Brownian particles moving on the real line with piecewise constant drifts, and are the natural generalization of the rank-based diffusion processes introduced in stochastic portfolio theory or in the probabilistic interpretation of nonlinear evolution equations. Owing to the discontinuity of the drift coefficient, the corresponding ordinary differential equations are ill-posed. Therefore, the small noise limit of order-based diffusion processes is not covered by the classical Freidlin-Wentzell theory. The description of this limit is the purpose of this article. We first give a complete analysis of the two-particle case. Despite its apparent simplicity, the small noise limit of such a system already exhibits various behaviours. In particular, depending on the drift coefficient, the particles can either stick into a cluster, the velocity of which is determined by elementary computations, or drift away from each other at constant velocity, in a random ordering. The persistence of randomness in the zero noise limit is of the very same nature as in the pioneering works by Veretennikov (Mat. Zametki, 1983) and Bafico and Baldi (Stochastics, 1981) concerning the so-called Peano phenomenon. In the case of rank-based processes, we use a simple convexity argument to prove that the small noise limit is described by the sticky particle dynamics introduced by Brenier and Grenier (SIAM J. Numer. Anal., 1998), where particles travel at constant velocity between collisions, at which they stick together. In the general case of order-based processes, we give a sufficient condition on the drift for all the particles to aggregate into a single cluster, and compute the velocity of this cluster. Our argument consists in turning the study of the small noise limit into the study of the long time behaviour of a suitably rescaled process, and then exhibiting a Lyapunov functional for this rescaled process.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Jourdain, Julien Reygner. 2014-03-10. The small noise limit of order-based diffusion processes. https://doi.org/10.1214/ejp.v19-2906

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