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

September 23, 2020 Β· Declared Dead Β· πŸ› Discret. Math. Algorithms Appl.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sergio Mercado, Marcos Villagra arXiv ID 2009.11133 Category cs.DS: Data Structures & Algorithms Cross-listed cs.DM, math.SP Citations 0 Venue Discret. Math. Algorithms Appl. Last Checked 5 months ago
Abstract
We say that a square real matrix $M$ is \emph{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 $\widehat{M}$ which is sparse and close in spectrum to $M$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted