Complex non-backtracking matrix for directed graphs

DOI10.1093/COMNET/CNAF012MaRDI QIDQ6920911zbMATH OpenFDO

Authors Keishi Sando, Hideitsu Hino

Publication date 6 October 2025

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/COMNET/CNAF012

zbMATH Keywords

directed graphsHermitian adjacency matrixnon-backtracking matrixspectral clustering

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Other Dirichlet series and zeta functions (11M41) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• A new kind of Hermitian matrices for digraphs
• A new weighted Ihara zeta function for a graph
• An Ihara formula for partially directed graphs
• An iterative spectral algorithm for digraph clustering
• Co-clustering directed graphs to discover asymmetries and directional communities
• Hermitian adjacency matrix of digraphs and mixed graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• scientific article; zbMATH DE number 4165188 (Why is no real title available?)
• scientific article; zbMATH DE number 3942813 (Why is no real title available?)
• scientific article; zbMATH DE number 3978003 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Information, Physics, and Computation
• Non-backtracking spectrum of degree-corrected stochastic block models
• 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
• On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
• Spectral redemption in clustering sparse networks
• Spectral theory of the non-backtracking Laplacian for graphs
• The deformed graph Laplacian and its applications to network centrality analysis
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• There is no going back: properties of the non-backtracking Laplacian
• Zeta functions of finite graphs and coverings

This page was built for publication: Complex non-backtracking matrix for directed graphs

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