On occurrence of patterns in Markov chains: Method of gambling teams

DOI10.1016/j.spl.2008.03.023zbMath1151.60327OpenAlexW1989898058MaRDI QIDQ952874

Vladimir Pozdnyakov

Publication date: 14 November 2008

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2008.03.023

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05)

Related Items (7)

Learning Temporal Structures of Random Patterns by Generating Functions ⋮ Predictive control of linear discrete-time Markovian jump systems by learning recurrent patterns ⋮ 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 ⋮ Stopping Probabilities for Patterns in Markov Chains ⋮ Patterns generated by \(m\)th-order Markov chains

Cites Work

• A martingale approach to scan statistics
• A martingale approach to the study of occurrence of sequence patterns in repeated experiments
• The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
• Number of occurrences of subpattern until the first appearance of a pattern and geometric distribution.
• Waiting time distributions of simple and compound patterns in a sequence of \(r\)th order Markov dependent multi-state trials
• Distribution of waiting time until the \(r\)th occurrence of a compound pattern
• Waiting times for patterns in a sequence of multistate trials
• On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
• Probability with Martingales
• On some waiting time problems
• Distribution of the scan statistic for a sequence of bistate trials
• Distribution of the number of words with a prescribed frequency and tests of randomness
• The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
• Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On occurrence of patterns in Markov chains: Method of gambling teams