The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis

DOI10.46298/DMTCS.9293arXiv2203.14773MaRDI QIDQ6507779FDOQ6507779

Mark Daniel Ward, Werner Schachinger, Guy Louchard

Abstract: The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words. They obtain the asymptotic ($nightarrowinfty$) mean of this number in the cases of different and identical pairs. In this paper we are interested in all asymptotic moments in the identical case, in the asymptotic variance in the different case and in the asymptotic distribution in both cases. We use two approaches: the first one, the probabilistic approach, leads to variances in both cases and to some conjectures on all moments in the identical case and on the distribution in both cases. The second approach, the combinatorial one, relies on multivariate pattern matching techniques, yielding exact formulas for first and second moments. We use such tools as Mellin transforms, Analytic Combinatorics, Markov Chains.

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

This page was built for publication: The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507779)