#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2015

2017

- This year (1)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Francesca Arrigo, Michele Benzi
- SIAM J. Scientific Computing
- 2016

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 of nodes. This quantity offers a good measure of how easily information spreads across the network, and can be useful in the design of networks having certain desirable… (More)

- Francesca Arrigo, Michele Benzi
- SIAM J. Matrix Analysis Applications
- 2016

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 describe fast and effective criteria for the selection of edges to be added to (or deleted from) a given directed network so as to enhance these network communicability measures.… (More)

- Ernesto Estrada, Francesca Arrigo
- SIAM Journal of Applied Mathematics
- 2015

We propose a communication-driven mechanism for predicting triadic closure in complex networks. It is mathematically formulated on the basis of communicability distance functions that account for the “goodness” of communication between nodes in the network. We study 25 real-world networks and show that the proposed method predicts correctly 20% of triadic… (More)

- Francesca Arrigo, Michele Benzi, Caterina Fenu
- SIAM J. Matrix Analysis Applications
- 2016

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 Algebra, 1(2), 1973, pp. 163–171]. Our algorithms are based on Gaussian quadrature and Golub–Kahan bidiagonalization. Block variants are also investigated. Numerical experiments are… (More)

- NETWORK COMMUNICABILITY, FRANCESCA ARRIGO, MICHELE BENZI
- 2016

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 of nodes. This quantity offers a good measure of how easily information spreads across the network, and can be useful in the design of networks having certain desirable… (More)

Abstract. In this document we summarize a few supplementary results to the accompanying paper. We give a detailed proof of the bounds on the normalized total communicability obtained via quadrature rules (Theorem 3.1, section 3). We also derive the computational costs for the heuristics introduced. Moreover, this document contains the results of some… (More)

*Correspondence: francesca.arrigo@strath.ac.uk University of Strathclyde, 16 Richmond St, G1 1XQ Glasgow, UK Abstract Time sliced networks describing human-human digital interactions are typically large and sparse. This is the case, for example, with pairwise connectivity describing social media, voice call or physical proximity, when measured over seconds,… (More)

- Francesca Arrigo, Desmond J. Higham
- COMPLEX NETWORKS
- 2016

- ‹
- 1
- ›