Two-neighbor directed percolation in all dimensions conjecture
Two-neighbor directed percolation in all dimensions conjecture
For each , let the -DnG be the directed -neighbor graph on , and let be its percolation probability. Two-neighbor directed percolation conjecture. The -DnG percolates in all dimensions . Numerical simulations support the claim, and it would settle the open two-dimensional case together with the higher-dimensional cases; 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
Sign in to submit a solution.
No solutions have been posted yet.