Application of Smirnov Words to Waiting Time Distributions of Runs
英文摘要:
Consider infinite random words over a finite alphabet where the letters occur as an i.i.d. sequence according to some arbitrary distribution on the alphabet. The expectation and the variance of the waiting time for the first completed $h$-run of any letter (i.e., first occurrence of $h$ subsequential equal letters) is computed. The expected waiting time for the completion of $h$-runs of $j$ arbitrary distinct letters is also given.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。