SearcharxivSearch

arXiv · 1210.0259

Systems of Brownian particles with asymmetric collisions

Abstract

We study systems of Brownian particles on the real line, which interact by splitting the local times of collisions among themselves in an asymmetric manner. We prove the strong existence and uniqueness of such processes and identify them with the collections of ordered processes in a Brownian particle system, in which the drift coefficients, the diffusion coefficients, and the collision local times for the individual particles are assigned according to their ranks. These Brownian systems can be viewed as generalizations of those arising in first-order models for equity markets in the context of stochastic portfolio theory, and are able to correct for several shortcomings of such models while being equally amenable to computations. We also show that, in addition to being of interest in their own right, such systems of Brownian particles arise as universal scaling limits of systems of jump processes on the integer lattice with local interactions. A key step in the proof is the analysis of a generalization of Skorokhod maps which include `local times' at the intersection of faces of the nonnegative orthant. The result extends the convergence of TASEP to its continuous analogue. Finally, we identify those among the Brownian particle systems which have a probabilistic structure of determinantal type.

Explore related subjects

Keep this discovery

BibTeXRIS

Ioannis Karatzas, Soumik Pal, Mykhaylo Shkolnikov. 2012-09-30. Systems of Brownian particles with asymmetric collisions. https://arxiv.org/abs/1210.0259

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