Change Intolerance in Spanning Forests

Simple item page
dc.creatorHeicklen, Deborah
dc.creatorLyons, Russell
dc.date2001-02-28
dc.date2002-12-11
dc.date.accessioned2026-07-07T04:40:26Z
dc.date.available2026-07-07T04:40:26Z
dc.descriptionCall a percolation process on edges of a graph change intolerant if the status of each edge is almost surely determined by the status of the other edges. We give necessary and sufficient conditions for change intolerance of the wired spanning forest when the underlying graph is a spherically symmetric tree.
dc.descriptionSmall mathematical correction made in revision
dc.identifierhttps://arxiv.org/abs/math/0102230
dc.identifierhttp://arxiv.org/abs/math/0102230
dc.identifierJ. Theor. Probab. 16 (2003), 47--58
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61025
dc.subjectProbability
dc.subject60J45
dc.titleChange Intolerance in Spanning Forests
dc.typetext

Files

Collections

arXiv