Percolation of finite clusters and shielded paths

From MaRDI portal
Publication:2183160




Abstract: In independent bond percolation on mathbbZd with parameter p, if one removes the vertices of the infinite cluster (and incident edges), for which values of p does the remaining graph contain an infinite cluster? Grimmett-Holroyd-Kozma used the triangle condition to show that for dgeq19, the set of such p contains values strictly larger than the percolation threshold pc. With the work of Fitzner-van der Hofstad, this has been reduced to dgeq11. We improve this result by showing that for dgeq10 and some p>pc, 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 pc, this bound can be reduced to dgeq7. Our methods are elementary and do not require the triangle condition.









This page was built for publication: Percolation of finite clusters and shielded paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183160)