Answers are grounded in this paper and cite their sources.
Two linear algebra problems implore a solution to them, creating the themes pursued in this paper. The first problem interfaces with graph theory via binary 0-1 adjacency matrices and their Laplacian counterparts. More contemporary spatial statistics/econometrics applications motivate the second problem, which embodies approximating the eigenvalues of massively large versions of these two aforementioned matrices. The proposed solutions outlined in this paper essentially are a reformulated multiple linear regression analysis for the first problem and a matrix inertia refinement adapted to existing work for the second problem.
No takes yet. Share an insight, caveat, or question.
Daniel A. Griffith (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: