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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

154 <strong>Geoffrey</strong> Grimmett<br />

Fig. 2.2. An open cluster, surrounded by a closed circuit in the dual.<br />

2.4 A Partial Order<br />

There is a natural partial order on Ω, namely ω1 ≤ ω2 if and only if ω1(e) ≤<br />

ω2(e) for all e. This partial order allows us to discuss orderings of probability<br />

measures on (Ω, F). We call a random variable X on (Ω, F) increasing if<br />

X(ω1) ≤ X(ω2) whenever ω1 ≤ ω2,<br />

and decreasing if −X is increasing. We call an event A (i.e., a set in F)<br />

increasing (resp. decreasing) if its indicator function 1A, given by<br />

�<br />

1 if ω ∈ A,<br />

1A(ω) =<br />

0 if ω /∈ A,<br />

is increasing (resp. decreasing).<br />

Given two probability measures µ1 and µ2 on (Ω, F) we say that µ1 dominates<br />

µ2, written µ1 ≥ µ2, if µ1(A) ≥ µ2(A) for all increasing events A.<br />

Using this partial order on measures, it may easily be seen that the probability<br />

measure Pp is non-decreasing in p, which is to say that<br />

(2.4) Pp1 ≥ Pp2 if p1 ≥ p2.<br />

General sufficient conditions for such an inequality have been provided by<br />

Holley [193] and others (see Holley’s inequality, Theorem 5.5), but there is<br />

a simple direct proof in the case of product measures. It makes use of the<br />

following elementary device.

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

Saved successfully!

Ooh no, something went wrong!