A martingale approach to the study of occurrence of sequence patterns in repeated experiments
From MaRDI portal
Publication:1146439
DOI10.1214/aop/1176994578zbMath0447.60006OpenAlexW2068112586MaRDI QIDQ1146439
Publication date: 1980
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176994578
Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)
Related Items (43)
The 6666 Problem ⋮ On the expected time of the first occurrence of every k bit long patterns in the symmetric Bernoulli process ⋮ Hitting times of sequences ⋮ Covering with blocks in the non-symmetric case ⋮ Context Trees, Variable Length Markov Chains and Dynamical Sources ⋮ Learning Temporal Structures of Random Patterns by Generating Functions ⋮ On pattern occurrences in a random text ⋮ The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach ⋮ The Number of Optimal Strategies in the Penney-Ante Game ⋮ Maximum Waiting Times are Asymptotically Independent ⋮ Explicit distributional results in pattern formation ⋮ Cover times for words in symmetric and nonsymmetric cases: A comparison ⋮ Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains ⋮ Predictive control of linear discrete-time Markovian jump systems by learning recurrent patterns ⋮ Construction of aggregation paradoxes through load-sharing models ⋮ On expected waiting time until given words appear in random sequence ⋮ First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner ⋮ Oscillation properties of expected stopping times and stopping probabilities for patterns consisting of consecutive states in Markov chains ⋮ Unnamed Item ⋮ 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 ⋮ Stochastic precedence and minima among dependent variables ⋮ Waiting times and stopping probabilities for patterns in Markov chains ⋮ On occurrence of patterns in Markov chains: Method of gambling teams ⋮ Asymptotic independence of maximum waiting times for increasing alphabet ⋮ Stopping Probabilities for Patterns in Markov Chains ⋮ How long does it take to see a flat Brownian path on the average? ⋮ Patterns generated by \(m\)th-order Markov chains ⋮ On the mean number of trials until the last trials satisfy a given condition ⋮ Patterns in Random Walks and Brownian Motion ⋮ Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata ⋮ On the waiting time till each of some given patterns occurs as a run ⋮ From Iteration to System Failure: Characterizing the FITness of Periodic Weakly-Hard Systems ⋮ 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 ⋮ A unified approach to word occurrence probabilities ⋮ The occurrence of sequence patterns in ergodic Markov chains ⋮ On the fair coin tossing process ⋮ Large deviation results for waiting times in repeated experiments ⋮ A martingale approach to scan statistics
This page was built for publication: A martingale approach to the study of occurrence of sequence patterns in repeated experiments
