Dynamical percolation on general trees

dc.creatorKhoshnevisan, Davar
dc.date2007-05-01
dc.date.accessioned2026-07-07T07:58:56Z
dc.date.available2026-07-07T07:58:56Z
dc.descriptionHäggström, Peres, and Steif (1997) have introduced a dynamical version of percolation on a graph $G$. When $G$ is a tree they derived a necessary and sufficient condition for percolation to exist at some time $t$. In the case that $G$ is a spherically symmetric tree, Häggström, Peres, and Steif (1997) derived a necessary and sufficient condition for percolation to exist at some time $t$ in a given target set $D$. The main result of the present paper is a necessary and sufficient condition for the existence of percolation, at some time $t\in D$, in the case that the underlying tree is not necessary spherically symmetric. This answers a question of Yuval Peres (personal communication). We present also a formula for the Hausdorff dimension of the set of exceptional times of percolation.
dc.description24 pages; to appear in Probability Theory and Related Fields
dc.identifierhttps://arxiv.org/abs/0705.0140
dc.identifierhttp://arxiv.org/abs/0705.0140
dc.identifierdoi:10.1007/s00440-007-0061-6
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128186
dc.subjectProbability
dc.subjectPrimary. 60K35; Secondary. 31C15, 60J45
dc.titleDynamical percolation on general trees
dc.typetext

Files

Collections