A density version for H\"aggstr\"om's theorem
classification
🧮 math.PR
keywords
densityopenaggstralongalwaysbiggeredgeedges
read the original abstract
Given invariant percolation on a regular tree, where the probability of an edge to be open equals $p$, is it always possible to find an infinite self-avoiding path along which the density of open edges is bigger then $p$?
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.