Spectral theory of the non-backtracking Laplacian for graphs

DOI10.1016/J.DISC.2023.113536MaRDI QIDQ6172286zbMATH OpenOpenAlexFDO

Authors Jürgen Jost, R. Mulas, Leo Torres

Publication date 19 July 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

Laplacian eigenvaluesnon-backtracking matrixnon-backtracking random walksspectral graph theory

Mathematics Subject Classification ID

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

Abstract: We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural properties of the graph in a more precise way than the classical operators that have been studied so far in the literature, including the non-backtracking matrix.

Recommendations

• Some spectral properties of the non-backtracking matrix of a graph
• On the non-backtracking spectral radius of graphs
• The non-backtracking spectrum of the universal cover of a graph
• Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
• scientific article; zbMATH DE number 3888588

Cites work

• A construction of cospectral graphs for the normalized Laplacian
• A sufficient condition for a family of graphs being determined by their generalized spectra
• Constructing cospectral graphs
• Cospectral graphs on 12 vertices
• Developments on spectral characterizations of graphs
• Distinguishing graphs with zeta functions and generalized spectra
• scientific article; zbMATH DE number 4165188 (Why is no real title available?)
• scientific article; zbMATH DE number 1495995 (Why is no real title available?)
• scientific article; zbMATH DE number 3411062 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Non-backtracking walk centrality for directed networks
• Nonbacktracking eigenvalues under node removal: X-centrality and targeted immunization
• Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs
• Normalized graph Laplacians for directed graphs
• Practical graph isomorphism. II.
• Some spectral properties of the non-backtracking matrix of a graph
• Spectral redemption in clustering sparse networks
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• The non-backtracking spectrum of the universal cover of a graph
• Zeta functions of graphs. A stroll through the garden

Cited in

(12)

• Duality and nonlinear graph Laplacians
• Some spectral properties of the non-backtracking matrix of a graph
• Eigenfunctions of the edge-based Laplacian on a graph
• Eigenvalues of the non-backtracking operator detached from the bulk
• On the non-backtracking spectral radius of graphs
• The non-backtracking spectrum of the universal cover of a graph
• There is no going back: properties of the non-backtracking Laplacian
• Geometric and spectral analysis on weighted digraphs
• Maximal colourings for graphs
• Complex non-backtracking matrix for directed graphs
• Chern-Simons-Higgs type equations on canonically compactifiable graphs
• Existence of solutions to a class of the Kazdan-Warner equations on networks

This page was built for publication: Spectral theory of the non-backtracking Laplacian for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6172286)