On the length of the longest run in a multi-state Markov chain
Let {Xa}a[set membership, variant]Z be an irreducible and aperiodic Markov chain on a finite state space S={0,1,...,r}, r[greater-or-equal, slanted]1. Denote by Ln the length of the longest run of consecutive i's, for i=1,...,r, that occurs in the sequence X1,...,Xn. In this work, we extend a result of Goncharov (Amer. Math. Soc. Transl. 19 (1943) 1) which concerned a limit law for Ln in sequences of 0-1 i.i.d. trials. Moreover, it is shown that Ln has approximately an extreme value distribution along a certain subsequence. Finally, a weak version of an Erdös-Rényi type law for Ln is proved.
Year of publication: |
2003
|
---|---|
Authors: | Vaggelatou, Eutichia |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 62.2003, 3, p. 211-221
|
Publisher: |
Elsevier |
Keywords: | Longest run Multi-state trials Extreme value distribution Erdös-Rényi type law |
Saved in:
Saved in favorites
Similar items by person
-
Compound Poisson Approximation for Multiple Runs in a Markov Chain
Chryssaphinou, Ourania, (2002)
-
Compound Poisson Approximation for Multiple Runs in a Markov Chain
Chryssaphinou, Ourania, (2002)
-
A connection between supermodular ordering and positive/negative association
Christofides, Tasos C., (2004)
- More ...