Beyond non-backtracking: non-cycling network centrality measures

DOI10.1098/rspa.2019.0653zbMath1472.05081OpenAlexW3010591705WikidataQ91740894 ScholiaQ91740894MaRDI QIDQ5160872

Desmond J. Higham, Francesca Arrigo, Vanni Noferini

Publication date: 29 October 2021

Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rspa.2019.0653

zbMATH Keywords

generating functionmatrix polynomialcomplex networkHashimoto matrixcentrality indexdeformed graph Laplacian

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38)

Related Items

Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs, Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs, Some spectral properties of the non-backtracking matrix of a graph, Dynamic Katz and related network measures, A Theory for Backtrack-Downweighted Walks, Mittag--Leffler Functions and their Applications in Network Science

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the sign characteristics of Hermitian matrix polynomials
• Spectral clustering and its use in bioinformatics
• An Ihara formula for partially directed graphs
• Similarity matrices for colored graphs
• On the exponential generating function for non-backtracking walks
• Zeta functions of finite graphs and coverings
• Non-backtracking PageRank: from the classic model to Hashimoto matrices
• Non-backtracking PageRank
• Ihara zeta functions of digraphs
• Graph similarity scoring and matching
• A new status index derived from sociometric analysis
• Spectral redemption in clustering sparse networks
• The university of Florida sparse matrix collection
• Network Properties Revealed through Matrix Functions
• Emergence of Scaling in Random Networks
• ON ZETA AND L-FUNCTIONS OF FINITE GRAPHS
• Non-backtracking walk centrality for directed networks
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Random matrices, nonbacktracking walks, and orthogonal polynomials
• Quantum chaos on discrete graphs
• Matrix Analysis
• The Complexity of Enumeration and Reliability Problems
• The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis
• Harmonic Analysis on Symmetric Spaces—Euclidean Space, the Sphere, and the Poincaré Upper Half-Plane
• Non-Backtracking Alternating Walks
• The non-backtracking spectrum of the universal cover of a graph
• On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
• Matrix Polynomials
• Collective dynamics of ‘small-world’ networks
• Functions of Matrices
• Elementary Divisors of AB and BA
• Networks