Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-12T19:08:55.331Z Has data issue: false hasContentIssue false

Implicit renewal theory in the arithmetic case

Published online by Cambridge University Press:  15 September 2017

Péter Kevei*
Affiliation:
Technische Universität München and MTA–SZTE Analysis and Stochastics Research Group
*
* Postal address: University of Szeged, Aradi vértanúk tere 1, 6720 Szeged, Hungary. Email address: kevei@math.u-szeged.hu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We extend Goldie's implicit renewal theorem to the arithmetic case, which allows us to determine the tail behavior of the solution of various random fixed point equations. It turns out that the arithmetic and nonarithmetic cases are very different. Under appropriate conditions we obtain that the tail of the solution X of the fixed point equations X =D AX + B and X =D AX ∨ B is ℓ(x) q(x) x -κ, where q is a logarithmically periodic function q(x eh ) = q(x), x > 0, with h being the span of the arithmetic distribution of log A, and ℓ is a slowly varying function. In particular, the tail is not necessarily regularly varying. We use the renewal theoretic approach developed by Grincevičius (1975) and Goldie (1991).

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2017