Finite graphs and amenability
Author:
- 29 August 2012
- journal article
- research article
- Published by Elsevier in Journal of Functional Analysis
- Vol. 263 (9) , 2593-2614
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Sparse graphs: Metrics and random modelsRandom Structures & Algorithms, 2011
- Parameter testing in bounded degree graphs of subexponential growthRandom Structures & Algorithms, 2010
- Every minor-closed property of sparse graphs is testableAdvances in Mathematics, 2010
- -spectral invariants and convergent sequences of finite graphsJournal of Functional Analysis, 2008
- Note on limits of finite graphsCombinatorica, 2007
- Processes on Unimodular Random NetworksElectronic Journal of Probability, 2007
- Borel Chromatic NumbersAdvances in Mathematics, 1999
- Hausdorff dimension of the harmonic measure on treesErgodic Theory and Dynamical Systems, 1998
- Amenability, hyperfiniteness, and isoperimetric inequalitiesComptes Rendus de l'Académie des Sciences - Series I - Mathematics, 1997
- Entropy and isomorphism theorems for actions of amenable groupsJournal d'Analyse Mathématique, 1987