Compact graphings
From MaRDI portal
Abstract: Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric space, where the edge set is closed and nearby points have nearby graph neighborhoods.
Recommendations
Cites work
- Borel chromatic numbers
- Eternal family trees and dynamics on unimodular random graphs
- Free minimal actions of countable groups with invariant probability measures
- Large networks and graph limits
- Limits of locally-globally convergent graph sequences
- Processes on unimodular random networks
- Recurrence of distributional limits of finite planar graphs
- Regularity partitions and the topology of graphons
- Szemerédi's lemma for the analyst
- The automorphism group of a graphon
- Uniformly recurrent subgroups and simple \(C^{\ast}\)-algebras
Cited in
(5)
This page was built for publication: Compact graphings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003771)