Some spectral properties of the non-backtracking matrix of a graph

DOI10.1016/j.laa.2021.01.022zbMath1462.05223arXiv2011.09385OpenAlexW3128477922MaRDI QIDQ2020643

Cory Glover, Mark Kempton

Publication date: 24 April 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.09385

zbMATH Keywords

eigenvalueseigenvectorsspectral graph theorynon-backtracking walks

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (4)

Kemeny's constant for nonbacktracking random walks ⋮ There is no going back: properties of the non-backtracking Laplacian ⋮ Spectral theory of the non-backtracking Laplacian for graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Cutoff on all Ramanujan graphs
• Spectra of graphs
• Some new bounds on the spectral radius of matrices
• Bounds on graph eigenvalues. I
• Cutoff phenomena for random walks on random regular graphs
• On an upper bound of the spectral radius of graphs
• On the exponential generating function for non-backtracking walks
• Some new bounds on the spectral radius of graphs
• Ihara zeta functions of coronae
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• Spectral redemption in clustering sparse networks
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Ihara zeta function of finite graphs with circuit rank two
• Beyond non-backtracking: non-cycling network centrality measures
• Inequalities for Graph Eigenvalues

This page was built for publication: Some spectral properties of the non-backtracking matrix of a graph