- Series
- School of Mathematics Colloquium
- Time
- Thursday, October 25, 2018 - 11:00am for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Gábor Lugosi – Pompeu Fabra University, Barcelona – http://www.econ.upf.edu/~lugosi/
- Organizer
- Mayya Zhilova
In these lectures we discuss some statistical problems with an interesting combinatorial structure behind. We start by reviewing the "hidden clique" problem, a simple prototypical example with a surprisingly rich structure. We also discuss various "combinatorial" testing problems and their connections to high-dimensional random geometric graphs. Time permitting, we study the problem of estimating the mean of a random variable.