Uniform hyperfiniteness

From MaRDI portal



Abstract: Almost forty years ago, Connes, Feldman and Weiss proved that for measurable equivalence relations the notions of amenability and hyperfiniteness coincide. In this paper we define the uniform version of amenability and hyperfiniteness for measurable graphed equivalence relations of bounded vertex degrees and prove that these two notions coincide as well. Roughly speaking, a measured graph cG is uniformly hyperfinite if for any eps>0 there exists Kgeq1 such that not only cG, but all of its subgraphs of positive measure are (eps,K)-hyperfinite. We also show that this condition is equivalent to weighted hyperfiniteness and a strong version of fractional hyperfiniteness, a notion recently introduced by Lov'asz. As a corollary, we obtain a characterization of exactness of finitely generated groups via uniform hyperfiniteness.












This page was built for publication: Uniform hyperfiniteness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4992384)