Compatible sequences and a slow Winkler percolation

Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question of Peter Winkler, we show that if the two 0-1-sequences are random i.i.d. and independent from each other, with probability p of 1's, then if p is sufficiently small they are compatible with positive probability. The question is equivalent to a certain dependent percolation with a power-law behavior: the probability that the origin is blocked at distance n but not closer decreases only polynomially fast and not, as usual, exponentially.

[1]  Péter Gács.  The Clairvoyant Demon Has A Hard Task , 2000, Comb. Probab. Comput..

[2]  Peter Winkler.  Dependent percolation and colliding random walks , 2000, Random Struct. Algorithms.

[3]  Péter Gács.  Clairvoyant scheduling of random walks , 2002, STOC '02.

[4]  David Reimer,et al.  Proof of the Van den Berg–Kesten Conjecture , 2000, Combinatorics, Probability and Computing.

[5]  M. Karonski.  Collisions among Random Walks on a Graph , 1993 .

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7]  Béla Bollobás,et al.  Dependent percolation in two dimensions , 2000 .