Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-17T22:58:01.307Z Has data issue: false hasContentIssue false

Percolation on Penrose Tilings

Published online by Cambridge University Press:  20 November 2018

A. Hof*
Affiliation:
Department of Mathematics and Statistics McMaster University Hamilton, Ontario L8S 4K1
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.

In Bernoulli site percolation on Penrose tilings there are two natural definitions of the critical probability. This paper shows that they are equal on almost all Penrose tilings. It also shows that for almost all Penrose tilings the number of infinite clusters is almost surely 0 or 1. The results generalize to percolation on a large class of aperiodic tilings in arbitrary dimension, to percolation on ergodic subgraphs of ${{\mathbb{Z}}^{d}}$ , and to other percolation processes, including Bernoulli bond percolation.

Keywords

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1998