Accessibility percolation occurs with positive probability on BGWT trees precisely when θ exceeds an exactly characterized critical value θ_c; on Z^n for n≥2 there is a non-trivial phase transition with explicit bounds on θ_c.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Accessibility Percolation with Rough Mount Fuji labels
Accessibility percolation occurs with positive probability on BGWT trees precisely when θ exceeds an exactly characterized critical value θ_c; on Z^n for n≥2 there is a non-trivial phase transition with explicit bounds on θ_c.