The expected degree of minimal spanning forests
From MaRDI portal
Abstract: We give a lower bound on the expected degree of the free minimal spanning forest of a vertex transitive graph in terms of its spectral radius. This result answers a question of Lyons-Peres-Schramm and simplifies the Gaboriau-Lyons proof of the measurable-group-theoretic solution to von Neumann's problem. In the second part we study a relative version of the free minimal spanning forest. As a consequence of this study we can show that non-torsion unitarizable groups have fixed price one.
Recommendations
- On the difference of expected lengths of minimum spanning trees
- The expected value of random minimal length spanning tree of a complete graph
- Expected lengths of minimum spanning trees for non-identical edge distributions
- scientific article; zbMATH DE number 1984546
- On random minimum length spanning trees
- scientific article; zbMATH DE number 1123757
- The vertex degrees of minimum spanning trees
- Degree-bounded minimum spanning trees
Cites work
- ^2 invariants of equivalence relations and groups
- A measurable-group-theoretic solution to von Neumann's problem
- Bernoulli actions are weakly contained in any free action
- Cost of equivalence relations and groups
- Ends in free minimal spanning forests
- Ergodic subequivalence relations induced by a Bernoulli action
- Minimal spanning forests
- Nonunitarizable Representations and Random Forests
- Normal generation and \(\ell^2\)-Betti numbers of groups.
- On non-uniqueness of percolation on nonamenable Cayley graphs
- Random Walks on Infinite Graphs and Groups
- Symmetric Random Walks on Groups
- The Dixmier problem, lamplighters and Burnside groups
- Topics in orbit equivalence
Cited in
(2)
This page was built for publication: The expected degree of minimal spanning forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915869)