What is a graphon?
Combinatorics
2016-11-03 v1
Abstract
Graphons, short for graph functions, are limiting objects for sequences of large, finite graphs with respect to the so-called cut metric. In this expository piece, we define graphons, motivate them, and discuss how they complete the space of finite graphs. We conclude by stating three theorems that connect the finite world of graphs with the continuous world of graphons.
Cite
@article{arxiv.1611.00718,
title = {What is a graphon?},
author = {Daniel Glasscock},
journal= {arXiv preprint arXiv:1611.00718},
year = {2016}
}
Comments
3 pages