Sourav Chatterjee (1.2) Method for lower bounds on fluctuations of random variables, part 1.2
Channel: IAS | Park City Mathematics Institute | PCMI
Date: 2017-06-28

There are numerous ways of establishing upper bounds on fluctuations of random variables, but there is no systematic approach for lower bounds. As a result, lower bounds are unknown in many important problems. I will talk about a general method for lower bounds on fluctuations. The method gives new results for the stochastic traveling salesman problem, the stochastic minimal matching problem, the random assignment problem, the Sherrington--Kirkpatrick model of spin glasses, first passage percolation and random matrices. I will discuss some of these examples.

Research Problem presented at the 27th Annual PCMI Summer Session, Random Matrices, held June 25 – July 15, 2017. The residential, three-week Summer Session is the flagship activity of the IAS/Park City Mathematics Institute (PCMI).

The Institute for Advanced Study / IAS / Park City Mathematics Institute (PCMI) is designed for mathematics educators at the secondary and post-secondary level, as well as mathematics researchers and students at the post-secondary level. These groups find at PCMI an intensive mathematical experience geared to their individual needs. Moreover, the interaction among groups with different backgrounds and professional needs increases each participant’s appreciation of the mathematical community as a whole as well as the work of participants in different areas.

For more information, visit https://pcmi.ias.edu