Waiting times and stopping probabilities for patterns in Markov chains

From MaRDI portal
Publication:1747367




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.









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)