Tail behaviour of stationary solutions of random difference equations: the case of regular matrices

  title={Tail behaviour of stationary solutions of random difference equations: the case of regular matrices},
  author={Gerold Alsmeyer and Sebastian Mentemeier},
  journal={Journal of Difference Equations and Applications},
  pages={1305 - 1332}
Given a sequence of i.i.d. random variables with generic copy such that M is a regular matrix and Q takes values in , we consider the random difference equation Under suitable assumptions stated below, this equation has a unique stationary solution R such that for some and some finite positive and continuous function K on , holds true. A rather long proof of this result, originally stated by Kesten [Acta Math. 131 (1973), pp. 207–248] at the end of his famous article, was given by Le Page [S… 
Asymptotically linear iterated function systems on the real line
Given a sequence of i.i.d. random functions Ψn : R→ R, n ∈ N, we consider the iterated function system and Markov chain which is recursively defined by X 0 := x and X x n := Ψn−1(X x n−1) for x ∈ R
On Multivariate Stochastic Fixed Point Equations: The Smoothing Transform and Random Difference Equations
The thesis at hand is concerned with the study of random vectors Y ∈ R d , satisfying multivariate stochastic fixed point equations Y d = N i=1 T i Y i + Q (d =:same distribution). Here N ≥ 1 fixed,
Large deviation estimates for exceedance times of perpetuity sequences and their dual processes
In a variety of problems in pure and applied probability, it is relevant to study the large exceedance probabilities of the perpetuity sequence Yn:=B1+A1B2+⋯+(A1⋯An−1)BnYn:=B1+A1B2+⋯+(A1⋯An−1)Bn,
Quasistochastic matrices and Markov renewal theory
  • G. Alsmeyer
  • Mathematics
    Journal of Applied Probability
  • 2014
Let 𝓈 be a finite or countable set. Given a matrix F = (F ij ) i,j∈𝓈 of distribution functions on R and a quasistochastic matrix Q = (q ij ) i,j∈𝓈 , i.e. an irreducible nonnegative matrix with
Precise Large Deviation Results for Products of Random Matrices
The theorem of Furstenberg and Kesten provides a strong law of large numbers for the norm of a product of random matrices. This can be extended under various assumptions, covering nonnegative as well
Large excursions and conditioned laws for recursive sequences generated by random matrices
We determine the large exceedance probabilities and large exceedance paths for the matrix recursive sequence $V_n = M_n V_{n-1} + Q_n, \: n=1,2,\ldots,$ where $\{M_n\}$ is an i.i.d. sequence of $d
Random difference equations with subexponential innovations
We consider the random difference equations S =d (X + S)Y and T =dX + TY, where =d denotes equality in distribution, X and Y are two nonnegative random variables, and S and T on the right-hand side
Let N>1 be a fixed integer and (C1,…,CN,Q) a random element of M(d×d,R)N×Rd. We consider solutions of multivariate smoothing transforms, i.e. random variables R satisfying R=d∑i=1NCiRi+Q where =d
On the Kesten–Goldie constant
We consider the stochastic difference equation on where is an i.i.d. sequence of random variables and is an initial distribution. Under mild contractivity hypotheses the sequence converges in law to
Affine stochastic equation with triangular matrices
We consider the stochastic recurrence equation Xn = AnXn−1 +Bn n ∈ N, (1.1) where (An, Bn) is an i.i.d. sequence, An are d×dmatrices, Bn are vectors andX0 is an initial distribution independent of


Random difference equations and Renewal theory for products of random matrices
where Mn and Qn are random d • d matrices respectively d-vectors and Yn also is a d-vector. Throughout we take the sequence of pairs (Mn, Q~), n >/1, independently and identically distributed. The
Heavy tail properties of stationary solutions of multidimensional stochastic recursions
We consider the following recurrence relation with random i.i.d. coefficients $(a_n,b_n)$: $$ x_{n+1}=a_{n+1} x_n+b_{n+1} $$ where $a_n\in GL(d,\mathbb{R}),b_n\in \mathbb{R}^d$. Under natural
A multiplicative ergodic theorem for lipschitz maps
If (Fn, n [greater-or-equal, slanted] 0) is a stationary (ergodic) sequence of Lipschitz maps of a locally compact Polish space X into itself having a.s. negative Lyapunov exponent function, the
A New Approach to the Limit Theory of Recurrent Markov Chains
Let {X n ; n ≥ 0} be a Harris-recurrent Markov chain on a general state space. It is shown that there is a sequence of random times {N i ; i ≥ 1} such that {X N ; i ≥ 1} are independent and
in which ,u is a known probability measure and g a known function. By "implicit renewal theory" is meant a variant in which g is not known and indeed is an integral involving f itself.
Tail-homogeneity of stationary measures for some multidimensional stochastic recursions
We consider a stochastic recursion Xn+1 = Mn+1Xn + Qn+1, ($${n\in \mathbb {N}}$$), where (Qn, Mn) are i.i.d. random variables such that Qn are translations, Mn are similarities of the Euclidean space
Products of Random Matrices with Applications to Schrödinger Operators
A: "Limit Theorems for Products of Random Matrices".- I - The Upper Lyapunov Exponent.- 1. Notation.- 2. The upper Lyapunov exponent.- 3. Cocycles.- 4. The theorem of Furstenberg and Kesten.- 5.
Iterated Random Functions
Survey of iterated random functions offers a method for studying the steady state distribution of a Markov chain, and presents useful bounds on rates of convergence in a variety of examples.
The Markov Renewal Theorem and Related Results
We give a new probabilistic proof of the Markov renewal theorem for Markov random walks with positive drift and Harris recurrent driving chain. It forms an alternative to the one recently given in
On the multidimensional stochastic equation Yn+1=AnYn+Bn
Abstract We study the behavior at infinity of the tail of the stationary solution of a multidimensional linear auto-regressive process with random coefficients. We exhibit an extended class of