Graphons and cut metric on sigma-finite measure spaces

Borgs, Chayes, Cohn and Holden (2016+) recently extended the definition of graphons from probability spaces to arbitrary $\sigma$-finite measure spaces, in order to study limits of sparse graphs. They also extended the definition of the cut metric, and proved various results on the resulting metric space. We continue this line of research and give various further results on graphons and the cut metric in this general setting, extending known results for the standard case of graphons on probability spaces. In particular, we characterize pairs of equivalent graphons, and we give new results on completeness and compactness.

[1]  O. Kallenberg Probabilistic Symmetries and Invariance Principles , 2005 .

[2]  D. Whittaker,et al.  A Course in Functional Analysis , 1991, The Mathematical Gazette.

[3]  P. Diaconis,et al.  Graph limits and exchangeable random graphs , 2007, 0712.2749.

[4]  B. Bollobás,et al.  Metrics for sparse graphs , 2007, 0708.1919.

[5]  D. Aldous Exchangeability and related topics , 1985 .

[6]  S. Janson Graphons, cut norm and distance, couplings and rearrangements , 2010, 1009.2376.

[7]  Christian Borgs,et al.  Sparse Exchangeable Graphs and Their Limits via Graphon Processes , 2016, J. Mach. Learn. Res..

[8]  N. Dunford,et al.  Linear operations on summable functions , 1940 .

[9]  Yufei Zhao,et al.  An $L^p$ theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions , 2014, Transactions of the American Mathematical Society.

[10]  R. Ryan Introduction to Tensor Products of Banach Spaces , 2002 .

[11]  László Lovász,et al.  Large Networks and Graph Limits , 2012, Colloquium Publications.

[12]  Mikkel N. Schmidt,et al.  Completely random measures for modelling block-structured networks , 2015, 1507.02925.

[13]  C. Borgs,et al.  Moments of Two-Variable Functions and the Uniqueness of Graph Limits , 2008, 0803.1244.

[14]  Svante Janson,et al.  Graph properties, graph limits, and entropy , 2013, J. Graph Theory.

[15]  B. Szegedy,et al.  Szemerédi’s Lemma for the Analyst , 2007 .

[16]  O. Kallenberg Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.

[17]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[18]  Daniel M. Roy,et al.  The Class of Random Graphs Arising from Exchangeable Random Measures , 2015, ArXiv.

[19]  Emily B. Fox,et al.  Sparse graphs using exchangeable random measures , 2014, Journal of the Royal Statistical Society. Series B, Statistical methodology.

[20]  O. Kallenberg Exchangeable random measures in the plane , 1990 .

[21]  Tim Austin On exchangeable random variables and the statistics of large graphs and hypergraphs , 2008, 0801.1698.