Seminar
| Parent Program: | |
|---|---|
| Location: | SLMath: Eisenbud Auditorium |
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
How big is the entropy of a random vector? The Gaussian log-Sobolev inequality gives one answer but it is not always optimal. If a signal is transmitted through a noisy channel how much information can be extracted about the original signal? We show how these two questions are connected and how basic tools from Statistics/Signal Processing appear (sometimes in disguise) in the field of geometric and functional inequalities. Along the way we will make use of stochastic methods. (Ongoing work with Ramon van Handel.)
No Notes/Supplements Uploaded No Video Files Uploaded