Department of Computer Science | Institute of Theoretical Computer Science | CADMO

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**: OAT S15/S16/S17

**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.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login