The number of distinct adjacent pairs in geometrically distributed words
From MaRDI portal
Publication:4987263
Abstract: A sequence of geometric random variables of length is a sequence of independent and identically distributed geometric random variables () where for with We study the number of distinct adjacent two letter patterns in such sequences. Initially we directly count the number of distinct pairs in words of short length. Because of the rapid growth of the number of word patterns we change our approach to this problem by obtaining an expression for the expected number of distinct pairs in words of length . We also obtain the asymptotics for the expected number as .
Recommendations
Cited in
(7)- The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
- The number of distinct values of some multiplicity in sequences of geometrically distributed random variables
- scientific article; zbMATH DE number 6195618 (Why is no real title available?)
- The perimeter of uniform and geometric words: a probabilistic analysis
- Three distance theorems and combinatorics on words
- scientific article; zbMATH DE number 2192165 (Why is no real title available?)
- Records in geometrically distributed words: Sum of positions
This page was built for publication: The number of distinct adjacent pairs in geometrically distributed words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987263)