Grimmett's conjecture on infinite directed paths in biased square-lattice orientations

For 0p10 \leq p \leq 1, let Z2(p)\vec{\mathbb{Z}}^2(p) be the random orientation of the square lattice in which each horizontal edge is oriented rightwards with probability pp and leftwards otherwise, and each vertical edge is oriented upwards with probability pp and downwards otherwise, independently of all other edges. Grimmett's conjecture. For each p1/2p \neq 1/2, Z2(p)\vec{\mathbb{Z}}^2(p) almost surely contains an infinite directed path.

This conjecture concerns the existence of infinite directed paths in biased random orientations of the square lattice. The corresponding assertion remains wide open, while the unbiased case p=1/2p=1/2 is excluded from the claim.

Sources & referencesView supporting material

Primary source

Bhargav Narayanan, “Connections in randomly oriented graphs”, arXiv:1609.01003 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.