Bounds on the Spectral Sparsification of Symmetric and Off-Diagonal Nonnegative Real Matrices

09/23/2020
by   Sergio Mercado, et al.
0

We say that a square real matrix M is off-diagonal nonnegative if and only if all entries outside its diagonal are nonnegative real numbers. In this note we show that for any off-diagonal nonnegative symmetric matrix M, there exists a nonnegative symmetric matrix M which is sparse and close in spectrum to M.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/10/2020

Off-diagonal Symmetric Nonnegative Matrix Factorization

Symmetric nonnegative matrix factorization (symNMF) is a variant of nonn...
research
08/14/2023

Asymptotic nonnegative rank of matrices

The nonnegative rank of nonnegative matrices is an important quantity th...
research
09/13/2021

The Double-Constant Matrix, Centering Matrix and Equicorrelation Matrix: Theory and Applications

This paper examines the properties of real symmetric square matrices wit...
research
12/22/2020

Towards a short proof of the Fulek–Kynčl criterion for modulo 2 embeddability of graphs to surfaces

A connected graph K has a modulo 2 embedding to the sphere with g handle...
research
02/06/2022

Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix

For real symmetric matrices that are accessible only through matrix vect...
research
02/05/2020

A dichotomy for bounded degree graph homomorphisms with nonnegative weights

We consider the complexity of counting weighted graph homomorphisms defi...
research
06/03/2020

Whitening long range dependence in large sample covariance matrices of multivariate stationary processes

Let 𝐗 be an N× T data matrix which can be represented as 𝐗=𝐂_N^1/2𝐙𝐑_T^1...

Please sign up or login with your details

Forgot password? Click here to reset