Collisions among random walks on a graph
SIAM Journal on Discrete Mathematics
Dependent percolation and colliding random walks
Random Structures & Algorithms
The Clairvoyant Demon Has a Hard Task
Combinatorics, Probability and Computing
Compatible Sequences and a Slow Winkler Percolation
Combinatorics, Probability and Computing
Hi-index | 0.00 |
Let ai,bi, i = 0, 1, 2,… be drawn uniformly and independently from the unit interval, and let t be a fixed real number. Let a site (i, j) ε ℕ2 be open if ai + bj ≤ t, and closed otherwise. We obtain a simple, exact expression for the probability Θ(t) that there is an infinite path (oriented or not) of open sites, containing the origin. Θ(t) is continuous and has continuous first derivative except at the critical point (t=1), near which it has critical exponent (3 - √5 /2.