Localized eigenvectors of the non-backtracking matrix

DOI10.1088/1742-5468/2016/02/023404zbMath1456.68130arXiv1505.07543OpenAlexW2963040020MaRDI QIDQ3302540

Tatsuro Kawamoto

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

Ranking in evolving complex networks ⋮ On the exponential generating function for non-backtracking walks ⋮ Targeted influence maximization in complex networks ⋮ Identifying influential spreaders in complex networks through local effective spreading paths ⋮ Eigenvector-Based Centrality Measures for Temporal Networks ⋮ Non-Backtracking Alternating Walks ⋮ Non-backtracking PageRank ⋮ A Theory for Backtrack-Downweighted Walks ⋮ Fragmenting complex network based on non-backtracking matrix

Uses Software

• SNAP

Cites Work

• On the spectrum of the normalized graph Laplacian
• First eigenvalue/eigenvector in sparse random symmetric matrices: influences of degree fluctuation
• Spectral redemption in clustering sparse networks
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Sparse random matrices: the eigenvalue spectrum revisited
• Dynamical TAP approach to mean field glassy systems

This page was built for publication: Localized eigenvectors of the non-backtracking matrix