The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
From MaRDI portal
Publication:1147437
DOI10.1016/0304-4149(81)90025-9zbMath0449.60050OpenAlexW2156024151MaRDI QIDQ1147437
Hans U. Gerber, Shuo-Yen Robert Li
Publication date: 1981
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/24435
Martingales with discrete parameter (60G42) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (27)
Hitting times of sequences ⋮ A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials ⋮ Context Trees, Variable Length Markov Chains and Dynamical Sources ⋮ The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach ⋮ Explicit distributional results in pattern formation ⋮ Cover times for Markov-generated binary sequences of length two ⋮ 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 ⋮ Approximating the extreme right-hand tail probability for the distribution of the number of patterns in a sequence of multi-state trials ⋮ A note on the gambling team method ⋮ Rarity and exponentiality: an extension of Keilson's theorem, with applications ⋮ Multiple pattern matching: a Markov chain approach ⋮ A note on occurrence of gapped patterns in i.i.d. Sequences ⋮ Approximating the distributions of runs and patterns ⋮ Waiting times and stopping probabilities for patterns in Markov chains ⋮ On occurrence of patterns in Markov chains: Method of gambling teams ⋮ Sooner and later waiting time problems for Markovian Bernoulli trials ⋮ Stopping Probabilities for Patterns in Markov Chains ⋮ Patterns generated by \(m\)th-order Markov chains ⋮ On the mean number of trials until the last trials satisfy a given condition ⋮ Approximation of sojourn-times via maximal couplings: motif frequency distributions ⋮ Patterns in Random Walks and Brownian Motion ⋮ Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains ⋮ On occurrence of subpattern and method of gambling teams ⋮ Digital search trees and chaos game representation ⋮ The occurrence of sequence patterns in ergodic Markov chains ⋮ A martingale approach to scan statistics
Cites Work
This page was built for publication: The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
