Hostname: page-component-7b7567c8c-m6dxt Total loading time: 0 Render date: 2026-11-18T18:14:59.394Z Has data issue: false hasContentIssue false

On some percolation results of J. M. Hammersley

Published online by Cambridge University Press:  14 July 2016

J. G. Oxley
Affiliation:
University of Oxford
D. J. A. Welsh*
Affiliation:
University of Oxford
*
∗∗ Postal address: Merton College, Oxford 0X1 4JD, U.K.

Abstract

We examine 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 we get new short proofs of some theorems of J. M. Hammersley. The FKG inequality is used to get an upper bound for the percolation probability and we also derive a lower bound. In each case we characterise when these bounds are attained.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1979 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable