Waiting time distribution for the emergence of superpatterns

DOI10.1007/S11009-015-9439-6zbMATH Open1386.60030arXiv1302.4668OpenAlexW2149596719MaRDI QIDQ292369FDOQ292369

Authors: Anant P. Godbole, Martha Liendo 

Publication date: 8 June 2016

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Abstract: Consider a sequence X_1, X_2,... of i.i.d. uniform random variables taking values in the alphabet set {1,2,...,d}. A k-superpattern is a realization of X_1,...,X_t 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 tau=inf{t>=7: X_1,...,X_t is a superpattern}

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

Recommendations

• On the waiting time till each of some given patterns occurs as a run
• scientific article; zbMATH DE number 806876
• Waiting time for consecutive repetitions of a pattern and related distributions
• Asymptotic independence of maximum waiting times for increasing alphabet
• THE MEAN WAITING TIME FOR A PATTERN

zbMATH Keywords

generating functionwaiting time distributionsuperpattern

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Packing sets of patterns
• Packing densities of patterns
• Dense packing of patterns in a permutation
• Runs and scans with applications
• Distribution Theory of Runs: A Markov Chain Approach
• Title not available (Why is that?)
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Asymptotic bounds for permutations containing many different patterns
• Packing patterns into words
• The patterns of permutations
• On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation
• The Lexicographic First Occurrence of a I-II-III pattern
• Omnibus sequences, coupon collection, and missing word counts
• On packing densities of permutations

Cited In (4)

• Some results on superpatterns for preferential arrangements
• Uniform sets and super-stationary sets over general alphabets
• A Waiting Time Phenomenon in Pattern Forming Systems
• Preferential arrangement superpatterns

This page was built for publication: Waiting time distribution for the emergence of superpatterns

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