The combinatoral cost

MaRDI QIDQ2425365zbMATH OpenFDO

Authors Gábor Elek

Publication date 29 April 2008

Published in L'Enseignement Mathématique. 2e Série (Search for Journal in Brave)

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

zbMATH Keywords

Betti numbershortest path metricuniformly bounded vertex degrees

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Hausdorff and packing measures (28A78)

Abstract: We study the combinatorial analogues of the classical invariants of measurable equivalence relations. We introduce the notion of cost and $$-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.

Recommendations

• Non-standard limits of graphs and some orbit equivalence invariants
• Cost of equivalence relations and groups
• Microstates free entropy and cost of equivalence relations
• Combinatorial cost: a coarse setting
• The cost is an isoperimetric invariant

Cited in

(21)

• Torsion homology growth in arithmetic groups
• Sofic boundaries of groups and coarse geometry of sofic approximations
• Non-standard limits of graphs and some orbit equivalence invariants
• The complete cost of cofactor \(h=1\)
• Limits of locally-globally convergent graph sequences
• Sparse expanders have negative curvature
• Pointwise ergodic theorem for locally countable quasi-pmp graphs
• Ranks of subgroups in boundedly generated groups.
• Sofic representations of amenable groups
• From the geometry of box spaces to the geometry and measured couplings of groups
• Uniform local amenability implies property A
• Uniform rank gradient, cost, and local-global convergence
• Combinatorial cost: a coarse setting
• Sparse graph limits along balls
• On directed analogues of expander and hyperfinite graph sequences
• On a curious problem and what it lead to
• The first Roe homology group of locally finite graphs
• Strong almost finiteness
• Heat kernels are not uniform expanders
• \(L^{2}\)-spectral invariants and convergent sequences of finite graphs
• Every minor-closed property of sparse graphs is testable

This page was built for publication: The combinatoral cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425365)