2 papers
math.NA2024
Efficient computation of \lowercase{}-centralities and nonbacktracking centrality for temporal networks
Vanni Noferini, Spyridon Vrontos, Ryan Wood
We discuss efficient computation of -centralities and nonbacktracking centralities for time-evolving networks with nonnegative weights. We present a node-level formula for its c…
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…