Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-26T08:46:13.454Z Has data issue: false hasContentIssue false

The percolation process on a tree where infinite clusters are frozen

Published online by Cambridge University Press:  01 May 2000

DAVID J. ALDOUS
Affiliation:
Department of Statistics, University of California, 367 Evans Hall # 3860, Berkeley, CA 94720-3860, U.S.A. e-mail: [email protected]://www.stat.berkeley.edu/users/aldous

Abstract

Modify the usual percolation process on the infinite binary tree by forbidding infinite clusters to grow further. The ultimate configuration will consist of both infinite and finite clusters. We give a rigorous construction of a version of this process and show that one can do explicit calculations of various quantities, for instance the law of the time (if any) that the cluster containing a fixed edge becomes infinite. Surprisingly, the distribution of the shape of a cluster which becomes infinite at time t > ½ does not depend on t; it is always distributed as the incipient infinite percolation cluster on the tree. Similarly, a typical finite cluster at each time t > ½ has the distribution of a critical percolation cluster. This elaborates an observation of Stockmayer [12].

Type
Research Article
Copyright
The Cambridge Philosophical Society 2000

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