Let
Ψ,Ψ1,Ψ2,… be a sequence of i.i.d. random Lipschitz maps from a complete separable metric space
(X,d) with unbounded metric
d to itself and let
Xn=Ψn∘⋯∘Ψ1(X0) for
n=1,2,… be the associated Markov chain of forward iterations with initial value
X0 which is independent of the
Ψn. Provided that
(Xn)n≥0 has a stationary law
π and picking an arbitrary reference point
x0∈X, we will study the tail behavior of
d(x0,X0) under
Pπ,
viz. the behavior of
Pπ(d(x0,X0)>t) as
t→∞, in cases when there exist (relatively simple) nondecreasing continuous random functions
F,G:R≥→R≥ such that
for all
x∈X and
n≥1. In a nutshell, our main result states that, if the iterations of i.i.d. copies of
F and
G constitute contractive iterated function systems with unique stationary laws
πF and
πG having power tails of order
ϑF and
ϑG at infinity, respectively, then lower and upper tail index of
2252c0e9bb3d722e77573c6078653eb9" title="Click to view the MathML source">ν=Pπ(d(x0,X0)∈⋅) (to be defined in Section
2) are falling in
[ϑG,ϑF]. If
ϑF=ϑG, which is the most interesting case, this leads to the exact tail index of
225962dffc5460c6446f9c6589c" title="Click to view the MathML source">ν. We illustrate our method, which may be viewed as a supplement of Goldie’s implicit renewal theory, by a number of popular examples including the AR(1)-model with ARCH errors and random logistic transforms.