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 Edit this on Wikidata


Publication date: 3 May 2021

Abstract: A sequence of geometric random variables of length n is a sequence of n independent and identically distributed geometric random variables (Gamma1,Gamma2,dots,Gamman) where mathbbP(Gammaj=i)=pqi1 for 1leqjleqn with p+q=1. 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 n. We also obtain the asymptotics for the expected number as noinfty.


Full work available at URL: https://arxiv.org/abs/1806.04962




Recommendations





Cited In (7)





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)