On near-critical and dynamical percolation in the tree case

Citation
O. Haggstrom et R. Pemantle, On near-critical and dynamical percolation in the tree case, RAND STR AL, 15(3-4), 1999, pp. 311-318
Citations number
9
Categorie Soggetti
Mathematics
Journal title
RANDOM STRUCTURES & ALGORITHMS
ISSN journal
10429832 → ACNP
Volume
15
Issue
3-4
Year of publication
1999
Pages
311 - 318
Database
ISI
SICI code
1042-9832(199910/12)15:3-4<311:ONADPI>2.0.ZU;2-7
Abstract
Consider independent bond percolation with retention probability p on a sph erically symmetric tree Gamma. Write theta(Gamma)(P) for the probability th at the root is in an infinite open cluster, and define the critical value p (c) = inf{p : theta(Gamma)(p) > 0}. If theta(Gamma)(p(c)) = 0, then the roo t may still percolate in the corresponding dynamical percolation process at the critical value p(c), as demonstrated recently by Haggstrom, Peres, and Steif. Here we relate this phenomenon to the near-critical behavior of the ta(Gamma)(p) by showing that the root percolates in the dynamical percolati on process if and only if integral(pc)(1)(theta(Gamma)(p))(-1) dp < infinit y. The "only if" direction extends to general trees, whereas the "if" direc tion fails ire this generality. (C) 1999 John Wiley & Sons, Inc.