Past Events
Entropy: the basic method and some quick applications to combinatorics.
Caleb Fong
Location: HLL-701
Date & time: Wednesday, 13 November 2024 at 12:15PM - 1:15PM
Abstract: The entropy of a random variable is a quantity that represents 'the average amount of surprise' in observing an outcome. Originally introduced by Claude Shannon as a tool for studying communications and information theory, entropy methods have in the past few decades also found a permanent(!) home in the world of probabilistic combinatorics. This talk will assume no background, so we will spend some time on the basics. (See Galvin's tutorial notes if you want to read ahead: https://arxiv.org/pdf/1406.7872 .)
Special Note to All Travelers
Directions: map and driving directions. If you need information on public transportation, you may want to check the New Jersey Transit page.
Unfortunately, cancellations do occur from time to time. Feel free to call our department: 848-445-6969 before embarking on your journey. Thank you.