Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rényi entropy and variance comparison for symmetric log-concave random variables

Published 23 Aug 2021 in cs.IT, math.IT, and math.PR | (2108.10100v2)

Abstract: We show that for any $\alpha&gt;0$ the R\'enyi entropy of order α\alpha is minimized, among all symmetric log-concave random variables with fixed variance, either for a uniform distribution or for a two sided exponential distribution. The first case occurs for α∈(0,α<sup>∗]\alpha \in (0,\alpha<sup>*] and the second case for α∈[α<sup>∗,∞)\alpha \in [\alpha<sup>*,\infty), where α<sup>∗\alpha<sup>* satisfies the equation 1α<sup>∗−1log⁡</sup>α<sup>∗=</sup>12log⁡6\frac{1}{\alpha<sup>*-1}\log</sup> \alpha<sup>*=</sup> \frac12 \log 6, that is α<sup>∗</sup>≈1.241\alpha<sup>*</sup> \approx 1.241. Using those results, we prove that one-sided exponential distribution minimizes R\'enyi entropy of order α≥2\alpha \geq 2 among all log-concave random variables with fixed variance.

Citations (9)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.