Seminar Details
Entropy: The Basic Method and Some Quick Applications to Combinatorics
- Start Date: November 13, 2024
- Event Start Time: 12:15 PM
- Event End Time: 1:15 PM
- Seminar Series: Graduate Combinatorics Seminar
- Presenter(s): Caleb Fong - Rutgers University
- Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
- Event Additional Info: <p>See: <a href="https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html">https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html</a></p>
- Presentation Type: Stand Alone Presentation
- 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.
