In 1980, Kesten showed the exponential decay of percolation probability in the subcritical phase for the two-dimensional percolation model. This result implies his celebrated computation that pc = 0.5 for bond percolation in the square lattice, and site percolation in the triangular lattice, respectively. In this paper, we present a simpler proof for Kesten’s theorem.

A percolation model is an infinite random graph model for phase transitions and critical phenomena. The percolation threshold corresponds to a phase transition point, such as a melting or freezing temperature. The exact value of the percolation threshold is not known for any three-dimensional percolation models, which are important for physical applications. Furthermore, rigorous bounds for the...

The aim of this paper is to generalize the well-known asymptotic shape result for first-passage percolation on Zd to first-passage percolation on a random environment given by the infinite cluster of a supercritical Bernoulli percolation model. We prove the convergence of the renormalized set of wet points to a deterministic shape that does not depend on the random environment. As a special cas...

In recent years, many variants of percolation have been used to study network structure and the behavior of processes spreading on networks. These include bond percolation, site percolation, k-core percolation, bootstrap percolation, the generalized epidemic process, and the Watts threshold model (WTM). We show that-except for bond percolation-each of these processes arises as a special case of...

Consider the following process, known as r-bootstrap percolation, on a graph G. Designate some initial infected set A and infect any vertex with at least r infected neighbors, continuing until no new vertices can be infected. We say A percolates if it eventually infects the entire graph. We say A is a minimal percolating set if A percolates, but no proper subset percolates. We compute the size ...

Five methods to assess percolation rate from alternative earthen final covers (AEFCs) are described in the context of the precision with which the percolation rate can be estimated: trend analysis, tracer methods, water balance method, Darcy’s Law calculations, and lysimetry. Trend evaluation of water content data is the least precise method because it cannot be used alone to assess the percola...

We consider a type of dependent percolation introduced in [2], where it is shown that certain “enhancements” of independent (Bernoulli) percolation, called essential, make the percolation critical probability strictly smaller. In this paper we first prove that, for two-dimensional enhancements with a natural monotonicity property, being essential is also a necessary condition to shift the criti...

Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating cluster may actively induce its inside neighbours to exit the percolating cluster. Here we study this inducing effect on the classical site percolation and K-core percolation, showing that the inducing effect always ca...

Inhomogeneous percolation, for its closer relationship with real-life, can be more useful and reasonable than homogeneous percolation to illustrate the critical phenomena and dynamical behaviour of complex networks. However, due to its intricacy, the theoretical framework of inhomogeneous percolation is far from being complete and many challenging problems are still open. In this paper, we firs...

A novel form of percolation is considered which is motivated by models of the displacement of one fluid by another from a porous medium. The physical idea is that if the displaced phase is incompressible, then regions of it which are surrounded by the displacing fluid become ‘trapped’ and cannot subsequently be invaded. We thus consider a new percolation process, ‘percolation with trapping’, in...