Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Rényi entropy and variance comparison for symmetric log-concave random variables (2108.10100v2)

Published 23 Aug 2021 in cs.IT, math.IT, and math.PR

Abstract: We show that for any $\alpha>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 $\alpha \in (0,\alpha*]$ and the second case for $\alpha \in [\alpha*,\infty)$, where $\alpha*$ satisfies the equation $\frac{1}{\alpha*-1}\log \alpha*= \frac12 \log 6$, that is $\alpha* \approx 1.241$. Using those results, we prove that one-sided exponential distribution minimizes R\'enyi entropy of order $\alpha \geq 2$ among all log-concave random variables with fixed variance.

Citations (9)

Summary

We haven't generated a summary for this paper yet.