Poisson genericity in numeration systems with exponentially mixing probabilities

We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if the number of occurrences of blocks of symbols asymptotically follows a Poisson law as the block length increases. We p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Álvarez, Nicolás, Becher, Verónica, Cesaratto, Eda, Mereb, Martín, Peres, Yuval, Weiss, Benjamin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!