Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4590697 | Journal of Functional Analysis | 2012 | 22 Pages |
Abstract
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability of graph properties. In this paper we propose a unified approach to hyperfiniteness. We establish some new results and give new proofs of theorems of Schramm, Lovász, Newman–Sohler and Ornstein–Weiss.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory