Exponential tail bounds for max-recursive sequences
Ludger Rueschendorf, Mathematical Stochastics
Eva-Maria Schopp, Mathematical Stochastics
Abstract
Exponential tail bounds are derived for solutions of max-recursive equations and for
max-recursive random sequences, which typically arise as functionals of recursive
structures, of random trees or in recursive algorithms. In particular they arise in the
worst case analysis of divide and conquer algorithms, in parallel search algorithms
or in the height of random tree models. For the proof we determine asymptotic
bounds for the moments or for the Laplace transforms and apply a characterization of
exponential tail bounds due to Kasahara (1978).
Full text: PDF | PostScript
Copyright for articles published in this journal is retained by the authors, with first publication rights granted to the journal. By virtue of their appearance in this open access journal, articles are free to use, with proper attribution, in educational and other non-commercial settings.
The authors of papers published in EJP/ECP retain the copyright. We ask for the permission to use the material in any form. We also require that the initial publication in EJP or ECP is acknowledged in any future publication of the same article.
Before a paper is published in the Electronic Journal of Probability or Electronic Communications in Probability we must receive a hard-copy of the copyright form. Please mail it to
Philippe Carmona
Laboratoire Jean Leray UMR 6629
Universite de Nantes,
2, Rue de la Houssinière BP 92208
F-44322 Nantes Cédex 03
France
You can also send it by FAX: (33|0) 2 51 12 59 12 to the attention of Philippe Carmona.
The preferred way is to send a scanned (jpeg or pdf) copy of the signed copyright form to the managing editor Philippe Carmona at ejpecpme@math.univ-nantes.fr.
If a paper has several authors, the corresponding author signs the copyright form
on behalf of all the authors.