The number of distinct adjacent pairs in geometrically distributed words
From MaRDI portal
Publication:4987263
zbMATH Open1503.68239arXiv1806.04962MaRDI QIDQ4987263FDOQ4987263
Authors: Margaret Archibald, Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Mark Daniel Ward, Stephan Wagner
Publication date: 3 May 2021
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 .
Full work available at URL: https://arxiv.org/abs/1806.04962
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Asymptotic enumeration (05A16) Combinatorics on words (68R15)
Cited In (7)
- The perimeter of uniform and geometric words: a probabilistic analysis
- Title not available (Why is that?)
- The number of distinct values of some multiplicity in sequences of geometrically distributed random variables
- Title not available (Why is that?)
- The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis
- Three distance theorems and combinatorics on words
- 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)