University of Cambridge > Talks.cam > Information Theory Seminar > On the monotonicity of entropy in the discrete entropic central limit theorem

On the monotonicity of entropy in the discrete entropic central limit theorem

Add to your list(s) Download to your calendar using vCal

  • UserMr Lampros Gavalakis, University of Cambridge
  • ClockWednesday 26 October 2022, 14:00-15:00
  • HouseMR5, CMS Pavilion A.

If you have a question about this talk, please contact Dr Ramji Venkataramanan.

In this talk, we discuss the entropic central limit theorem (CLT) and the entropy power inequality (EPI) for discrete random variables. First, we formulate an analogue of what is known as the entropic central limit theorem for lattice random variables. We will mention the key ideas behind a proof of the CLT in this setting using entropy.

Secondly, we present some recent progress towards a conjecture of Tao (2010), which can be seen as a generalised analogue of the EPI in the discrete setting. In particular, we show that this conjecture is true for log-concave random variables on the integers and discuss the connection between this result and the discrete entropic CLT .

This talk is part of the Information Theory Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2023 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity