A proof of the Shepp-Olkin entropy monotonicity conjecture

DOI10.1214/19-EJP380WikidataQ123274671 ScholiaQ123274671MaRDI QIDQ2279321

Oliver Johnson, Erwan Hillion

Publication date: 12 December 2019

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.09791

zbMATH Keywords

entropyfunctional inequalitiesPoisson-binomial distributionmixing coefficients

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Measures of information, entropy (94A17)

Related Items (2)

Bernoulli sums and Rényi entropy inequalities ⋮ On the Maximum Entropy of a Sum of Independent Discrete Random Variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete versions of the transport equation and the Shepp-Olkin conjecture
• Concavity of entropy along binomial convolutions
• Convex entropy decay via the Bochner-Bakry-Emery approach
• A discrete log-Sobolev inequality under a Bakry-Émery type condition
• Possible generalization of Boltzmann-Gibbs statistics.
• A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
• A proof of the Shepp-Olkin entropy concavity conjecture
• Iterated sequences and the geometry of zeros
• Maximizing the entropy of a sum of independent bounded random variables
• On the Maximum Entropy Properties of the Binomial Distribution
• Entropy inequalities for classes of probability distributions I. The univariate case
• Binomial and Poisson distributions as maximum entropy distributions
• Analysis and Geometry of Markov Diffusion Operators

This page was built for publication: A proof of the Shepp-Olkin entropy monotonicity conjecture