Large excursions and conditioned laws for recursive sequences generated by random matrices

From MaRDI portal




Abstract: We determine the large exceedance probabilities and large exceedance paths for the matrix recursive sequence Vn=MnVn1+Qn,:n=1,2,ldots, where Mn is an i.i.d. sequence of dimesd random matrices and Qn is an i.i.d. sequence of random vectors, both with nonnegative entries. Early work on this problem dates to Kesten's (1973) seminal paper, motivated by an application to multi-type branching processes. Other applications arise in financial time series modeling (connected to the study of the GARCH(p,q) processes) and in physics, and this recursive sequence has also been the focus of extensive work in the recent probability literature. In this work, we characterize the distribution of the first passage time TuA:=infn:VninuA, where A is a subset of the nonnegative quadrant in mathbbRd, showing that TuA/ualpha converges to an exponential law. In the process, we also revisit and refine Kesten's classical estimate, showing that if V has the stationary distribution of Vn, then mathbbPleft(VinuAight)simCAualpha as uoinfty, providing, most importantly, a new characterization of the constant CA. Finally, we describe the large exceedance paths via two conditioned limit laws. In the first, we show that conditioned on a large exceedance, the process Vn follows an exponentially-shifted Markov random walk, which we identify, thereby generalizing results for classical random walk to matrix recursive sequences. In the second, we characterize the empirical distribution of log|Vn|log|Vn1| prior to a large exceedance, showing that this distribution converges to the stationary law of the exponentially-shifted Markov random walk.



Cites work







This page was built for publication: Large excursions and conditioned laws for recursive sequences generated by random matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660628)