Strong Consistency of the Good-Turing Estimator
<|reference_start|>Strong Consistency of the Good-Turing Estimator: We consider the problem of estimating the total probability of all symbols that appear with a given frequency in a string of i.i.d. random variables with unknown distribution. We focus on the regime in which the block length is large yet no symbol appears frequently in the string. This is accomplished by allowing the distribution to change with the block length. Under a natural convergence assumption on the sequence of underlying distributions, we show that the total probabilities converge to a deterministic limit, which we characterize. We then show that the Good-Turing total probability estimator is strongly consistent.<|reference_end|>
@article{wagner2006strong,
    title={Strong Consistency of the Good-Turing Estimator},
    author={Aaron B. Wagner, Pramod Viswanath, and Sanjeev R. Kulkarni},
    journal={arXiv preprint arXiv:cs/0607014},
    year={2006},
    doi={10.1109/ISIT.2006.262066},
    archivePrefix={arXiv},
    eprint={cs/0607014},
    primaryClass={cs.IT math.IT}
}