Mathematics – Probability
Scientific paper
2003-02-06
Combinatorics, Probability and Computing 9 (2000) 421-424
Mathematics
Probability
3 pages
Scientific paper
For some m \ge 4, let us color each column of the integer lattice L = Z^2 independently and uniformly into one of m colors. We do the same for the rows, independently from the columns. A point of L will be called blocked if its row and column have the same color. We say that this random configuration percolates if there is a path in L starting at the origin, consisting of rightward and upward unit steps, and avoiding the blocked points. As a problem arising in distributed computing, it has been conjectured that for m \ge 4, the configuration percolates with positive probability. This has now been proved (in a later paper), for large m. Here, we prove that the probability that there is percolation to distance n but not to infinity is not exponentially small in n. This narrows the range of methods available for proving the conjecture.
No associations
LandOfFree
The Clairvoyant Demon Has a Hard Task does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Clairvoyant Demon Has a Hard Task, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Clairvoyant Demon Has a Hard Task will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-99713