Papers
Topics
Authors
Recent
2000 character limit reached

Domains of Attraction on Countable Alphabets

Published 24 Apr 2015 in math.PR | (1504.06558v1)

Abstract: For each probability distribution on a countable alphabet, a sequence of positive functionals are developed as tail indices based on Turing's perspective. By and only by the asymptotic behavior of these indices, domains of attraction for all probability distributions on the alphabet are defined. The three main domains of attraction are shown to contain distributions with thick tails, thin tails and no tails respectively, resembling in parallel the three main domains of attraction, Gumbel, Frechet and Weibull families, for continuous random variables on the real line. In addition to the probabilistic merits associated with the domains, the tail indices are partially motivated by the fact that there exists an unbiased estimator for every index in the sequence, which is therefore statistically observable, provided that the sample is sufficiently large.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.