Measures on the square as sparse graph limits
classification
🧮 math.CO
keywords
graphgraphslimitsmeasuresmetricsequencessimilarsparse
read the original 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 $[0,1]^2$. This leads to a generalization of dense graph limit theory to sparse graph sequences.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.