The combinatorial cost

Abstract

We study the combinatorial analogues of the classical invariants of measurable equivalence relations. We introduce the notion of cost and $\beta$-invariants (the analogue of the first $L^2$-Betti number introduced by Gaboriau) for sequences of finite graphs with uniformly bounded vertex degrees and examine the relation of these invariants and the rank gradient resp. mod $p$ homology gradient invariants introduced by Lackenby for residually finite groups.

Cited by in corpus (10)

• Limits of local-global convergent graph sequences
• Qualitative graph limit theory. Cantor Dynamical Systems and Constant-Time Distributed Algorithms
• From the geometry of box spaces to the geometry and measured couplings of groups
• Sofic boundaries of groups and coarse geometry of sofic approximations
• L^2-spectral invariants and convergent sequences of finite graphs
• Heat kernels are not uniform expanders
• A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
• Non-standard limits of graphs and some orbit equivalence invariants
• Pointwise ergodic theorem for locally countable quasi-pmp graphs
• Learning Very Large Graphs with Unknown Vertex Distributions