Caleb Fong, Rutgers University

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: https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html