Coursera Plus Annual is 40% Off — Ends July 6.

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Concentration Functions and Entropy Bounds for Discrete Log-Concave Distributions

Hausdorff Center for Mathematics via YouTube

Start learning Write review
Coursera Ad

Learn AI, Data Science & Business — Earn Certificates That Get You Hired

Learn More → University of the People Ad

Earn Your Business Degree, Tuition-Free, 100% Online!

Learn More →

Overview

AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore concentration functions and entropy bounds for discrete log-concave distributions in this 44-minute lecture. Delve into two-sided bounds and their applications in deriving variants of entropy power inequalities. Learn about the collaborative research conducted with Arnaud Marsiglietti and James Melbourne, focusing on Renyi entropies within the class of discrete log-concave probability distributions.

Syllabus

Sergey Bobkov: Concentration functions and entropy bounds for discrete log-concave distributions

Taught by

Hausdorff Center for Mathematics

Reviews

Start your review of Concentration Functions and Entropy Bounds for Discrete Log-Concave Distributions

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.