Non-Backtracking Matrix for Node Clustering
Analysis
Key Takeaways
- •Investigates the use of the non-backtracking transition probability matrix for node clustering.
- •Explores the relationship between the eigenvalues of the non-backtracking matrix and the non-backtracking Laplacian.
- •Develops "inflation-deflation" techniques for clustering.
- •Applicable to clustering problems from sparse stochastic block models.
“The paper focuses on the real eigenvalues of the non-backtracking matrix and their relation to the non-backtracking Laplacian for node clustering.”