Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T00:10:31.947Z Has data issue: false hasContentIssue false

Entropy inequalities for classes of probability distributions I. The univariate case

Published online by Cambridge University Press:  01 July 2016

Samuel Karlin*
Affiliation:
Stanford University
Yosef Rinott*
Affiliation:
Stanford University
*
∗ Postal address: Department of Mathematics, Stanford University, Stanford CA 94305, U.S.A.
∗ Postal address: Department of Mathematics, Stanford University, Stanford CA 94305, U.S.A.

Abstract

Entropy functionals of probability densities feature importantly in classifying certain finite-state stationary stochastic processes, in discriminating among competing hypotheses, in characterizing Gaussian, Poisson, and other densities, in describing information processes, and in other contexts. Two general types of problems are considered. For a given parametric family of densities the member of maximal (or sometimes minimal) entropy is ascertained. Secondly, we determine a natural (partial) ordering over for which the entropy functional is monotone. The examples include the multiparameter binomial, multiparameter negative binomial, some classes of log concave densities, and others.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1981 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable