Francesca Arrigo

Orcid: 0000-0001-5473-7284

According to our database1, Francesca Arrigo authored at least 19 papers between 2015 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Walk based Laplacians for Modeling Diffusion on Complex Networks.
CoRR, January, 2026

2025
A local eigenvector centrality.
CoRR, November, 2025

Updating Katz Centrality by Counting Walks.
SIAM J. Matrix Anal. Appl., 2025

2024
Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs.
SIAM J. Matrix Anal. Appl., March, 2024

2021
A Theory for Backtrack-Downweighted Walks.
SIAM J. Matrix Anal. Appl., 2021

Mittag-Leffler Functions and their Applications in Network Science.
SIAM J. Matrix Anal. Appl., 2021

2019
Non-Backtracking Alternating Walks.
SIAM J. Appl. Math., 2019

Non-backtracking PageRank.
J. Sci. Comput., 2019

A framework for second order eigenvector centralities and clustering coefficients.
CoRR, 2019

Multi-Dimensional, Multilayer, Nonlinear and Dynamic HITS.
Proceedings of the 2019 SIAM International Conference on Data Mining, 2019

2018
Node and Layer Eigenvector Centralities for Multiplex Networks.
SIAM J. Appl. Math., 2018

Non-backtracking walk centrality for directed networks.
J. Complex Networks, 2018

2017
Sparse matrix computations for dynamic network centrality.
Appl. Netw. Sci., 2017

2016
Edge manipulation techniques for complex networks with applications to communicability and triadic closure.
PhD thesis, 2016

Updating and Downdating Techniques for Optimizing Network Communicability.
SIAM J. Sci. Comput., 2016

Computation of Generalized Matrix Functions.
SIAM J. Matrix Anal. Appl., 2016

Edge Modification Criteria for Enhancing the Communicability of Digraphs.
SIAM J. Matrix Anal. Appl., 2016

Preserving Sparsity in Dynamic Network Computations.
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

2015
Predicting Triadic Closure in Networks Using Communicability Distance Functions.
SIAM J. Appl. Math., 2015


  Loading...