Complex non-backtracking matrix for directed graphs
arXiv:2507.12503 · doi:10.1093/comnet/cnaf012
Abstract
Graph representation matrices are essential tools in graph data analysis. Recently, Hermitian adjacency matrices have been proposed to investigate directed graph structures. Previous studies have demonstrated that these matrices can extract valuable information for clustering. In this paper, we propose the complex non-backtracking matrix that integrates the properties of the Hermitian adjacency matrix and the non-backtracking matrix. The proposed matrix has similar properties with the non-backtracking matrix of undirected graphs. We reveal relationships between the complex non-backtracking matrix and the Hermitian adjacency matrix. Also, we provide intriguing insights that this matrix representation holds cluster information, particularly for sparse directed graphs.
References in corpus (9)
- Natural Scales in Geographical Patterns
- Stochastic blockmodels and community structure in networks
- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- Spectral redemption: clustering sparse networks
- Localization and centrality in networks
- A message-passing approach for recurrent-state epidemic models on networks
- Leveraging percolation theory to single out influential spreaders in networks
- Spectral theory of the non-backtracking Laplacian for graphs
- An iterative spectral algorithm for digraph clustering