A matrix iteration for dynamic network summaries

Tools

Grindrod, P. and Higham, D.J. (2013) A matrix iteration for dynamic network summaries. SIAM Review, 55 (1). pp. 118-128. ISSN 0036-1445 (https://doi.org/10.1137/110855715)

[thumbnail of GrindrodHighamSIAM2013] PDF. Filename: GrindrodHighamSIAM2013.pdf
Final Published Version
Download (170kB)

Abstract

We propose a new algorithm for summarizing properties of large-scale time-evolving networks. This type of data, recording connections that come and go over time, is generated in many modern applications, including telecommunications and online human social behavior. The algorithm computes a dynamic measure of how well pairs of nodes can communicate by taking account of routes through the network that respect the arrow of time. We take the conventional approach of downweighting for length (messages become corrupted as they are passed along) and add the novel feature of downweighting for age (messages go out of date). This allows us to generalize widely used Katz-style centrality measures that have proved popular in network science to the case of dynamic networks sampled at nonuniform points in time. We illustrate the new approach on synthetic and real data.

ORCID iDs

Grindrod, P. and Higham, D.J. ORCID logoORCID: https://orcid.org/0000-0002-6635-3461;
CORE (COnnecting REpositories)