Strict monotonicity conjecture for X-neighbor percolation

Let θX(k,d)\theta^{\rm X}(k,d) denote the percolation probability of the kk-X-neighbor graph on Zd\mathbb{Z}^d. X-neighbor monotonicity conjecture. For fixed dd, the map kθX(k,d)k\mapsto\theta^{\rm X}(k,d) is strictly increasing on k{2,,d}k\in\{2,\ldots,d\}. The conjecture is motivated by the increasing single-edge probability and negative correlations, but the authors are unaware of a coupling between different kk-XnG models; 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.