SearcharxivSearch

arXiv · 2003.01550

Leadership exponent in the pursuit problem for 1-D random particles

Abstract

For n + 1 particles moving independently on a straight line, we study the question of how long the leading position of one of them can last. Our focus is the asymptotics of the probability p(T,n) that the leader time will exceed T when n and T are large. It is assumed that the dynamics of particles are described by independent, either stationary or self-similar, Gaussian processes, not necessarily identically distributed. Roughly, the result for particles with stationary dynamics of unit variance is as follows: L= -log p(T,n) /(Tlog n)=1/d+o(1), where d/(2pi) is the power of the zero frequency in the spectrum of the leading particle, and this value is the largest in the spectrum. Previously, in some particular models, the asymptotics of L was understood as a sequential limit first over T and then over n. For processes that do not necessarily have non-negative correlations, the limit over T may not exist. To overcome this difficulty, the growing parameters T and n are considered in the domain clog T 1 . The Lamperti transform allows us to transfer the described result to self-similar processes with the normalizer of log p(T,n) becoming log T log n.

Explore related subjects

Keep this discovery

BibTeXRIS

G. Molchan. 2020-03-03. Leadership exponent in the pursuit problem for 1-D random particles. https://doi.org/10.1007/s10955-020-02614-z

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