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. A graphing is compact, if the underlying space is a compact metric space, the edge set is closed and nearby points have nearby graph neighborhoods. We prove some simple properties of compact graphings. Our main result is a procedure for embedding an arbitrary graphing into an essentially equivalent compact graphing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
