Cut norm discontinuity of triangular truncation of graphons
From MaRDI portal
Publication:2154285
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.
Recommendations
- Graphons, cut norm and distance, couplings and rearrangements
- Relating the cut distance and the weak* topology for graphons
- Cut distance identifying graphon parameters over weak* limits
- Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits
- Triangular truncation and finding the norm of a Hadamard multiplier
Cites work
- scientific article; zbMATH DE number 5719287 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- A structural characterization for certifying Robinsonian matrices
- An \(L^p\) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- An optimal algorithm to recognize Robinsonian dissimilarities
- An optimization parameter for seriation of noisy data
- Approximating the cut-norm via Grothendieck's inequality
- Community detection and stochastic block models: recent developments
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Estimating Hadamard operator norms, with application to triangular truncation
- Graph limits and exchangeable random graphs
- Large networks and graph limits
- Limits of dense graph sequences
- Linear embeddings of graphs and graph limits
- Norms of Schur multipliers
- On replica symmetry of large deviations in random graphs
- Optimal rates of statistical seriation
- Quick approximation to matrices and applications
- Schur multipliers
- Schur multipliers on $\mathcal{B}(L^p,L^q)$
- Seriation and matrix reordering methods: An historical overview
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- Spectral ranking using seriation
- Szemerédi's lemma for the analyst
- The large deviation principle for the Erdős-Rényi random graph
- The phase transition in inhomogeneous random graphs
- Triangular truncation and finding the norm of a Hadamard multiplier
- Triangular truncation and its extremal matrices.
- Unconditional convergence and almost everywhere convergence
Cited in
(2)
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)