Patterns generated by -order Markov chains

Abstract

We derive an expression for the expected time for a pattern to appear in higher-order Markov chains with and without a starting sequence. This yields a result for directly calculating, the first time one of a collection of patterns appears, in addition to the probability, for each pattern, that it is the first to appear.Patterns Markov chains Waiting time

    Similar works

    Full text

    thumbnail-image

    Available Versions

    Last time updated on 06/07/2012