Mathematics – Probability
Scientific paper
2007-11-24
Mathematics
Probability
Scientific paper
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.
No associations
LandOfFree
Hyperfinite graph limits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Hyperfinite graph limits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hyperfinite graph limits will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-562764