Filtrations of the erased-word processes
Résumé
We define a class of erased-word processes and prove that the poly-adic filtration generated by such a process is standard. This is shown by firstly constructing a generating process of innovations in the case of a finite alphabet equipped with the uniform probability measure, and then by deriving the general case with the help of the tools of Vershik's theory of filtrations in discrete negative time.
Domaines
Probabilités [math.PR]
Origine : Fichiers produits par l'(les) auteur(s)