Hostname: page-component-6766d58669-nf276 Total loading time: 0 Render date: 2026-05-20T18:25:07.662Z Has data issue: false hasContentIssue false

Markov random fields and percolation on general graphs

Published online by Cambridge University Press:  01 July 2016

Olle Häggström*
Affiliation:
Chalmers University of Technology
*
Postal address: Department of Mathematics, Chalmers University of Technology, S-412 96 Göteborg, Sweden.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let G be an infinite, locally finite, connected graph with bounded degree. We show that G supports phase transition in all or none of the following five models: bond percolation, site percolation, the Ising model, the Widom-Rowlinson model and the beach model. Some, but not all, of these implications hold without the bounded degree assumption. We finally give two examples of (random) unbounded degree graphs in which phase transition in all five models can be established: supercritical Galton-Watson trees, and Poisson-Voronoi tessellations of ℝd for d ≥ 2.

Information

Type
Stochastic Geometry and Statistical Applications
Copyright
Copyright © Applied Probability Trust 2000