Approximating perpetuities

From MaRDI portal
Publication:398787

DOI10.1007/S11009-007-9059-XzbMATH Open1293.60028arXiv0711.1099OpenAlexW3037746595MaRDI QIDQ398787FDOQ398787


Authors: Margarete Knape, Ralph Neininger Edit this on Wikidata


Publication date: 15 August 2014

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Abstract: We propose and analyze an algorithm to approximate distribution functions and densities of perpetuities. Our algorithm refines an earlier approach based on iterating discretized versions of the fixed point equation that defines the perpetuity. We significantly reduce the complexity of the earlier algorithm. Also one particular perpetuity arising in the analysis of the selection algorithm Quickselect is studied in more detail. Our approach works well for distribution functions. For densities we have weaker error bounds although computer experiments indicate that densities can also be approximated well.


Full work available at URL: https://arxiv.org/abs/0711.1099




Recommendations




Cites Work


Cited In (10)





This page was built for publication: Approximating perpetuities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398787)