Two-dimensional directed 2-neighbor percolation conjecture

Let θD(k,d)\theta^{\rm D}(k,d) denote the probability that the origin belongs to an infinite directed cluster in the directed kk-neighbor graph on Zd\mathbb{Z}^d. Directed 2-neighbor percolation conjecture.

θD(2,2)>0.\theta^{\rm D}(2,2)>0.

This is one of the principal unresolved cases; the authors suggest that a Peierls argument might prove it, but it remains open.

Sources & referencesView supporting material

Primary source

Benedikt Jahnel, Jonas Köppl, Bas Lodewijks and András Tóbiás, “Percolation in lattice k-neighbor graphs”, arXiv:2306.14888 (2024).

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.