Non-backtracking walk centrality for directed networks

Arrigo, Francesca and Grindrod, Peter and Higham, Desmond J. and Noferini, Vanni (2017) Non-backtracking walk centrality for directed networks. Journal of Complex Networks. ISSN 2051-1329 (https://doi.org/10.1093/comnet/cnx025)

[thumbnail of Arrigo-etal-IMA-JCN-2017-Non-backtracking-walk-centrality-for-directed]
Preview
 Text. Filename: Arrigo_etal_IMA_JCN_2017_Non_backtracking_walk_centrality_for_directed.pdf
Accepted Author Manuscript
Download (839kB)| Preview

Abstract

The theory of zeta functions provides an expression for the generating function of nonbacktracking walk counts on a directed network. We show how this expression can be used to produce a centrality measure that eliminates backtracking walks at no cost. We also show that the radius of convergence of the generating function is related to the spectrum of a three-by-three block matrix involving the original adjacency matrix. This gives a means to choose appropriate values of the attenuation parameter. We find that three important additional benefits arise when we use this technique to eliminate traversals around the network on the grounds that they are unlikely to be of relevance. First, we obtain a larger range of choices for the attenuation parameter. Second, a natural approach for determining a suitable parameter range is invariant under the removal of certain types of nodes, so we can gain computational efficiencies through reducing the dimension of the resulting eigenvalue problem. Third, the dimension of the linear system defining the centrality measures may be reduced in the same manner. We show that the new centrality measure may be interpreted as standard Katz on a modified network, where self loops are added, and where nonreciprocal edges are augmented with negative weights. We also give a multilayer interpretation, where negatively weighted walks between layers compensate for backtracking walks on the only non-empty layer. Studying the limit as the attenuation parameter approaches its upper bound also allows us to propose a generalization of eigenvector-based nonbacktracking centrality measure to this directed network setting. In this context, we find that the two-by-two block matrix arising in previous studies focused on undirected networks must be extended to a new three-by-three block structure to allow for directed edges. We illustrate the centrality measure on a synthetic network, where it is shown to eliminate a localization effect present in standard Katz centrality. Finally, we give results for real networks.

CORE (COnnecting REpositories)