Finite graphs and amenability

DOI10.1016/j.jfa.2012.08.021zbMath1252.05185arXiv1204.0449OpenAlexW2043660965MaRDI QIDQ1760172

Gábor Elek

Publication date: 13 November 2012

Published in: Journal of Functional Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.0449

zbMATH Keywords

amenabilityhyperfinitenessgraphings

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Structural characterization of families of graphs (05C75) Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations (37A20)

Related Items

Infinite dimensional representations of finite dimensional algebras and amenability ⋮ Testability in group theory ⋮ Uniformly recurrent subgroups and simple \(C^{\ast}\)-algebras ⋮ Convergence and limits of linear representations of finite groups ⋮ Hyperfinite graphings and combinatorial optimization ⋮ Limits of locally-globally convergent graph sequences ⋮ A Banach space-valued ergodic theorem for amenable groups and applications ⋮ Convergence theorems for graph sequences ⋮ Weak containment of measure-preserving group actions ⋮ Uniform hyperfiniteness ⋮ Differential calculus on graphon space

Cites Work

• Unnamed Item
• \(L^{2}\)-spectral invariants and convergent sequences of finite graphs
• Hyperfinite graph limits
• On limits of finite graphs
• Every minor-closed property of sparse graphs is testable
• Entropy and isomorphism theorems for actions of amenable groups
• Borel chromatic numbers
• Topics in orbit equivalence
• Kesten's theorem for invariant random subgroups.
• Processes on unimodular random networks
• Parameter testing in bounded degree graphs of subexponential growth
• Hausdorff dimension of the harmonic measure on trees
• Amenability, hyperfiniteness, and isoperimetric inequalities
• Local Graph Partitions for Approximation and Testing
• Weak equivalence and non-classifiability of measure preserving actions
• Sparse graphs: Metrics and random models
• Every property of hyperfinite graphs is testable