• Corpus ID: 238856785

Cut norm discontinuity of triangular truncation of graphons

  title={Cut norm discontinuity of triangular truncation of graphons},
  author={Teddy Mishura},
The space of L graphons, symmetric measurable functions w : [0, 1] → R with finite p-norm, features heavily in the study of sparse graph limit theory. We show that the triangular cut operator Mχ acting on this space is not continuous with respect to the cut norm. This is achieved by showing that as n→∞, the norm of the triangular truncation operator Tn on symmetric matrices equipped with the cut norm grows to infinity as well. Due to the density of symmetric matrices in the space of L graphons… 

Figures from this paper


Cut-norms and spectra of matrices
One of the aims of this paper is to solve an open problem of Lovasz about relations between graph spectra and cut-distance. The paper starts with several inequalities between two versions of the
Norms of Schur multipliers
A subset P of N is called Schur bounded if every infinite matrix with bounded scalar entries which is zero off of P yields a bounded Schur multiplier on B(H). Such sets are characterized as being the
An $L^{p}$ theory of sparse graph convergence II: LD convergence, quotients and right convergence
We extend the LpLp theory of sparse graph limits, which was introduced in a companion paper, by analyzing different notions of convergence. Under suitable restrictions on node weights, we prove the
Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics
We consider sequences of graphs (Gn) and dene various notions of convergence related to these sequences including \left-convergence," dened in terms of the densities of homomorphisms from small
Limits of dense graph sequences
We show that if a sequence of dense graphs G"n has the property that for every fixed graph F, the density of copies of F in G"n tends to a limit, then there is a natural ''limit object,'' namely a
Linear embeddings of graphs and graph limits
Consider a random graph process where vertices are chosen from the interval 0 , 1 ] , and edges are chosen independently at random, but so that, for a given vertex x, the probability that there is an
Triangular truncation and finding the norm of a Hadamard multiplier
For B a fixed matrix, we study the problem of using a criterion of Haagerup to find the norm of the map A ↦ A · B, where · is the Hadamard or entrywise product of matrices. The techniques developed
On replica symmetry of large deviations in random graphs
The replica symmetry phase consists of all p,r such that rd,hpr lies on the convex minorant of xi¾?hpx1/d where hp is the rate function of a binomial with parameter p.
An $L^p$ theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by
Quick Approximation to Matrices and Applications
The matrix approximation is generalized to multi-dimensional arrays and from that derive approximation algorithms for all dense Max-SNP problems and the Regularity Lemma is derived.