Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. A Note on the Approx ...
Conference paper

A Note on the Approximation of Perpetuities

Margarete Knape (1), Ralph Neininger (1)
(1) Department for Mathematics and Computer Science
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2006
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
Proceedings
DOI
10.46298/dmtcs.3544
License
https://about.hal.science/hal-authorisation-v1
Indicators
571
Views
829
Downloads

A Note on the Approximation of Perpetuities

Margarete Knape (1), Ralph Neininger (1)
(1) Department for Mathematics and Computer Science
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 well approximated.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • perpetuity
  • distribution function
  • density
Cited by

Source: OpenCitations

  • Approximating Perpetuities

    Methodology And Computing In Applied Probability

    Authors : Margarete Knape, Ralph Neininger ORCID

    Journal reference : Volume 10, 2007, pp. 507-529

    DOI : 10.1007/s11009-007-9059-x
Preview
Loading PDF preview...