Implicit renewal theory in the arithmetic case
Journal of Applied Probability · 2017-09 · 54 (3) · 732-749
DOI: 10.1017/jpr.2017.31 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Applied Probability, online erschienen am 15.09.2017. Verfasst von Péter Kevei. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 27 Literaturangaben.
Abstract (Originalsprache)
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 e h ) = 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).
Zitieren
APA
Kevei, P. (2017). Implicit renewal theory in the arithmetic case. Journal of Applied Probability, 54(3), 732-749. https://doi.org/10.1017/jpr.2017.31
Vancouver
Kevei P. Implicit renewal theory in the arithmetic case. Journal of Applied Probability. 2017;54(3):732-749. doi:10.1017/jpr.2017.31
BibTeX
@article{Kevei2017,
author = {Kevei, Péter},
title = {Implicit renewal theory in the arithmetic case},
journal = {Journal of Applied Probability},
year = {2017},
volume = {54},
number = {3},
pages = {732--749},
doi = {10.1017/jpr.2017.31}
}
EUVIMED