Patterns generated by -order Markov chains
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.
Year of publication: |
2010
|
---|---|
Authors: | Fisher, Evan ; Cui, Shiliang |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 80.2010, 15-16, p. 1157-1166
|
Publisher: |
Elsevier |
Subject: | Patterns Markov chains Waiting time |
Saved in:
Saved in favorites
Similar items by person
-
What is the significance of the world sugar market
Fisher, Evan, (1967)
-
Excursions of a normal random walk above a boundary
Fisher, Evan, (2000)
-
The length of an excursion above a linear boundary by a random walk
Lee, Travis, (1997)
- More ...