Range of cube-indexed random walk (Q5951488)

For the Hamming cube \(G\), that is \(\{0,1\}^{n}\) with the usual adjacency, one denotes by \(\mathcal F\) the set of graph homomorphisms from \(G\) to \(\mathbb Z\) normalized to vanish at 0. The author proves that there is a fixed \(b\) such that if \(f\) is chosen uniformly from \(\mathcal F\), the probability that \(f\) takes more than \(b\) values is at most \(e^{-\Omega(n)}\) [see also a conjecture of \textit{I. Benjamini, O. Häggström} and \textit{E. Mossel}, J. Comb. Theory, Ser. B 78, No.~1, 86-114 (2000)].