2000 character limit reached
Monotonicity of Entropy and Fisher Information: A Quick Proof via Maximal Correlation
Published 13 Oct 2016 in cs.IT, math.IT, and math.PR | (1610.04174v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
