Defective eigenvalues of the non-backtracking matrix
Preprint
Abstract
We consider graphs for which the non-backtracking matrix has defective eigenvalues, or graphs for which the matrix does not have a full set of eigenvectors. The existence of these values results in Jordan blocks of size greater than one, which we call nontrivial. We show a relationship between the eigenspaces of the non-backtracking matrix and the eigenspaces of a smaller matrix, completely classifying their differences among graphs with at most one cycle. Finally, we provide several constructions of infinite graph families that have nontrivial Jordan blocks for both this smaller matrix and the non-backtracking matrix.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Some spectral properties of the non-backtracking matrix of a graphLinear Algebra and its Applications, 2021
- Nonbacktracking spectrum of random graphs: Community detection and nonregular Ramanujan graphsThe Annals of Probability, 2018
- Epidemic processes in complex networksReviews of Modern Physics, 2015
- Spectral redemption in clustering sparse networksProceedings of the National Academy of Sciences, 2013
- Network Robustness and Fragility: Percolation on Random GraphsPhysical Review Letters, 2000
- On discrete subgroups of the two by two projective linear group over $\mathfrak{p}$ -adic fieldsJournal of the Mathematical Society of Japan, 1966