Importance sampling of heavy-tailed iterated random functions

preprint2016arXivOpen access

Abstract

We consider a stochastic recurrence equation of the form Zn+1=An+1Zn+Bn+1Z_{n+1} = A_{n+1} Z_n+B_{n+1}, where E[log⁡A1]<0\mathbb{E}[\log A_1]<0, E[log⁡+B1]<∞\mathbb{E}[\log^+ B_1]<\infty and {(An,Bn)}n∈N\{(A_n,B_n)\}_{n\in\mathbb{N}} is an i.i.d. sequence of positive random vectors. The stationary distribution of this Markov chain can be represented as the distribution of the random variable Z≜∑n=0∞Bn+1∏k=1nAkZ \triangleq \sum_{n=0}^\infty B_{n+1}\prod_{k=1}^nA_k. Such random variables can be found in the analysis of probabilistic algorithms or financial mathematics, where ZZ would be called a stochastic perpetuity. If one interprets −log⁡An-\log A_n as the interest rate at time nn, then ZZ is the present value of a bond that generates BnB_n unit of money at each time point nn. We are interested in estimating the probability of the rare event {Z>x}\{Z>x\}, when xx is large; we provide a consistent simulation estimator using state-dependent importance sampling for the case, where log⁡A1\log A_1 is heavy-tailed and the so-called Cramér condition is not satisfied. Our algorithm leads to an estimator for P(Z>x)P(Z>x). We show that under natural conditions, our estimator is strongly efficient. Furthermore, we extend our method to the case, where {Zn}n∈N\{Z_n\}_{n\in\mathbb{N}} is defined via the recursive formula Zn+1=Ψn+1(Zn)Z_{n+1}=Ψ_{n+1}(Z_n) and {Ψn}n∈N\{Ψ_n\}_{n\in\mathbb{N}} is a sequence of i.i.d. random Lipschitz functions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.