Indistinguishability of the components of random spanning forests
From MaRDI portal
Abstract: We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the Free Minimal Spanning Forest. We also show that with the above assumptions there can only be 0, 1 or infinitely many components. These answer questions by Benjamini, Lyons, Peres and Schramm. Our methods apply to a more general class of percolations, those satisfying "weak insertion tolerance", and work beyond Cayley graphs, in the more general setting of unimodular random graphs.
Recommendations
- Indistinguishability of trees in uniform spanning forests
- Indistinguishability of collections of trees in the uniform spanning forest
- Random two-component spanning forests
- Random spanning forests and hyperbolic symmetry
- Two applications of random spanning forests
- Forests in random graphs
- Maximum induced forests in random graphs
- Spanning distribution forests of graphs (extended abstract)
- Indistinguishable trees and graphs
- Sizes of trees in a random forest and configuration graphs
Cites work
- A measurable-group-theoretic solution to von Neumann's problem
- Choosing a spanning tree for the integer lattice uniformly
- Ends in free minimal spanning forests
- Ergodic subequivalence relations induced by a Bernoulli action
- Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
- Group-invariant percolation on graphs
- Indistinguishability of percolation clusters
- Indistinguishability of trees in uniform spanning forests
- Minimal spanning forests
- Neighboring clusters in Bernoulli percolation
- Probability on trees and networks
- Processes on unimodular random networks
- Stationary measures for random walks in a random environment with random scenery
- Uniform spanning forests
Cited in
(11)- Interlacements and the wired uniform spanning forest
- Weights of uniform spanning forests on nonunimodular transitive graphs
- The free uniform spanning forest is disconnected in some virtually free groups, depending on the generator set
- Connectedness of the free uniform spanning forest as a function of edge weights
- Indistinguishability of collections of trees in the uniform spanning forest
- Heavy Bernoulli-percolation clusters are indistinguishable
- The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)
- Indistinguishability of trees in uniform spanning forests
- The number of ends in the uniform spanning tree for recurrent unimodular random graphs
- Uniqueness of the infinite tree in low-dimensional random forests
- Nonamenable subforests of multi-ended quasi-pmp graphs
This page was built for publication: Indistinguishability of the components of random spanning forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660632)
