Relative Fisher information of discrete classical orthogonal polynomials
Abstract
The analytic information theory of discrete distributions was initiated in 1998 by C. Knessl, P. Jacquet and S. Szpankowski who addressed the precise evaluation of the Renyi and Shannon entropies of the Poisson, Pascal (or negative binomial) and binomial distributions. They were able to derive various asymptotic approximations and, at times, lower and upper bounds for these quantities. Here we extend these investigations in a twofold way. First, we consider a much larger class of distributions, the Rakhmanov distributions n(x)=ω(x)yn2(x), where \yn(x)\ denote the sequences of discrete hypergeometric-type polynomials which are orthogonal with respect to the weight function ω(x) of Poisson, Pascal, binomial and hypergeometric types; that is the polynomials of Charlier, Meixner, Kravchuk and Hahn. Second, we obtain the explicit expressions for the relative Fisher information of these four families of Rakhmanov distributions with respect to their respective weight functions.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.