Hostname: page-component-745bb68f8f-g4j75 Total loading time: 0 Render date: 2025-01-16T18:51:25.187Z Has data issue: false hasContentIssue false
  • English
  • Français

A generalization of McDiarmid's theorem for mixed Bernoulli percolation

Published online by Cambridge University Press:  24 October 2008

J. M. Hammersley
J. M. Hammersley
Affiliation:
Trinity College, Oxford
Get access Rights & Permissions [Opens in a new window]

Extract

Let G be an infinite partially directed graph of finite outgoing degree. Thus G consists of an infinite set of vertices, together with a set of edges between certain prescribed pairs of vertices. Each edge may be directed or undirected, and the number of edges from (but not necessarily to) any given vertex is always finite (though possibly unbounded). A path on G from a vertex V1 to a vertex Vn (if such a path exists) is a finite sequence of alternate edges and vertices of the form E12, V2, E23, V3, …, En − 1, n, Vn such that Ei, i + 1 is an edge connecting Vi and Vi + 1 (and in the direction from Vi to Vi + 1 if that edge happens to be directed). In mixed Bernoulli percolation, each vertex Vi carries a random variable di, and each edge Eij carries a random variable dij. All these random variables di and dij are mutually independent, and take only the values 0 or 1; the di take the value 1 with probability p, while the dij take the value 1 with probability p. A path is said to be open if and only if all the random variables carried by all its edges and all its vertices assume the value 1. Let S be a given finite set of vertices, called the source set; and let T be the set of all vertices such that there exists at least one open path from some vertex of S to each vertex of T. (We imagine that fluid, supplied to all the source vertices, can flow along any open path; and thus T is the random set of vertices eventually wetted by the fluid). The percolation probability

is defined to be the probability that T is an infinite set.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 88 , Issue 1 , July 1980 , pp. 167 - 170
Copyright
Copyright © Cambridge Philosophical Society 1980

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.)

References

REFERENCES

(1)Courant, R. and Robbins, H.What is mathematics?, chapter 7 (Oxford University Press, 1941).Google Scholar
(2)Frisch, H. L., Gordon, S. B., Hammersley, J. M. and Vyssotsky, V. A., Monte Carlo solutions of bond percolation processes in various crystal lattices. Bell System Tech. J. 41, (1962), 909–920.CrossRefGoogle Scholar
(3)Frisch, H. L., Hammersley, J. M. and Welsh, D. J. A.Monte Carlo estimates of percolation probabilities for various lattices. Phys. Rev. 126 (1962), 949–951.CrossRefGoogle Scholar
(4)Hammersley, J. M.Comparison of atom and bond percolation probabilities. J. Math. Phys. 2 (1961), 728–733.Google Scholar
(5)Hammersley, J. M. Percolation. In Proceedings of the Conference on Biological Growth, Heidelberg 1979, ed. Tautu, P. (Berlin, Springer-Verlag, 1980).Google Scholar
(6)McDiarmid, C. Dependent random variables, random graphs and percolation (1979, to appear).Google Scholar
(7)Shante, V. K. S. and Kirkpatrick, S.An introduction to percolation theory. Adv. Phys. 20, (1971), 325–357.CrossRefGoogle Scholar
(8)Smythe, E. T. and Wierman, J. C.First-passage percolation on the square lattice. Lecture Notes in Mathematics, no. 671 (Berlin, Springer-Verlag, 1978).Google Scholar
(9)McDiarmid, C.General percolation and random graphs. Adv. Appl. Prob. (1981, to appear).Google Scholar
(10)McDiarmid, C.Clutter percolation and random graphs. Proc. CO Conference, Norwich 1979 (to appear).Google Scholar
(11)McDiarmid, C. General first-passage percolation, (to appear).Google Scholar