Year: 2012
Type: preprint
Abstract: The colored neighborhood metric for sparse graphs was introduced by Bollobás and Riordan. The corresponding convergence notion refines a convergence notion introduced by Benjamini and Schramm. We prove that even in this refined sense, the limit of a convergent graph sequence (with uniformly bounded degree) can be represented by a graphing. We study various topics related to this convergence notion such as: Bernoulli graphings, factor of i.i.d. processes and hyperfiniteness.
Source: arXiv (Cornell University)
Authors: Hatami, Hamed, Lovász, László, Szegedy, Balázs
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2950334481