Title

ON SOME PERCOLATION RESULTS OF J. M. HAMMERSLEY.

Document Type

Article

Publication Date

1-1-1979

Abstract

An examination is made of how much classical percolation theory on lattices can be extended to arbitrary graphs or even clutters of subsets of a finite set. In the process new short proofs of some theorems of J. M. Hammersley are obtained. The FKG inequality is used to get an upper bound for the percolation probability, and a lower bound is also derived.

Publication Source (Journal or Book title)

Journal of Applied Probability

First Page

526

Last Page

540

This document is currently not available here.

Share

COinS