IMPROVING RESULTS FOR CUT AND
OPERATOR NORMS ON GRAPHON
Hirotada Honda
Faculty of Information Networking
for Innovation and Design
Toyo University
1-7-11 Akabanedai, Kita-Ku, Tokyo
115-0053, JAPAN

Abstract

Graphon theory has recently begun attracting interdisciplinary research. Although the theory includes many intriguing concepts, one important aspect we often employ in network analysis is the relationship between the cut norm and operator norm of a graphon as an operator on some function spaces. This relationship is well known in the past arguments. However, the authors of the past works restricted the domain of a graphon to $L_\infty(I)$. In this note, we discuss the relationship between the cut norm and operator norm of a graphon in more general situations. We improve the well-known existing inequality and enhance the accuracy of some lemma proofs.

Citation details of the article



Journal: International Journal of Applied Mathematics
Journal ISSN (Print): ISSN 1311-1728
Journal ISSN (Electronic): ISSN 1314-8060
Volume: 33
Issue: 2
Year: 2020

DOI: 10.12732/ijam.v33i2.11

Download Section



Download the full text of article from here.

You will need Adobe Acrobat reader. For more information and free download of the reader, please follow this link.

References

  1. [1] C. Borgs et al., An Lp theory of sparse graph convergence, I: Limits, sparse random graph models, and power law distributions, arXiv Preprint, arXiv:1401.2906.
  2. [2] H. Brezis, Analyse Fonctionnelle, Masson, Paris (1983).
  3. [3] P. Diaconis and S. Janson, Graph limits and exchangeable random graphs, Rendiconti di Mathematica, Serie VII, 28 (2008), 33-61.
  4. [4] H. Honda, Preprint.
  5. [5] S. Janson, Graphons, cut norm and distance, coupling and rearrangements, New York Journal of Math. Monographs, Vol. 4, State University of New York, University at Albany (2013).
  6. [6] O. Kallenberg, Probabilistic Symmetries and Invariance Principles, Springer, New York (2005).
  7. [7] T. Kato, Perturbation Theory for Linear Operators, Springer, Berlin (1980).
  8. [8] O. Klopp and N. Verzelen, Optimal graphon estimation in cut distance, Probab. Theory Relat. Fields, 174, No 3-4 (2017), 1033–1090; DOI: 10.1007/s00440-018-0878-1.
  9. [9] L. Lovasz, Large Networks and Graph Limits, American Mathematical Society (2012).