16 citations · 16 across the 18 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2024
Efficient computation of Katz centrality for very dense networks via negative parameter Katz
Vanni Noferini, Ryan Wood
Katz centrality (and its limiting case, eigenvector centrality) is a frequently used tool to measure the importance of a node in a network, and to rank the nodes accordingly. One r…
cs.SI2020
A Theory for Backtrack-Downweighted Walks
Francesca Arrigo, Desmond J. Higham, Vanni Noferini
We develop a complete theory for the combinatorics of walk-counting on a directed graph in the case where each backtracking step is downweighted by a given factor. By deriving expr…