Projects per year
Abstract
Time sliced networks describing humanhuman 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, minutes or hours. However, if we wish to quantify and compare the overall timedependent centrality of the network nodes, then we should account for the global flow of information through time. Because the timedependent edge structure typically allows information to diffuse widely around the network, a natural summary of sparse but dynamic pairwise interactions will generally take the form of a large dense matrix. For this reason, computing nodal centralities for a timedependent network can be extremely expensive in terms of both computation and storage; much more so than for a single, static network. In this work, we focus on the case of dynamic communicability, which leads to broadcast and receive centrality measures. We derive a new algorithm for computing timedependent centrality that works with a sparsified version of the dynamic communicability matrix. In this way, the computation and storage requirements are reduced to those of a sparse, static network at each time point. The new algorithm is justified from first principles and then tested on a large scale data set. We find that even with very stringent sparsity requirements (retaining no more than ten times the number of nonzeros in the individual time slices), the algorithm accurately reproduces the list of highly central nodes given by the underlying full system. This allows us to capture centrality over time with a minimal level of storage and with a cost that scales only linearly with the number of time points. We also describe and test three variants of the proposed algorithm that require fewer parameters and achieve a further reduction in the computational cost.
Original language  English 

Article number  17 
Number of pages  19 
Journal  Applied Network Science 
Volume  2 
DOIs  
Publication status  Published  24 Jun 2017 
Keywords
 dynamic networks
 sparsification
 centrality
 Katz centrality
 social network analysis
 dynamic communicability
 timedependent centrality
 sparsity requirements
Fingerprint Dive into the research topics of 'Sparse matrix computations for dynamic network centrality'. Together they form a unique fingerprint.
Projects
 1 Finished

Data Analytics for Future Cities
Higham, D.
EPSRC (Engineering and Physical Sciences Research Council)
1/01/15 → 31/12/19
Project: Research Fellowship