Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
From MaRDI portal
Publication:5488994
Recommendations
Cites work
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A martingale approach to scan statistics
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- Distribution Theory of Runs: A Markov Chain Approach
- Distribution of the scan statistic for a sequence of bistate trials
- Exact distribution of word occurrences in a random sequence of letters
- Explicit distributional results in pattern formation
- How many random digits are required until given sequences are obtained?
- Markov renewal processes, counters and repeated sequences in Markov chains
- On generating functions of waiting time problems for sequence patterns of discrete random variables
- On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
- On some waiting time problems
- Periods in strings
- Probability with Martingales
- Reliability of Consecutive-k-out-of-n:F Systems with (k-1)-step Markov Dependence
- Renewal theory for several patterns
- 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
- String overlaps, pattern matching, and nontransitive games
- The Occurrence of Sequence Patterns in Repeated Dependent Experiments
- The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
- The occurrence of sequence patterns in ergodic Markov chains
- The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
- Waiting Times for Patterns and a Method of Gambling Teams
- Waiting times for patterns in a sequence of multistate trials
Cited in
(12)- On occurrence of patterns in Markov chains: Method of gambling teams
- Stopping Probabilities for Patterns in Markov Chains
- First passage time in Markov chains and in random walks on countable abelian groups
- Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
- Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains
- Patterns generated by \(m\)th-order Markov chains
- Waiting Times for Patterns and a Method of Gambling Teams
- A note on the gambling team method
- A note on occurrence of gapped patterns in i.i.d. Sequences
- On occurrence of subpattern and method of gambling teams
- Waiting times and stopping probabilities for patterns in Markov chains
- Predictive control of linear discrete-time Markovian jump systems by learning recurrent patterns
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)