A density version for H\"aggstr\"om's theorem
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?
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.