Spectral theory of the non-backtracking Laplacian for graphs

DOI10.1016/j.disc.2023.113536zbMath1518.05122arXiv2203.10824OpenAlexW4379622189MaRDI QIDQ6172286

Leo Torres, Juergen Jost, Raffaella Mulas

Publication date: 19 July 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Laplacian eigenvaluesspectral graph theorynon-backtracking random walksnon-backtracking matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Random walks on graphs (05C81)

Related Items

There is no going back: properties of the non-backtracking Laplacian, Geometric and spectral analysis on weighted digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normalized graph Laplacians for directed graphs
• Constructing cospectral graphs
• A construction of cospectral graphs for the normalized Laplacian
• Developments on spectral characterizations of graphs
• Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
• Some spectral properties of the non-backtracking matrix of a graph
• Distinguishing graphs with zeta functions and generalized spectra
• Cospectral graphs on 12 vertices
• Practical graph isomorphism. II.
• A sufficient condition for a family of graphs being determined by their generalized spectra
• Spectral redemption in clustering sparse networks
• Non-backtracking walk centrality for directed networks
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization
• The non-backtracking spectrum of the universal cover of a graph