Approximate factorization from a small two-terminal connection probability
Approximate factorization from a small two-terminal connection probability
Let , , and be vertices, and let , , , and denote the corresponding bond-percolation event probabilities. Second conjecture. For any there exists such that if , then
This is the stronger of the two proposed stability statements, refining the exact factorization proved when ; its status is left open in the source.
Sources & referencesView supporting material
Primary source
Nikita Gladkov and Aleksandr Zimin, “Bond percolation does not simulate site percolation”, arXiv:2404.08873 (2026).
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.