A correlation inequality for tree-indexed Markov chains (Q4027477)

[For the entire collection see Zbl 0745.00038.] The following problem is addressed. Suppose \(\Gamma\) is an infinite rooted tree and to each edge of \(\Gamma\) we attach a random sign \(\pm 1\). To each vertex \(\sigma\) of \(\Gamma\) attach the sum \(S(\sigma)\) of these random variables along the unique path connecting \(\sigma\) to the root. How large must \(\Gamma\) be to ensure that almost surely, for all sufficiently large even levels \(2k\) of \(\Gamma\) some vertex \(\sigma\) at level \(2k\) satisfies \(S_ \sigma=0\)? This is resolved by applying a correlation inequality for tree-indexed Markov chains which is proved via a simple convexity consideration.