Waiting Time Distribution for the Emergence of Superpatterns
Document Type
Article
Publication Date
6-1-2016
Description
Consider a sequence (Formula presented.) of i.i.d. uniform random variables taking values in the alphabet set {1, 2,…, d}. A k-superpattern is a realization of (Formula presented.) that contains, as an embedded subsequence, each of the non-order-isomorphic subpatterns of length k. We focus on the (non-trivial) case of d = k = 3 and study the waiting time distribution of (Formula presented.). Our restricted set-up leads to proofs that are very combinatorial in nature, since we are essentially conducting a string analysis.
Citation Information
Godbole, Anant P.; and Liendo, Martha. 2016. Waiting Time Distribution for the Emergence of Superpatterns. Methodology and Computing in Applied Probability. Vol.18(2). 517-528. https://doi.org/10.1007/s11009-015-9439-6 ISSN: 1387-5841