REVIEW 1 cited by
Spectral properties of the non-backtracking matrix of a graph
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the eigenvalues of the non-backtracking matrix in terms of eigenvalues of the adjacency matrix and use this to upper-bound the spectral radius of the non-backtracking matrix and to give a lower bound on the spectrum. We also investigate properties of a graph that can be determined by the spectrum. Specifically, we prove that the number of components, the number of degree 1 vertices, and whether or not the graph is bipartite are all determined by the spectrum of the non-backtracking matrix.
Forward citations
Cited by 1 Pith paper
-
Subgroups of a free group with every growth rate
Every value in the interval [1,2r-1] is realized as the growth rate of some (possibly infinitely generated) subgroup of the free group F_r.
Discussion (0). Continue with ORCID to comment.