5 papers
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…
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…
A generalization of diversity for intersecting families
Van Magnan, Cory Palmer, Ryan Wood
Let be an intersecting family of sets and let be the maximum degree in , i.e., the maximum number of edges of $\…
Weighted enumeration of nonbacktracking walks on weighted graphs
Francesca Arrigo, Desmond J. Higham, Vanni Noferini +1
We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the prod…
Dynamic Katz and Related Network Measures
Francesca Arrigo, Desmond J. Higham, Vanni Noferini +1
We study walk-based centrality measures for time-ordered network sequences. For the case of standard dynamic walk-counting, we show how to derive and compute centrality measures in…