Hyperfinite graph limits

zbMATH Open1140.60008arXiv0711.3808MaRDI QIDQ928652FDOQ928652

Authors: Oded Schramm 

Publication date: 11 June 2008

Published in: Electronic Research Announcements in Mathematical Sciences (Search for Journal in Brave)

Abstract: G'abor Elek introduced the notion of a hyperfinite graph family: a collection of graphs is hypefinite if for every $epsilon>0$ there is some finite $k$ such that each graph $G$ in the collection can be broken into connected components of size at most $k$ by removing a set of edges of size at most $epsilon|V(G)|$. We presently extend this notion to a certain compactification of finite bounded-degree graphs, and show that if a sequence of finite graphs converges to a hyperfinite limit, then the sequence itself is hyperfinite.

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

Recommendations

• Hypergraph limits: A regularity approach
• A measure-theoretic approach to the theory of dense hypergraphs
• Measures on the square as sparse graph limits
• Convergence of graphs with intermediate density
• On limits of sparse random graphs

zbMATH Keywords

compactification of finite bounded-degree graphsgeneralizations of amenability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cited In (16)

• Sparse graph limits along balls
• Hypergraph limits: A regularity approach
• Finite graphs and amenability
• Sofic boundaries of groups and coarse geometry of sofic approximations
• Convergence theorems for graph sequences
• Left and right convergence of graphs with bounded degree
• Limits of iterated \(H\)-line graphs
• Parameter testing in bounded degree graphs of subexponential growth
• Graph and pointwise upper Kuratowski limits
• Infinite dimensional representations of finite dimensional algebras and amenability
• Convergence and limits of linear representations of finite groups
• Sparse expanders have negative curvature
• Percolation beyond \(\mathbb Z^{d}\): the contributions of Oded Schramm
• Every minor-closed property of sparse graphs is testable
• Hyperfinite graphings and combinatorial optimization
• Limits of locally-globally convergent graph sequences

This page was built for publication: Hyperfinite graph limits

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