Waiting times and stopping probabilities for patterns in Markov chains

From MaRDI portal
Publication:1747367

DOI10.1007/S11766-018-3522-ZzbMATH Open1399.60124arXiv1602.06512OpenAlexW2286237953MaRDI QIDQ1747367FDOQ1747367


Authors: Minzhi Zhao, Dong Xu, Huizeng Zhang Edit this on Wikidata


Publication date: 8 May 2018

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Abstract: Suppose that mathcalC is a finite collection of patterns. Observe a Markov chain until one of the patterns in mathcalC occurs as a run. This time is denoted by au. In this paper, we aim to give an easy way to calculate the mean waiting time E(au) and the stopping probabilities P(au=auA) with AinmathcalC, where auA is the waiting time until the pattern A appears as a run.


Full work available at URL: https://arxiv.org/abs/1602.06512




Recommendations




Cites Work


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)