RT - Journal Article
T1 - A Further Note on Runs in Independent Sequences
JF - JIRSS
YR - 2005
JO - JIRSS
VO - 4
IS - 1
UR - http://jirss.irstat.ir/article-1-125-en.html
SP - 51
EP - 56
K1 - Finite alphabet
K1 - independent sequences
K1 - longest runs.
AB - Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (1987), a conjecture of a previous paper (Smythe, 2003) concerning the expectation of this length is verified.
LA eng
UL http://jirss.irstat.ir/article-1-125-en.html
M3
ER -