03.12.2012 Views

PERCOLATION AND DISORDERED SYSTEMS Geoffrey GRIMMETT

PERCOLATION AND DISORDERED SYSTEMS Geoffrey GRIMMETT

PERCOLATION AND DISORDERED SYSTEMS Geoffrey GRIMMETT

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

278 <strong>Geoffrey</strong> Grimmett<br />

If A(q) < 1 (which holds for sufficiently large q), then<br />

φ 1 B,p,q(0 ↔ ∂B) = φ 1 � �<br />

B,p,q OC(Γ) occurs for no Γ<br />

≥ 1 − A(q) > 0.<br />

(We have used the assumption of wired boundary conditions here.) This<br />

implies, by taking the limit n → ∞, that θ1 (p, q) > 0 when p = √ q/(1 +<br />

√<br />

q). Using (13.39), this implies parts (a) and (b) of the theorem, when q is<br />

sufficiently large.<br />

For general q > Q, we have only that A(q) < ∞. In this case, we find N<br />

(< n) such that<br />

�<br />

Γ outside B(N)<br />

φ 1 � �<br />

1<br />

B,p,q OC(Γ) < 2<br />

where Γ is said to be outside B(N) if it contains B(N) in its interior. This<br />

implies that φ1 � �<br />

1<br />

B,p,q B(N) ↔ ∂B ≥ 2 . Let n → ∞, and deduce that<br />

φ1 � �<br />

1<br />

p,q B(N) ↔ ∞ ≥ 2 , implying that θ1 (p, q) > 0 as required.<br />

Turning to part (c) 12 , let p = pd = √ q/(1 + √ q) and n ≤ r. Let An<br />

be the (cylinder) event that the point ( 1 1<br />

2 , 2 ) lies in the interior of an open<br />

circuit of length at least n, this circuit having the property that its interior<br />

is contained in the interior of no open circuit having length strictly less than<br />

n. We have from (13.36) and (13.45) that<br />

(13.46) φ 0 B(r),p,q (An) ≤<br />

∞�<br />

m=n<br />

mam<br />

q<br />

�<br />

q<br />

(1 + √ q) 4<br />

� m/4<br />

for all large r.<br />

[Here, we use the observation that, if An occurs in B(r), then there exists<br />

a maximal open circuit Γ of B(r) containing ( 1 1<br />

2 , 2 ). In the dual of B(r), Γ<br />

constitutes an outer circuit.]<br />

We write LRn for the event that there is an open crossing of the rectangle<br />

Rn = [0, n] ×[0, 2n] from its left to its right side, and we set λn = φ0 p,q (LRn).<br />

We may find a point x on the left side of Rn and a point y on the right side<br />

such that<br />

φ 0 p,q (x ↔ y in Rn)<br />

λn<br />

≥ .<br />

(2n + 1) 2<br />

By placing six of these rectangles side by side (as in Figure 13.4), we find by<br />

the FKG inequality that<br />

(13.47) φ 0 p,q<br />

�<br />

� �<br />

x ↔ x + (6n, 0) in [0, 6n] × [0, 2n] ≥<br />

λn<br />

(2n + 1) 2<br />

� 6<br />

.<br />

12 The present proof was completed following a contribution by Ken Alexander, see [36]<br />

for related material.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!