Change Intolerance in Spanning Forests
Probability
2007-05-23 v3
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.
Keywords
Cite
@article{arxiv.math/0102230,
title = {Change Intolerance in Spanning Forests},
author = {Deborah Heicklen and Russell Lyons},
journal= {arXiv preprint arXiv:math/0102230},
year = {2007}
}
Comments
Small mathematical correction made in revision