Grimmett's conjecture on infinite directed paths in biased square-lattice orientations
Grimmett's conjecture on infinite directed paths in biased square-lattice orientations
For , let be the random orientation of the square lattice in which each horizontal edge is oriented rightwards with probability and leftwards otherwise, and each vertical edge is oriented upwards with probability and downwards otherwise, independently of all other edges. Grimmett's conjecture. For each , 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 is excluded from the claim.
Sources & referencesView supporting material
Primary source
Bhargav Narayanan, “Connections in randomly oriented graphs”, arXiv:1609.01003 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.