SearcharxivSearch

arXiv · 1309.2273

A Russo Seymour Welsh Theorem for critical site percolation on \(\mathbb{Z}^2\)

Abstract

The Russo-Seymour-Welsh Theorem for Z^2 bond or T (triangular lattice) site percolation states that at criticality, for all fixed real λ, the probability of the existence of a horizontal occupied crossing of each rectangle with size n*λn is not degenerated when n tends to infinity. Turning to site percolation on Z^2, where the self duality does not hold anymore, we prove that the analogue statement of the RSW Theorem will still be true in this case. The proof uses appropriate finite size criteria and a result of Kesten which allows us to extend existing crossings without losing too much probability. As a consequence, there is no infinite cluster at criticalty. Our object in this short paper is twofold. Our first goal is to give a proof of a RSW Theorem for Z 2 site percolation. Since the proof uses in an essential way a celebrated result by Kesten on the so called "box crossing", our second goal in this paper is to present a self-contained proof of this theorem in perhaps a more accessible language.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiaolin Zeng. 2013-09-09. A Russo Seymour Welsh Theorem for critical site percolation on \(\mathbb{Z}^2\). https://arxiv.org/abs/1309.2273

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR