Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
DOI10.1239/JAP/1143936248zbMATH Open1105.60051OpenAlexW2048391875WikidataQ57590116 ScholiaQ57590116MaRDI QIDQ5488994FDOQ5488994
Authors: Joseph Glaz, M. Kulldorff, V. Pozdnyakov, J. Michael Steele 
Publication date: 25 September 2006
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jap/1143936248
Recommendations
Martingales with discrete parameter (60G42) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Title not available (Why is that?)
- Probability with Martingales
- Distribution Theory of Runs: A Markov Chain Approach
- Sooner and later waiting time problems for patterns in Markov dependent trials
- Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials
- A martingale approach to scan statistics
- Distribution of the scan statistic for a sequence of bistate trials
- Explicit distributional results in pattern formation
- Waiting times for patterns in a sequence of multistate trials
- String overlaps, pattern matching, and nontransitive games
- On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
- Exact distribution of word occurrences in a random sequence of letters
- The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
- Reliability of Consecutive-k-out-of-n:F Systems with (k-1)-step Markov Dependence
- How many random digits are required until given sequences are obtained?
- Periods in strings
- On some waiting time problems
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- The occurrence of sequence patterns in ergodic Markov chains
- On generating functions of waiting time problems for sequence patterns of discrete random variables
- The Occurrence of Sequence Patterns in Repeated Dependent Experiments
- Renewal theory for several patterns
- Markov renewal processes, counters and repeated sequences in Markov chains
- Waiting Times for Patterns and a Method of Gambling Teams
Cited In (12)
- On occurrence of patterns in Markov chains: Method of gambling teams
- Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains
- A note on the gambling team method
- Waiting times and stopping probabilities for patterns in Markov chains
- Patterns generated by \(m\)th-order Markov chains
- On occurrence of subpattern and method of gambling teams
- 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
- First passage time in Markov chains and in random walks on countable abelian groups
- Waiting Times for Patterns and a Method of Gambling Teams
- Stopping Probabilities for Patterns in Markov Chains
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
This page was built for publication: Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488994)
