Waiting Times for Patterns and a Method of Gambling Teams

DOI10.2307/27641864MaRDI QIDQ5440671zbMATH OpenOpenAlexFDO

Authors V. Pozdnyakov, M. 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

appearance of patternsmartingales

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Recommendations

• On occurrence of patterns in Markov chains: Method of gambling teams
• Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
• A note on the gambling team method
• On occurrence of subpattern and method of gambling teams
• scientific article; zbMATH DE number 806876

Cited in

(15)

• On occurrence of subpattern and method of gambling teams
• On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process
• A note on the gambling team method
• A note on occurrence of gapped patterns in i.i.d. Sequences
• Waiting for ABRACADABRA. Occurrences of words and leading numbers
• Gambler's ruin? Some aspects of coin tossing
• The number of optimal strategies in the Penney-Ante game
• Stopping Probabilities for Patterns in Markov Chains
• Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
• Predictive control of linear discrete-time Markovian jump systems by learning recurrent patterns
• On expected waiting time until given words appear in random sequence
• Penney's game odds from no-arbitrage
• On the waiting time in a generalized roulette game
• Multiple pattern matching: a Markov chain approach
• On occurrence of patterns in Markov chains: Method of gambling teams

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

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