Skip to content

DAN

Seminar

High frequency criteria for Boolean functions (with an application to percolation)

Garban, C (ENS Lyon)
Thursday 31 March 2011, 16:30-17:30

Seminar Room 1, Newton Institute

Abstract

Assume you are given a certain Boolean function f: {0,1}^n -> {0,1} and you are suspecting that it is a ``high frequency'' one. It is a non-trivial problem to localize at a `low cost' where the ``Spectral mass'' lies. Of course, one could compute the Fourier-Walsh coefficients one at a time, but in the generic case this would take forever and this is the kind of techniques we are trying to avoid by looking for a `low cost' criterion.

In this talk, I will survey different criteria or techniques which enables one to detect whether a Boolean function is of high frequency or not.

To give an example of such a criterion, the first result in this direction is due to Benjamini, Kalai and Schramm. It states that if the Boolean function f is such that its individual influences are ``small'' (in a precise L^2 way), then the function has to be of high frequency with a quantitative bound on how high the spectrum is.

Most of these criteria have been discovered while analyzing the percolation case. Indeed any geometrical event about configurations of percolation can be written as a Boolean function where each ``bit'' determines whether its corresponding edge (or site) is open or closed. It turns out that at criticality, these Boolean functions are of very high frequency. In other words, percolation is very sensitive to small perturbations at the critical point. Since it is very hard to compute all the Fourier coefficients of such functions, several tools have been developed in the literature to understand the Fourier spectrum of percolation. Interestingly, most of these tools can be simply stated and are not specifically designed for percolation.

Therefore, the purpose of this talk will be to expose these criteria in an accessible way, with the hope that some of them could be used elsewhere.

Video

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧