Supercritical percolation on nonamenable graphs: isoperimetry, analyticity, and exponential decay of the cluster size distribution
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract Let G be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on G . We prove that if G is nonamenable and $$p > p_c(G)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mo>></mml:mo> <mml:msub> <mml:mi>p</mml:mi> <mml:mi>c</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>G</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math> then there exists a positive constant $$c_p$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>c</mml:mi> <mml:mi>p</mml:mi> </mml:msub> </mml:math> such that $$\begin{aligned} \mathbf {P}_p(n \le |K| < \infty ) \le e^{-c_p n} \end{aligned}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mtable> <mml:mtr> <mml:mtd> <mml:mrow> <mml:msub> <mml:mi>P</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>≤</mml:mo> <mml:mo>|</mml:mo> <mml:mi>K</mml:mi> <mml:mo>|</mml:mo> <mml:mo><</mml:mo> <mml:mi>∞</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>≤</mml:mo> <mml:msup> <mml:mi>e</mml:mi> <mml:mrow> <mml:mo>-</mml:mo> <mml:msub> <mml:mi>c</mml:mi> <mml:mi>p</mml:mi> </mml:msub> <mml:mi>n</mml:mi> </mml:mrow> </mml:msup> </mml:mrow> </mml:mtd> </mml:mtr> </mml:mtable> </mml:mrow> </mml:math> for every $$n\ge 1$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> , where K is the cluster of the origin. We deduce the following two corollaries: Every infinite cluster in supercritical percolation on a transitive nonamenable graph has anchored expansion almost surely. This answers positively a question of Benjamini et al. (in: Random walks and discrete potential theory (Cortona, 1997), symposium on mathematics, XXXIX, Cambridge University Press, Cambridge, pp 56–84, 1999). For transitive nonamenable graphs, various observables including the percolation probability, the truncated susceptibility, and the truncated two-point function are analytic functions of p throughout the supercritical phase.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it