Persistence exponents via perturbation theory: MA(1)-processes
Frank Aurzada, Dieter Bothe, Pierre-\'Etienne Druet, Marvin Kettner,, Christophe Profeta

TL;DR
This paper investigates the decay rate of persistence probabilities in MA(1) processes using functional analysis and perturbation theory, providing a power series expansion for the persistence exponent and extending results to the Slepian process.
Contribution
It introduces a novel perturbation approach to compute the persistence exponent for MA(1) processes and applies it to the Slepian process, connecting functional analysis with stochastic persistence.
Findings
Persistence exponent expressed as a power series in
Method applicable to Slepian process via transformation
Eigenvalue approach for decay rate analysis
Abstract
For the moving average process , , where and is an i.i.d. sequence of normally distributed random variables, we study the persistence probabilities , for . We exploit that the exponential decay rate of that quantity, called the persistence exponent, is given by the leading eigenvalue of a concrete integral operator. This makes it possible to study the problem with purely functional analytic methods. In particular, using methods from perturbation theory, we show that the persistence exponent can be expressed as a power series in . Finally, we consider the persistence problem for the Slepian process, transform it into the moving average setup, and show that our perturbation results are applicable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Mathematical and Theoretical Epidemiology and Ecology Models · Diffusion and Search Dynamics
