Change intolerance in spanning forests

From MaRDI portal



Abstract: Call 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.


A certain class of spanning forest (probability) measures on graphs (the so-called wired uniform spanning forest measures (WSF)) is studied; these were implicit in a paper by \textit{R. Pemantle} [Ann. Probab. 19, No. 4, 1559-1574 (1991; Zbl 0758.60010)] and were made explicit by \textit{O. Häggström} [Stochastic Processes Appl. 59, No. 2, 267-275 (1995; Zbl 0840.60089)]. The authors introduce the notion of change intolerance for probability measures on graphs, and they derive a condition which is necessary and sufficient for a spherically symmetric tree to have a change-intolerant WSF.











This page was built for publication: Change intolerance in spanning forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1868443)