Heavy tail phenomenon and convergence to stable laws for iterated Lipschitz maps
Abstract
We consider the Markov chain \Xnx\n=0∞ on d defined by the stochastic recursion Xnx=θn(Xn-1x), starting at x∈d, where θ1, θ2,... are i.i.d. random variables taking their values in a metric space (, r), and θn:dd are Lipschitz maps. Assume that the Markov chain has a unique stationary measure . Under appropriate assumptions on θn, we will show that the measure has a heavy tail with the exponent α>0 i.e. (\x∈d: |x|>t\) t-α. Using this result we show that properly normalized Birkhoff sums Snx=Σk=1n Xkx, converge in law to an α--stable law for α∈(0, 2].
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.