In this article, we focus on Bernoulli percolation and mainly investigate bounds of the probability of the connectivity of 0 to the distance n. At first, we give a rough bound of the probability, and then refine our result by the high-dimensional RSW theory, which gives a nontrivial bound for a short crossing in ℤ𝒅, as well as the renormalization method. We finish the last step of this section by coupling. Next, we give a more refined bound in ℤ𝟐 using the dual graph. At last, we investigate the behaviors of some subgraphs of ℤ𝟐. The work done and conclusions made in this article are fundamental in percolation theory. The purpose of this article is to introduce Bernoulli percolation in a relatively thorough way to the beginners of percolation theory and provide some insights into different proofs of basic conclusions.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.