SearcharxivSearch

arXiv · 1906.00473

Persistence versus stability for auto-regressive processes

Abstract

The stability of an Auto-Regressive (AR) time sequence of finite order $L$, is determined by the maximal modulus $r^\star$ among all zeros of its generating polynomial. If $r^\star<1$ then the effect of input and initial conditions decays rapidly in time, whereas for $r^\star>1$ it is exponentially magnified (with constant or polynomially growing oscillations when $r^\star=1$). Persistence of such AR sequence (namely staying non-negative throughout $[0,N]$) with decent probability, requires the largest positive zero of the generating polynomial to have the largest multiplicity among all zeros of modulus $r^\star$. These objects are behind the rich spectrum of persistence probability decay for AR$_L$ with zero initial conditions and i.i.d. Gaussian input, all the way from bounded below to exponential decay in $N$, with intermediate regimes of polynomial and stretched exponential decay. In particular, for AR$_3$ the persistence decay power is expressed via the tail probability for Brownian motion to stay in a cone, exhibiting the discontinuity of such power decay between the AR$_3$ whose generating polynomial has complex zeros of rational versus irrational angles.

Explore related subjects

Keep this discovery

BibTeXRIS

Amir Dembo, Jian Ding, Jun Yan. 2019-06-02. Persistence versus stability for auto-regressive processes. https://arxiv.org/abs/1906.00473

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