Strong almost finiteness
G\'abor Elek, \'Ad\'am Tim\'ar

TL;DR
This paper introduces the concept of strong almost finiteness in graphs, characterizes it through various properties, and applies it to classify certain $C^*$-algebras, extending known results to broader classes of graphs.
Contribution
It establishes equivalences for strong almost finiteness, links it to Property A and the F ext{"o}lner property, and applies these results to classify new classes of $C^*$-algebras.
Findings
Graphs of subexponential growth are strongly almost finite.
Schreier graphs of amenable groups are strongly almost finite.
Laplacian spectra converge under Property A graph sequences.
Abstract
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on the boundary of a tile is uniformly small. We give various equivalents for strong almost finiteness. In particular, we prove that Property A together with the F\o lner property is equivalent to strong almost finiteness. Using these characterizations, we show that graphs of subexponential growth and Schreier graphs of amenable groups are always strongly almost finite, generalizing the celebrated result of Downarowicz, Huczek and Zhang about amenable Cayley graphs, based on graph theoretic rather than group theoretic principles. We give various equivalents to Property A for graphs, and show that if a sequence of graphs of Property A (in a uniform sense)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Operator Algebra Research · Geometric and Algebraic Topology · Advanced Topology and Set Theory
