REVIEW
A density version for H\"aggstr\"om's theorem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
classification
math.PR
keywords
densityopenaggstralongalwaysbiggeredgeedges
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$?
Discussion (0). Continue with ORCID to comment.