SearcharxivSearch

arXiv · 1307.6677

Large deviations for solutions to stochastic recurrence equations under Kesten's condition

Abstract

In this paper we prove large deviations results for partial sums constructed from the solution to a stochastic recurrence equation. We assume Kesten's condition [Acta Math. 131 (1973) 207-248] under which the solution of the stochastic recurrence equation has a marginal distribution with power law tails, while the noise sequence of the equations can have light tails. The results of the paper are analogs to those obtained by A. V. Nagaev [Theory Probab. Appl. 14 (1969) 51-64; 193-208] and S. V. Nagaev [Ann. Probab. 7 (1979) 745-789] in the case of partial sums of i.i.d. random variables. In the latter case, the large deviation probabilities of the partial sums are essentially determined by the largest step size of the partial sum. For the solution to a stochastic recurrence equation, the magnitude of the large deviation probabilities is again given by the tail of the maximum summand, but the exact asymptotic tail behavior is also influenced by clusters of extreme values, due to dependencies in the sequence. We apply the large deviation results to study the asymptotic behavior of the ruin probabilities in the model.

Explore related subjects

Keep this discovery

BibTeXRIS

D. Buraczewski, E. Damek, T. Mikosch, J. Zienkiewicz. 2013-07-25. Large deviations for solutions to stochastic recurrence equations under Kesten's condition. https://doi.org/10.1214/12-aop782

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