Francesca Arrigo
TitleCited byYear
Updating and downdating techniques for optimizing network communicability
F Arrigo, M Benzi
SIAM Journal on Scientific Computing 38 (1), B25–B49, 2016
282016
Node and layer eigenvector centralities for multiplex networks
F Tudisco, F Arrigo, A Gautier
SIAM Journal on Applied Mathematics 78 (2), 853-876, 2018
202018
Computation of generalized matrix functions
F Arrigo, M Benzi, C Fenu
SIAM Journal on Matrix Analysis and Applications 37 (2), 836-860, 2015
202015
Edge modification criteria for enhancing the communicability of digraphs
F Arrigo, M Benzi
SIAM Journal on Matrix Analysis and Applications 37 (1), 443–468, 2015
172015
Non-backtracking walk centrality for directed networks
F Arrigo, P Grindrod, DJ Higham, V Noferini
Journal of Complex Networks 6 (1), 54-78, 2017
72017
Predicting triadic closure in networks using communicability distance functions
E Estrada, F Arrigo
SIAM Journal on Applied Mathematics 75 (4), 1725–1744, 2015
52015
Multi-dimensional, multilayer, nonlinear and dynamic hits
F Arrigo, F Tudisco
Proceedings of the 2019 SIAM International Conference on Data Mining, 369-377, 2019
32019
Sparse matrix computations for dynamic network centrality
F Arrigo, DJ Higham
Applied network science 2 (1), 17, 2017
32017
On the exponential generating function for non-backtracking walks
F Arrigo, P Grindrod, DJ Higham, V Noferini
Linear Algebra and its Applications 556, 381-399, 2018
22018
Preserving Sparsity in Dynamic Network Computations
F Arrigo, DJ Higham
International Workshop on Complex Networks and their Applications, 147-157, 2016
12016
Non-backtracking PageRank
F Arrigo, DJ Higham, V Noferini
Journal of Scientific Computing, 1-19, 2019
2019
Non-backtracking alternating walks
F Arrigo, DJ Higham, V Noferini
SIAM Journal on Applied Mathematics 79 (3), 781-801, 2019
2019
Edge manipulation techniques for complex networks with applications to communicability and triadic closure.
F Arrigo
UniversitÓ degli Studi dell'Insubria, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–13