Waiting Times for Patterns and a Method of Gambling Teams

DOI10.2307/27641864zbMath1143.60010OpenAlexW4243645865MaRDI QIDQ5440671

Vladimir Pozdnyakov, Martin Kulldorff

Publication date: 5 February 2008

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/27641864

zbMATH Keywords

martingalesappearance of patterns

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items (9)

The Number of Optimal Strategies in the Penney-Ante Game ⋮ Predictive control of linear discrete-time Markovian jump systems by learning recurrent patterns ⋮ On expected waiting time until given words appear in random sequence ⋮ A note on the gambling team method ⋮ Multiple pattern matching: a Markov chain approach ⋮ A note on occurrence of gapped patterns in i.i.d. Sequences ⋮ Stopping Probabilities for Patterns in Markov Chains ⋮ Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains ⋮ On occurrence of subpattern and method of gambling teams

This page was built for publication: Waiting Times for Patterns and a Method of Gambling Teams