Cut norm discontinuity of triangular truncation of graphons
DOI10.1016/J.LAA.2022.05.019zbMATH Open1505.05091arXiv2110.06984OpenAlexW3205649173WikidataQ114151493 ScholiaQ114151493MaRDI QIDQ2154285FDOQ2154285
Authors: Teddy Mishura Edit this on Wikidata
Publication date: 19 July 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.06984
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
Cites Work
- Limits of dense graph sequences
- Large networks and graph limits
- Community detection and stochastic block models: recent developments
- The phase transition in inhomogeneous random graphs
- Graph limits and exchangeable random graphs
- Schur multipliers
- An optimal algorithm to recognize Robinsonian dissimilarities
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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 (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)