SearcharxivSearch

arXiv · 0709.2901

On the structure of quasi-stationary competing particle systems

Abstract

We study point processes on the real line whose configurations $X$ are locally finite, have a maximum and evolve through increments which are functions of correlated Gaussian variables. The correlations are intrinsic to the points and quantified by a matrix $Q=\{q_{ij}\}_{i,j\in\mathbb{N}}$. A probability measure on the pair $(X,Q)$ is said to be quasi-stationary if the joint law of the gaps of $X$ and of $Q$ is invariant under the evolution. A known class of universally quasi-stationary processes is given by the Ruelle Probability Cascades (RPC), which are based on hierarchically nested Poisson--Dirichlet processes. It was conjectured that up to some natural superpositions these processes exhausted the class of laws which are robustly quasi-stationary. The main result of this work is a proof of this conjecture for the case where $q_{ij}$ assume only a finite number of values. The result is of relevance for mean-field spin glass models, where the evolution corresponds to the cavity dynamics, and where the hierarchical organization of the Gibbs measure was first proposed as an ansatz.

Explore related subjects

Keep this discovery

BibTeXRIS

Louis-Pierre Arguin, Michael Aizenman. 2007-09-18. On the structure of quasi-stationary competing particle systems. https://doi.org/10.1214/08-aop429

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