Monotonicity of entropy and Fisher information: a quick proof via maximal correlation
From MaRDI portal
Publication:2356799
Abstract: A simple proof is given for the monotonicity of entropy and Fisher information associated to sums of i.i.d. random variables. The proof relies on a characterization of maximal correlation for partial sums due to Dembo, Kagan and Shepp.
Recommendations
- Solution of Shannon’s problem on the monotonicity of entropy
- Maximal correlation and monotonicity of free entropy and of Stein discrepancy
- A free analogue of Shannon's problem on monotonicity of entropy
- Shannon's monotonicity problem for free and classical entropy
- Partial monotonicity of entropy revisited
Cited in
(9)- Maximal correlation and monotonicity of free entropy and of Stein discrepancy
- Existence of Stein kernels under a spectral gap, and discrepancy bounds
- Monotonic Decrease of the Non-Gaussianness of the Sum of Independent Random Variables: A Simple Proof
- Maximum Entropy Reconstruction Using Derivative Information, Part 1: Fisher Information and Convex Duality
- Monotonicity of the logarithmic energy for random matrices
- Rates of Fisher information convergence in the central limit theorem for nonlinear statistics
- On the maximal correlation of some stochastic processes
- Monotonicity of the von Neumann entropy under quantum convolution
- Toward optimal convergence rates for the quantum central limit theorem
This page was built for publication: Monotonicity of entropy and Fisher information: a quick proof via maximal correlation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2356799)