Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 22, 2016, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Matthew Kwan
Fix a sequence of real numbers, and consider the sum of a random subsequence of these numbers. The classical Erdos-Littlewood-Offord theorem shows that the point probabilities are small for random sums of this form (we thus say such random sums are "anti-concentrated"). Motivated by some questions about random matrices, we are interested in the "resilience" of this anti-concentration. What if we allow an adversary to make small changes to the random subsequence? How big of a change can we allow without the adversary being able to force concentration on a particular value? Joint work with Afonso Bandeira and Asaf Ferber.
Automatic MiSe System Software Version 1.4803M | admin login