Polynomial tails of additive-type recursions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2008

Polynomial tails of additive-type recursions


Polynomial bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees, or in recursive algorithms. In particular they arise as parameters of divide and conquer type algorithms. We mainly focuss on polynomial tails that arise due to heavy tail bounds of the toll term and the starting distributions. Besides estimating the tail probability directly we use a modified version of a theorem from regular variation theory. This theorem states that upper bounds on the asymptotic tail probability can be derived from upper bounds of the Laplace―Stieltjes transforms near zero.
Fichier principal
Vignette du fichier
dmAI0113.pdf (214.88 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01194690 , version 1 (07-09-2015)



Eva-Maria Schopp. Polynomial tails of additive-type recursions. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.223-234, ⟨10.46298/dmtcs.3566⟩. ⟨hal-01194690⟩


117 View
536 Download



Gmail Facebook X LinkedIn More