On some percolation results of J. M. Hammersley
- 1 September 1979
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 16 (3) , 526-540
- https://doi.org/10.2307/3213082
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.Keywords
This publication has 17 references indexed in Scilit:
- Percolation Probabilities on the Square LatticePublished by Elsevier ,1978
- Percolation processes in two dimensions. I. Low-density series expansionsJournal of Physics A: General Physics, 1976
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- Über einen Satz von KruskalPeriodica Mathematica Hungarica, 1975
- Combinatorial applications of an inequality from statistical mechanicsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Percolation in two-dimensional latticesJournal of Physics A: General Physics, 1975
- Correlation inequalities on some partially ordered setsCommunications in Mathematical Physics, 1971
- Percolation Processes and Related TopicsJournal of the Society for Industrial and Applied Mathematics, 1963
- Comparison of Atom and Bond Percolation ProcessesJournal of Mathematical Physics, 1961
- Percolation processesMathematical Proceedings of the Cambridge Philosophical Society, 1957