Loading...
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, Lovasz, Newman Sohler and Ornstein-Weiss. (c) 2012 Elsevier Inc. All rights reserved.
Type
research article
Web of Science ID
WOS:000309192600004
Authors
Publication date
2012
Publisher
Published in
Volume
263
Issue
9
Start page
2593
End page
2614
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
February 27, 2013
Use this identifier to reference this record