Combinatorial Testing Problems - Lecture 1

Combinatorial Testing Problems - Lecture 1

Explore combinatorial testing problems and their statistical implications in this lecture by Gabor Lugosi from Pompeu Fabra University, part of the TRIAD Distinguished Lecture Series. Delve into the "hidden clique" problem as a prototypical example with a rich structure. Examine various combinatorial testing problems and their connections to high-dimensional random geometric graphs. Investigate the challenge of estimating the mean of a random variable, time permitting. Gain insights into the intersection of statistics and combinatorial structures through this 52-minute presentation delivered on October 15, 2018.