Compact graphings
Combinatorics
2021-02-17 v2
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.
Keywords
Cite
@article{arxiv.1902.09573,
title = {Compact graphings},
author = {László Lovász},
journal= {arXiv preprint arXiv:1902.09573},
year = {2021}
}
Comments
10 pages; improved version of an auxiliary result from arXiv:1709.03179v1