AU - Smythe, R. T.
TI - On Runs in Independent Sequences
PT - JOURNAL ARTICLE
TA - JIRSS
JN - JIRSS
VO - 2
VI - 1
IP - 1
4099 - http://jirss.irstat.ir/article-1-93-en.html
4100 - http://jirss.irstat.ir/article-1-93-en.pdf
SO - JIRSS 1
ABĀ - Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.
CP - IRAN
IN -
LG - eng
PB - JIRSS
PG - 43
PT -
YR - 2003