Home > Research > Publications & Outputs > Finite graphs and amenability

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

Finite graphs and amenability

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Finite graphs and amenability. / Elek, Gábor.
In: Journal of Functional Analysis, Vol. 263, No. 9, 01.11.2012, p. 2593-2614.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Elek, G 2012, 'Finite graphs and amenability', Journal of Functional Analysis, vol. 263, no. 9, pp. 2593-2614. https://doi.org/10.1016/j.jfa.2012.08.021

APA

Elek, G. (2012). Finite graphs and amenability. Journal of Functional Analysis, 263(9), 2593-2614. https://doi.org/10.1016/j.jfa.2012.08.021

Vancouver

Elek G. Finite graphs and amenability. Journal of Functional Analysis. 2012 Nov 1;263(9):2593-2614. doi: 10.1016/j.jfa.2012.08.021

Author

Elek, Gábor. / Finite graphs and amenability. In: Journal of Functional Analysis. 2012 ; Vol. 263, No. 9. pp. 2593-2614.

Bibtex

@article{074763a6daee441ca801b9cbfcf9adb5,
title = "Finite graphs and amenability",
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{\'a}sz, Newman–Sohler and Ornstein–Weiss.",
keywords = "Amenability, Hyperfiniteness, Graphs, Graphings",
author = "G{\'a}bor Elek",
year = "2012",
month = nov,
day = "1",
doi = "10.1016/j.jfa.2012.08.021",
language = "English",
volume = "263",
pages = "2593--2614",
journal = "Journal of Functional Analysis",
issn = "0022-1236",
publisher = "Academic Press Inc.",
number = "9",

}

RIS

TY - JOUR

T1 - Finite graphs and amenability

AU - Elek, Gábor

PY - 2012/11/1

Y1 - 2012/11/1

N2 - 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.

AB - 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.

KW - Amenability

KW - Hyperfiniteness

KW - Graphs

KW - Graphings

U2 - 10.1016/j.jfa.2012.08.021

DO - 10.1016/j.jfa.2012.08.021

M3 - Journal article

VL - 263

SP - 2593

EP - 2614

JO - Journal of Functional Analysis

JF - Journal of Functional Analysis

SN - 0022-1236

IS - 9

ER -