Answers are grounded in this paper and cite their sources.
We study the eigenvalues of large perturbed matrices. We consider a pattern matrix P, we blow it up to get a large block-matrix Bn. We can observe only a noisy version of matrix Bn. So we add a random noise Wn to obtain the perturbed matrix An = Bn + Wn. Our aim is to find the structural eigenvalues of An. We prove asymptotic theorems on this problem and also suggest a graphical method to distinguish the structural and the non-structural eigenvalues of An.
No takes yet. Share an insight, caveat, or question.
Fazekas et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: