SearcharxivSearch

arXiv · 1106.3252

Weak convergence of the localized disturbance flow to the coalescing Brownian flow

Abstract

We define a new state-space for the coalescing Brownian flow, also known as the Brownian web, on the circle. The elements of this space are families of order-preserving maps of the circle, depending continuously on two time parameters and having a certain weak flow property. The space is equipped with a complete separable metric. A larger state-space, allowing jumps in time, is also introduced, and equipped with a Skorokhod-type metric, also complete and separable. We prove that the coalescing Brownian flow is the weak limit in this larger space of a family of flows which evolve by jumps, each jump arising from a small localized disturbance of the circle. A local version of this result is also obtained, in which the weak limit law is that of the coalescing Brownian flow on the line. Our set-up is well adapted to time-reversal and our weak limit result provides a new proof of time-reversibility of the coalescing Brownian flow. We also identify a martingale associated with the coalescing Brownian flow on the circle and use this to make a direct calculation of the Laplace transform of the time to complete coalescence.

Explore related subjects

Keep this discovery

BibTeXRIS

James Norris, Amanda Turner. 2011-06-16. Weak convergence of the localized disturbance flow to the coalescing Brownian flow. https://doi.org/10.1214/13-aop845

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR