Cut norm discontinuity of triangular truncation of graphons
From MaRDI portal
Publication:2154285
DOI10.1016/J.LAA.2022.05.019zbMATH Open1505.05091arXiv2110.06984OpenAlexW3205649173WikidataQ114151493 ScholiaQ114151493MaRDI QIDQ2154285FDOQ2154285
Publication date: 19 July 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Abstract: The space of graphons, symmetric measurable functions with finite -norm, features heavily in the study of sparse graph limit theory. We show that the triangular cut operator acting on this space is not continuous with respect to the cut norm. This is achieved by showing that as , the norm of the triangular truncation operator on symmetric matrices equipped with the cut norm grows to infinity as well. Due to the density of symmetric matrices in the space of graphons, the norm growth of generalizes to the unboundedness of . We also show that the norm of grows to infinity on symmetric matrices equipped with the operator norm.
Full work available at URL: https://arxiv.org/abs/2110.06984
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Limits of dense graph sequences
- Community Detection and Stochastic Block Models
- The phase transition in inhomogeneous random graphs
- Graph limits and exchangeable random graphs
- Schur multipliers
- An optimal algorithm to recognize Robinsonian dissimilarities
- A structural characterization for certifying Robinsonian matrices
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Linear embeddings of graphs and graph limits
- Quick approximation to matrices and applications
- On replica symmetry of large deviations in random graphs
- Unconditional convergence and almost everywhere convergence
- An đż^{đ} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- The large deviation principle for the ErdĆs-RĂ©nyi random graph
- Szemerédi's lemma for the analyst
- Approximating the cut-norm via Grothendieck's inequality
- Norms of Schur multipliers
- Seriation and matrix reordering methods: An historical overview
- Estimating Hadamard operator norms, with application to triangular truncation
- Triangular truncation and finding the norm of a Hadamard multiplier
- Optimal rates of statistical seriation
- Schur multipliers on $\mathcal{B}(L^p,L^q)$
- Spectral ranking using seriation
- Triangular truncation and its extremal matrices
- An Optimization Parameter for Seriation of Noisy Data
Cited In (1)
This page was built for publication: Cut norm discontinuity of triangular truncation of graphons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154285)