{"id":"openai-math/No-percolation-at-criticality-on-quasi-transitive-graphs","pdf":"https://github.com/openai/math/blob/main/preprints/No-percolation-at-criticality-on-quasi-transitive-graphs-September-24-2026/paper.pdf","url":"https://github.com/openai/math/tree/main/preprints/No-percolation-at-criticality-on-quasi-transitive-graphs-September-24-2026","tags":["probability","percolation","quasi-transitive-graphs"],"score":0,"title":"No percolation at criticality on quasi-transitive graphs","domain":"Probability and statistical mechanics","family":"213","origin":"ai-generated","source":"openai-math","authors":["OpenAI"],"reviews":0,"subject":"math.PR","summary":"We prove that critical Bernoulli bond percolation has no infinite cluster on any infinite connected locally finite quasi-transitive graph with critical probability less than one. This resolves the bond form of the criticality conjecture of Benjamini and Schramm.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-09-24","reactions":{},"formalized":false,"family_title":"Critical percolation on every quasi-transitive graph"}