Percolation of finite clusters and shielded paths
arXiv:1811.01678
Abstract
In independent bond percolation on with parameter , if one removes the vertices of the infinite cluster (and incident edges), for which values of does the remaining graph contain an infinite cluster? Grimmett-Holroyd-Kozma used the triangle condition to show that for , the set of such contains values strictly larger than the percolation threshold . With the work of Fitzner-van der Hofstad, this has been reduced to . We improve this result by showing that for and some , there are infinite paths consisting of "shielded" vertices --- vertices all whose adjacent edges are closed --- which must be in the complement of the infinite cluster. Using numerical values of , this bound can be reduced to . Our methods are elementary and do not require the triangle condition.
arXiv comment23 pages. Slightly shortened title. The dimension condition of the main result has been reduced from to