| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1153041 | Statistics & Probability Letters | 2010 | 10 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Statistics and Probability
Authors
Evan Fisher, Shiliang Cui,