Waiting Times for Patterns and a Method of Gambling Teams
From MaRDI portal
Publication:5440671
DOI10.2307/27641864zbMATH Open1143.60010OpenAlexW4243645865MaRDI QIDQ5440671FDOQ5440671
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
Recommendations
Cited In (14)
- On occurrence of patterns in Markov chains: 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
- Multiple pattern matching: a Markov chain approach
- On occurrence of subpattern and method of gambling teams
- On expected waiting time until given words appear in random sequence
- Predictive control of linear discrete-time Markovian jump systems by learning recurrent patterns
- A note on occurrence of gapped patterns in i.i.d. Sequences
- The number of optimal strategies in the Penney-Ante game
- On the waiting time in a generalized roulette game
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
- Stopping Probabilities for Patterns in Markov Chains
- Waiting for ABRACADABRA. Occurrences of words and leading numbers
- Gambler's ruin? Some aspects of coin tossing
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)