SearcharxivSearch

arXiv · 2407.06870

Persistence exponents via perturbation theory: MA(1)-processes

Abstract

For the moving average process $X_n=\rho \xi_{n-1}+\xi_n$, $n\in\mathbb{N}$, where $\rho\in\mathbb{R}$ and $(\xi_i)_{i\ge -1}$ is an i.i.d. sequence of normally distributed random variables, we study the persistence probabilities $\mathbb{P}(X_0\ge 0,\dots, X_N\ge 0)$, for $N\to\infty$. We exploit that the exponential decay rate $\lambda_\rho$ 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 $\lambda_\rho$ can be expressed as a power series in $\rho$. 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.

Explore related subjects

Keep this discovery

BibTeXRIS

Frank Aurzada, Dieter Bothe, Pierre-Étienne Druet, Marvin Kettner, Christophe Profeta. 2024-07-09. Persistence exponents via perturbation theory: MA(1)-processes. https://arxiv.org/abs/2407.06870

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