SearcharxivSearch

arXiv · math/0611292

Consistent families of Brownian motions and stochastic flows of kernels

Abstract

Consider the following mechanism for the random evolution of a distribution of mass on the integer lattice ${\mathbf{Z}}$. At unit rate, independently for each site, the mass at the site is split into two parts by choosing a random proportion distributed according to some specified probability measure on $[0,1]$ and dividing the mass in that proportion. One part then moves to each of the two adjacent sites. This paper considers a continuous analogue of this evolution, which may be described by means of a stochastic flow of kernels, the theory of which was developed by Le Jan and Raimond. One of their results is that such a flow is characterized by specifying its $N$ point motions, which form a consistent family of Brownian motions. This means for each dimension $N$ we have a diffusion in ${\mathbf{R}}^N$, whose $N$ coordinates are all Brownian motions. Any $M$ coordinates taken from the $N$-dimensional process are distributed as the $M$-dimensional process in the family. Moreover, in this setting, the only interactions between coordinates are local: when coordinates differ in value they evolve independently of each other. In this paper we explain how such multidimensional diffusions may be constructed and characterized via martingale problems.

Explore related subjects

Keep this discovery

BibTeXRIS

Chris Howitt, Jon Warren. 2009-08-26. Consistent families of Brownian motions and stochastic flows of kernels. https://doi.org/10.1214/08-aop431

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