Daniel Glasscock
Published 2016-11-02Version 1
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.
Comments: 3 pages
Journal: Notices Amer. Math. Soc., 62(1):46-48, 2015
Graph functions maximized on a path
Distance-Restricted Firefighting on Finite Graphs
Weierstrass sets on finite graphs
![QR code for arXiv:1611.00718 [math.CO]](http://oss.arxitics.com/images/favicon.svg)