Measures on the square as sparse graph limits
Combinatorics
2016-12-07 v2
Abstract
We study a metric on the set of finite graphs in which two graphs are considered to be similar if they have similar bounded dimensional "factors". We show that limits of convergent graph sequences in this metric can be represented by symmetric Borel measures on . This leads to a generalization of dense graph limit theory to sparse graph sequences.
Keywords
Cite
@article{arxiv.1610.05719,
title = {Measures on the square as sparse graph limits},
author = {Dávid Kunszenti-Kovács and László Lovász and Balázs Szegedy},
journal= {arXiv preprint arXiv:1610.05719},
year = {2016}
}
Comments
31 pages, references added