Change intolerance in spanning forests

DOI10.1023/A:1022222319655MaRDI QIDQ1868443zbMATH OpenFDO

Authors Deborah Heicklen, Russell Lyons

Publication date 27 April 2003

Published in Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0102230

zbMATH Keywords

spanning forestschange intolerance for probability measures on graphschange-intolerant wired uniform spanning forest measureswired uniform spanning forest measures

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

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.

Recommendations

• Uniform spanning forests
• scientific article; zbMATH DE number 1195780
• Indistinguishability of trees in uniform spanning forests
• Minimal spanning forests
• Ends in uniform spanning forests

Cited in

(6)

• Limiting entropy of determinantal processes
• scientific article; zbMATH DE number 1123757 (Why is no real title available?)
• Absolute continuity and singularity of palm measures of the Ginibre point process
• Determinantal probability measures
• Stationary determinantal processes on \({\mathbb{Z}}^d\) with \(N\) labeled objects per site. I: Basic properties and full domination
• Stationary determinantal processes: phase multiplicity, Bernoullicity, entropy, and domination

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)