default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesca Arrigo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Francesca Arrigo
, Desmond J. Higham, Vanni Noferini, Ryan Wood:
Weighted Enumeration of Nonbacktracking Walks on Weighted Graphs. SIAM J. Matrix Anal. Appl. 45(1): 397-418 (2024)- 2021
- [j11]Francesca Arrigo, Desmond J. Higham, Vanni Noferini:
A Theory for Backtrack-Downweighted Walks. SIAM J. Matrix Anal. Appl. 42(3): 1229-1247 (2021) - [j10]Francesca Arrigo, Fabio Durastante:
Mittag-Leffler Functions and their Applications in Network Science. SIAM J. Matrix Anal. Appl. 42(4): 1581-1601 (2021) - [i8]Francesca Arrigo, Fabio Durastante:
Mittag-Leffler functions and their applications in network science. CoRR abs/2103.12559 (2021) - 2020
- [i7]Francesca Arrigo, Desmond J. Higham, Vanni Noferini:
A Theory for Backtrack-Downweighted Walks. CoRR abs/2012.02999 (2020)
2010 – 2019
- 2019
- [j9]Francesca Arrigo, Desmond J. Higham, Vanni Noferini:
Non-backtracking PageRank. J. Sci. Comput. 80(3): 1419-1437 (2019) - [j8]Francesca Arrigo, Desmond J. Higham, Vanni Noferini:
Non-Backtracking Alternating Walks. SIAM J. Appl. Math. 79(3): 781-801 (2019) - [c2]Francesca Arrigo, Francesco Tudisco:
Multi-Dimensional, Multilayer, Nonlinear and Dynamic HITS. SDM 2019: 369-377 - [i6]Francesca Arrigo, Desmond J. Higham, Francesco Tudisco:
A framework for second order eigenvector centralities and clustering coefficients. CoRR abs/1910.12711 (2019) - 2018
- [j7]Francesca Arrigo, Peter Grindrod, Desmond J. Higham, Vanni Noferini:
Non-backtracking walk centrality for directed networks. J. Complex Networks 6(1): 54-78 (2018) - [j6]Francesco Tudisco, Francesca Arrigo, Antoine Gautier:
Node and Layer Eigenvector Centralities for Multiplex Networks. SIAM J. Appl. Math. 78(2): 853-876 (2018) - [i5]Francesca Arrigo, Francesco Tudisco:
Multi-Dimensional, Multilayer, Nonlinear and Dynamic HITS. CoRR abs/1809.08004 (2018) - 2017
- [j5]Francesca Arrigo, Desmond J. Higham:
Sparse matrix computations for dynamic network centrality. Appl. Netw. Sci. 2: 17 (2017) - [i4]Francesco Tudisco, Francesca Arrigo, Antoine Gautier:
Node and layer eigenvector centralities for multiplex networks. CoRR abs/1711.08448 (2017) - 2016
- [j4]Francesca Arrigo, Michele Benzi:
Edge Modification Criteria for Enhancing the Communicability of Digraphs. SIAM J. Matrix Anal. Appl. 37(1): 443-468 (2016) - [j3]Francesca Arrigo, Michele Benzi, Caterina Fenu:
Computation of Generalized Matrix Functions. SIAM J. Matrix Anal. Appl. 37(3): 836-860 (2016) - [j2]Francesca Arrigo, Michele Benzi:
Updating and Downdating Techniques for Optimizing Network Communicability. SIAM J. Sci. Comput. 38(1) (2016) - [c1]Francesca Arrigo, Desmond J. Higham:
Preserving Sparsity in Dynamic Network Computations. COMPLEX NETWORKS 2016: 147-157 - 2015
- [j1]Ernesto Estrada, Francesca Arrigo:
Predicting Triadic Closure in Networks Using Communicability Distance Functions. SIAM J. Appl. Math. 75(4): 1725-1744 (2015) - [i3]Francesca Arrigo, Michele Benzi:
Edge modification criteria for enhancing the communicability of digraphs. CoRR abs/1508.01056 (2015) - 2014
- [i2]Francesca Arrigo, Michele Benzi:
Updating and downdating techniques for optimizing network communicability. CoRR abs/1410.5303 (2014) - [i1]Ernesto Estrada, Francesca Arrigo:
Predicting triadic closure in networks using communicability distance functions. CoRR abs/1411.5599 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
