A simple master Theorem for discrete divide and conquer recurrences - Archive ouverte HAL
Pré-Publication, Document De Travail Année : 2019

A simple master Theorem for discrete divide and conquer recurrences

Olivier Garet

Résumé

The aim of this note is to provide a Master Theorem for some discrete divide and conquer recurrences: $$X_{n}=a_n+\sum_{j=1}^m b_j X_{\lfloor p_j n \rfloor},$$ where the $p_i$'s belong to $(0,1)$. The main novelty of this work is there is no assumption of regularity or monotonicity for $(a_n)$. Then, this result can be applied to various sequences of random variables $(a_n)_{n\ge 0}$, for example such that $\sup_{n\ge 1}\mathbb{E}(|a_n|)<+\infty$.
Fichier principal
Vignette du fichier
divide.pdf (126.6 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02049382 , version 1 (26-02-2019)
hal-02049382 , version 2 (15-02-2021)

Identifiants

Citer

Olivier Garet. A simple master Theorem for discrete divide and conquer recurrences. 2019. ⟨hal-02049382v1⟩
88 Consultations
133 Téléchargements

Altmetric

Partager

More