2016
DOI: 10.1007/s00493-014-3160-x
|View full text |Cite
|
Sign up to set email alerts
|

The expected degree of minimal spanning forests

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
9
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 17 publications
(35 reference statements)
0
9
0
Order By: Relevance
“…We note that [GM15] is representative of a lot of recent interest in measure-theoretic versions of von Neumann's problem spawned by the pioneering work [GL07]. Thus, the main result of [GL07] was strengthened in [Ku13], and its proof was simplified in [Th13]. Very recently, von Neumann's problem was shown to have a positive solution for non-amenable equivalence relations that act on hyperbolic bundles [Bo15].…”
Section: Introduction and Statement Of Main Resultsmentioning
confidence: 99%
“…We note that [GM15] is representative of a lot of recent interest in measure-theoretic versions of von Neumann's problem spawned by the pioneering work [GL07]. Thus, the main result of [GL07] was strengthened in [Ku13], and its proof was simplified in [Th13]. Very recently, von Neumann's problem was shown to have a positive solution for non-amenable equivalence relations that act on hyperbolic bundles [Bo15].…”
Section: Introduction and Statement Of Main Resultsmentioning
confidence: 99%
“…By Proposition 5.3(h), to prove Theorem 5.8, it suffices to show that there exists a finite subset S ′ of G containing an element of infinite order g such that the unoriented Cayley graph Γ ′ = Cay uo (G, S ′ ∪ (S ′ ) −1 ) admits a G-invariant random spanning forest which has expected degree > 4 and almost surely contains all edges of Γ ′ labeled by g ±1 . The construction of such a forest given below is almost identical to the construction from the proof of [33,Lemma 5].…”
Section: 32mentioning
confidence: 98%
“…There are several standard constructions of G-invariant random spanning forests on Cayley graphs including the free minimal spanning forest (we refer the reader to [33] for the definition which will not be important to us).…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…The measure MSF(G, S) is called the minimal spanning forest of Cay(G, S). A theorem of Thom states that if G is non-amenable then the expected degree of MSF(G, S) is unbounded as the generating set S varies [33,34].…”
Section: Upper Bounds To Rokhlin Entropymentioning
confidence: 99%