You might try using analysis of Boolean functions whenever you’re faced with a problems involving Boolean strings in which both the uniform probability distribution and the Hamming graph structure play a role. More generally, the tools may still apply when studying functions on (or subsets of) product probability spaces. If you’re mainly interested in [...]

## Recent comments

Ohad Klein: 41a (45a in book): "let T be ...; prove something about f" ...Ryan O'Donnell: Good catch, thank you Xi.Ryan O'Donnell: Thank you! Sorry for the delay in replying.Ryan O'Donnell: Hi Ming. Here S stands for a fixed (non-random) subset of [...Xi Wu: typo: "our definition of $\mathbf{Inf}_i[f]$ from Chapter 2....Chengyu: Ex 2.c It should be "Suppose ... is an LTF with $\textbf{E}...Ming: I confuse the notation S in Fact 1.7. I wonder that the sym...