Ends in free minimal spanning forests
From MaRDI portal
Publication:2497162
Abstract: We show that for a transitive unimodular graph, the number of ends is the same for every tree of the free minimal spanning forest. This answers a question of Lyons, Peres and Schramm.
Recommendations
Cites work
Cited in
(12)- Ends in uniform spanning forests
- Ends in spanning trees
- The scaling limits of the minimal spanning tree and invasion percolation in the plane
- Indistinguishability of the components of random spanning forests
- One-ended spanning trees in amenable unimodular graphs
- Connectivity of random geometric graphs related to minimal spanning forests
- The expected degree of minimal spanning forests
- The number of ends in the uniform spanning tree for recurrent unimodular random graphs
- Nonamenable subforests of multi-ended quasi-pmp graphs
- A measurable-group-theoretic solution to von Neumann's problem
- Minimal spanning forests
- Ergodic subequivalence relations induced by a Bernoulli action
This page was built for publication: Ends in free minimal spanning forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497162)