Quenched Voronoi percolation

Resumen:

 In a seminal work from 1999, Benjamini, Kalai and Schramm introduced a
framework for studying sensitivity of Boolean functions with respect
to small portions of noise. They moreover made a series of conjectures
that have been highly influential for the development since. We will
in this talk discuss the solution to one of these conjectures,
concerning Voronoi percolation: Position a large number of points in
the unit square and consider their Voronoi tessellation. Next, colour
each cell either red or blue. The question is whether from observing
the tessellation, but not the colouring, will help us in guessing
whether the colouring will produce a horizontal red crossing or not?
We prove this is not the case.

Posted on Jan 9, 2015 in Núcleo Modelos Estocásticos de Sistemas Complejos y Desordenados, Seminars