Waiting times and stopping probabilities for patterns in Markov chains
DOI10.1007/S11766-018-3522-ZzbMATH Open1399.60124arXiv1602.06512OpenAlexW2286237953MaRDI QIDQ1747367FDOQ1747367
Authors: Minzhi Zhao, Dong Xu, Huizeng Zhang
Publication date: 8 May 2018
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.06512
Recommendations
Computational methods in Markov chains (60J22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stopping times; optimal stopping problems; gambling theory (60G40)
Cites Work
- String overlaps, pattern matching, and nontransitive games
- On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
- The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain
- A martingale approach to the study of occurrence of sequence patterns in repeated experiments
- Double-scan statistics
- The Occurrence of Sequence Patterns in Repeated Dependent Experiments
- Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains
- On occurrence of patterns in Markov chains: Method of gambling teams
- Pattern matching probabilities and paradoxes as a new variation on Penney's coin game
- Stopping Probabilities for Patterns in Markov Chains
Cited In (5)
This page was built for publication: Waiting times and stopping probabilities for patterns in Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747367)