A density version for Häggström's theorem
arXiv:1702.04688
Abstract
Given invariant percolation on a regular tree, where the probability of an edge to be open equals , is it always possible to find an infinite self-avoiding path along which the density of open edges is bigger then ?