Strong-connectivity threshold conjecture for bidirected percolation
Let be an infinite, locally finite, transitive graph. Replace each undirected edge of by two oppositely directed edges, independently declaring each directed edge open with probability . Let be the usual Bernoulli bond-percolation threshold, and let be the infimum of the values of for which there exists almost surely an infinite strongly connected cluster, meaning an infinite set of vertices such that every pair is mutually reachable by open directed paths. The conjecture is that
equivalently, for every transitive non-amenable graph .
References
- Percolation on Bidirected Graphs — arXiv — Yucheng Liu, Leonardo T. Rolla, Yuliang Shi
Source: arXiv
Progress summary
A new unrefereed paper reports the predicted threshold equality for amenable graphs and separation for spread-out non-amenable ones, but leaves the general non-amenable case open.
The conjecture concerns how strong connectivity in bidirected percolation compares with ordinary percolation across transitive graphs. The latest work separates the amenable and non-amenable regimes without settling the full conjecture.
October 2026 development
Yucheng Liu, Leonardo T. Rolla, and Yuliang Shi report that the threshold equality holds for every transitive amenable graph, while strict separation holds for sufficiently spread-out modifications of every transitive non-amenable graph. The preprint is unrefereed and does not settle every transitive non-amenable graph.
Current status (as of October 2026): The amenable case and a spread-out non-amenable subclass are claimed established, while the full transitive non-amenable case remains open.
Sources
Solutions 0
No solutions have been posted yet.