84 citations · 126 across the 6 of their papers we have counts for
11 papers
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…
Mittag-Leffler functions and their applications in network science
Francesca Arrigo, Fabio Durastante
We describe a complete theory for walk-based centrality indices in complex networks defined in terms of Mittag-Leffler functions. This overarching theory includes as special cases…
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…
A framework for second order eigenvector centralities and clustering coefficients
Francesca Arrigo, Desmond J. Higham, Francesco Tudisco
We propose and analyse a general tensor-based framework for incorporating second order features into network measures. This approach allows us to combine traditional pairwise links…
Multi-Dimensional, Multilayer, Nonlinear and Dynamic HITS
Francesca Arrigo, Francesco Tudisco
We introduce a ranking model for temporal multi-dimensional weighted and directed networks based on the Perron eigenvector of a multi-homogeneous order-preserving map. The model ex…
Node and layer eigenvector centralities for multiplex networks
Francesco Tudisco, Francesca Arrigo, Antoine Gautier
Eigenvector-based centrality measures are among the most popular centrality measures in network science. The underlying idea is intuitive and the mathematical description is extrem…
Computation of generalized matrix functions
Francesca Arrigo, Michele Benzi, Caterina Fenu
We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Alg…
Edge modification criteria for enhancing the communicability of digraphs
Francesca Arrigo, Michele Benzi
We introduce new broadcast and receive communicability indices that can be used as global measures of how effectively information is spread in a directed network. Furthermore, we d…
Predicting triadic closure in networks using communicability distance functions
Ernesto Estrada, Francesca Arrigo
We propose a communication-driven mechanism for predicting triadic closure in complex networks. It is mathematically formulated on the basis of communicability distance functions t…
Updating and downdating techniques for optimizing network communicability
Francesca Arrigo, Michele Benzi
The total communicability of a network (or graph) is defined as the sum of the entries in the exponential of the adjacency matrix of the network, possibly normalized by the number…