Strict monotonicity conjecture for X-neighbor percolation
Strict monotonicity conjecture for X-neighbor percolation
Let denote the percolation probability of the -X-neighbor graph on . X-neighbor monotonicity conjecture. For fixed , the map is strictly increasing on . The conjecture is motivated by the increasing single-edge probability and negative correlations, but the authors are unaware of a coupling between different -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
Sign in to submit a solution.
No solutions have been posted yet.