Scheduling of Non-Colliding Random Walks

On the complete graph K_M with M ≥ 3 vertices consider two independent discrete time random walks X and Y, choosing their steps uniformly at random. A pair of trajectories X = {X₁, X₂, ...} and Y = {Y₁, Y₂, ...} is called non-colliding, if by delaying their jump times one can keep both walks at distinct vertices forever. It was conjectured by P. Winkler that for large enough M the set of pairs of non-colliding trajectories {X, Y} has positive measure. N. Alon translated this problem to the language of coordinate percolation, a class of dependent percolation models, which in most situations is not tractable by methods of Bernoulli percolation. In this representation Winkler’s conjecture is equivalent to the existence of an infinite open cluster for large enough M. In this paper we establish the conjecture building upon the renormalization techniques developed in [4].