Uniqueness and full coverage in k-neighbor graphs
math.PR
Submitted: 2026-11-04
Updated: 2026-11-04
Comments: 25 pages, 6 figures
Code: https://github.com/nitromannitol/percolation-after-anthropic
License: http://creativecommons.org/licenses/by-nc-sa/4.0/
The gist: We study the number of infinite clusters in the 2dp-neighbor graph on Z d, d at least2, in which every vertex independently selects 2dp of its nearest neighbors uniformly at random…
Terminology
Abstract
We study the number of infinite clusters in the 2dp-neighbor graph on Z d, d at least2, in which every vertex independently selects 2dp of its nearest neighbors uniformly at random, and one more with probability 2dp- 2dp. The model has negatively correlated edges and, for 1 at most2dp at most2d-1, neither finite energy nor insertion or deletion tolerance. We prove that the undirected graph has at most one infinite cluster for every p in [0,1], and that in the planar case the same holds for forward and strong forward clusters of the directed graph when p in[1/2,1]. We further exhibit a second phase transition: for p at least(d+1)/(2d) the open cluster of the origin is almost surely the whole lattice, and for p>(d+1)/(2d) any two vertices of a box are connected inside the box of twice the size with probability exponentially close to one. In particular, the percolation function is continuous but not analytic on the supercritical interval (p c,1]. Finally, we prove that the full-coverage phase transition at p f = (d+1)/2d is of order 2 d.
Sources
- The Planar Lattice Two-Neighbor Graph Percolates
- On the proof of the Kozma-Nitzan conjecture
- Connected components and topological ends of stationary planar forests
- A reduction of the $\theta(p_c) = 0$ problem to a conjectured inequality
- Uniqueness of the infinite cluster for monotone percolation models without insertion tolerance
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Repeated averaging on random d-regular graphs
- Precise cover times for branching random walks on Hamming graphs: (iterated) logarithmic corrections
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves