Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 3 Mar 2020 in math.PR, math-ph, and math.MP | (2003.01550v2)

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<log n<CT, where c\>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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.