Author:
Mulas Raffaella,Zucal Giulio
Abstract
AbstractInspired by the notion of action convergence in graph limit theory, we introduce a measure-theoretic representation of matrices, and we use it to define a new notion of pseudo-metric on the space of matrices. Moreover, we show that such pseudo-metric is a metric on the subspace of adjacency or Laplacian matrices for graphs. Hence, in particular, we obtain a metric for isomorphism classes of graphs. Additionally, we study how some properties of graphs translate in this measure representation, and we show how our analysis contributes to a simpler understanding of action convergence of graphops.
Funder
Max Planck Institute for Mathematics in the Sciences
Publisher
Springer Science and Business Media LLC
Reference19 articles.
1. Á. Backhausz, B. Szegedy, Action convergence of operators and graphs. Can. J. Math. 74(1), 72–121 (2022)
2. I. Benjamini, O. Schramm, Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6, 1–13 (2001)
3. B. Bollobás, O. Riordan, Sparse graphs: metrics and random models. Random Struct. Algorithms 39(1), 1–38 (2011)
4. C. Borgs, J. Chayes, L. Lovász, V.T. Sós, K. Vesztergombi. Counting Graph Homomorphisms, vol. 26 (Springer, 2006), pp. 315–371
5. C. Borgs, J.T. Chayes, H. Cohn, N. Holden, Sparse exchangeable graphs and their limits via graphon processes. J. Mach. Learn. Res. 18(1), 7740–7810 (2017)