Change Intolerance in Spanning Forests

Deborah Heicklen () and Russell Lyons ()

Journal of Theoretical Probability, 2003, vol. 16, issue 1, 47-58

Abstract: 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: Spanning; forests (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/A:1022222319655 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:16:y:2003:i:1:d:10.1023_a:1022222319655

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959

DOI: 10.1023/A:1022222319655

Access Statistics for this article

Journal of Theoretical Probability is currently edited by Andrea Monica

More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().