Beyond non-backtracking: non-cycling network centrality measures
type: Item
instance of: scholarly article
title: Beyond non-backtracking: non-cycling network centrality measures
zbMATH Open document ID: 1472.05081
author: Francesca Arrigo
author: Desmond J. Higham
author: Vanni Noferini
published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
publication date: 2021-10-29T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 7417055
zbMATH Keywords: generating function
zbMATH Keywords: matrix polynomial
zbMATH Keywords: Hashimoto matrix
zbMATH Keywords: centrality index
zbMATH Keywords: complex network
zbMATH Keywords: deformed graph Laplacian
Wikidata QID: Q91740894
MaRDI profile type: MaRDI publication profile
full work available at URL: rspa.2019.0653
OpenAlex ID: W3010591705
cites work: The non-backtracking spectrum of the universal cover of a graph
cites work: Ihara zeta functions of digraphs
cites work: Q3414418
cites work: Harmonic Analysis on Symmetric Spaces—Euclidean Space, the Sphere, and the Poincaré Upper Half-Plane
cites work: Q5613115
cites work: Zeta functions of finite graphs and coverings
cites work: Quantum chaos on discrete graphs
cites work: Random matrices, nonbacktracking walks, and orthogonal polynomials
cites work: NON-BACKTRACKING RANDOM WALKS MIX FASTER
cites work: An Ihara formula for partially directed graphs
cites work: Spectral redemption in clustering sparse networks
cites work: Non-backtracking walk centrality for directed networks
cites work: On the exponential generating function for non-backtracking walks
cites work: Non-backtracking PageRank: from the classic model to Hashimoto matrices
cites work: Non-Backtracking Alternating Walks
cites work: Non-backtracking PageRank
cites work: The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis
cites work: Eigenspaces of graphs
cites work: ON ZETA AND L-FUNCTIONS OF FINITE GRAPHS
cites work: Networks
cites work: Network Properties Revealed through Matrix Functions
cites work: A new status index derived from sociometric analysis
cites work: Similarity matrices for colored graphs
cites work: Graph similarity scoring and matching
cites work: Elementary Divisors of AB and BA
cites work: On the sign characteristics of Hermitian matrix polynomials
cites work: Matrix Polynomials
cites work: Functions of Matrices
cites work: Q4115333
cites work: On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Matrix Analysis
cites work: Q5244659
cites work: Collective dynamics of ‘small-world’ networks
cites work: Emergence of Scaling in Random Networks
cites work: Spectral clustering and its use in bioinformatics
cites work: The university of Florida sparse matrix collection
DOI: 10.1098/RSPA.2019.0653
description: scientific article; zbMATH DE number 7417055