A modified version of frozen percolation on the binary tree
| dc.creator | Brouwer, R. | |
| dc.date | 2005-11-01 | |
| dc.date.accessioned | 2026-07-07T06:50:36Z | |
| dc.date.available | 2026-07-07T06:50:36Z | |
| dc.description | We consider the following, intuitively described process: at time zero, all sites of a binary tree are at rest. Each site becomes activated at a random uniform [0,1] time, independent of the other sites. As soon as a site is in an infinite cluster of activated sites, this cluster of activated sites freezes. The main question is whether a process like this exists. Aldous [Ald00] proved that this is the case for a slightly different version of frozen percolation. In this paper we construct a process that fits the intuitive description and discuss some properties. | |
| dc.description | 19 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/math/0511021 | |
| dc.identifier | http://arxiv.org/abs/math/0511021 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/104716 | |
| dc.subject | Probability | |
| dc.subject | 60G99 | |
| dc.title | A modified version of frozen percolation on the binary tree | |
| dc.type | text |