On the length of the longest run in a multi-state Markov chain
- 15 April 2003
- journal article
- research article
- Published by Elsevier in Statistics & Probability Letters
- Vol. 62 (3) , 211-221
- https://doi.org/10.1016/s0167-7152(02)00432-7
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Poisson Approximation for the Non-Overlapping Appearances of Several Words in Markov ChainsCombinatorics, Probability and Computing, 2001
- Poisson Approximation and the Chen-Stein MethodStatistical Science, 1990
- Two Moments Suffice for Poisson Approximations: The Chen-Stein MethodThe Annals of Probability, 1989
- Erdős-Révész type bounds for the length of the longest run from a stationary mixing sequenceProbability Theory and Related Fields, 1987
- An extreme value theory for long head runsProbability Theory and Related Fields, 1986
- Extreme Value Distribution for the Largest Cube in a Random LatticeSIAM Journal on Applied Mathematics, 1986
- Long repetitive patterns in random sequencesProbability Theory and Related Fields, 1980
- The limit distribution of the length of the longest head-runPeriodica Mathematica Hungarica, 1979
- On a new law of large numbersJournal d'Analyse Mathématique, 1970
- On the field of combinatory analysisAmerican Mathematical Society Translations: Series 2, 1962