arXiv Analytics

Sign in

arXiv:math/0011008 [math.PR]AbstractReferencesReviewsResources

Compatible sequences and a slow Winkler percolation

Peter Gacs

Published 2000-11-01, updated 2003-01-18Version 5

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.

Comments: 33 pages, 8 figures. Submitted to Combinatorics, Probability and Computing. Some errors corrected
Journal: Combinatorics, Probability and Computing 13 (2004) pp. 815-856
Categories: math.PR, math.CO
Subjects: 82B43, 60K35
Related articles: Most relevant | Search more
arXiv:math/0109152 [math.PR] (Published 2001-09-20, updated 2011-04-18)
Clairvoyant scheduling of random walks
arXiv:math/0210015 [math.PR] (Published 2002-10-01)
Separated-occurrence inequalities for dependent percolation and Ising models
arXiv:0903.4749 [math.PR] (Published 2009-03-27, updated 2009-06-28)
Three problems for the clairvoyant demon