title: A dynamical systems view of network centrality.
abstract: To gain insights about dynamic networks, the dominant paradigm is to study discretesnapshots, ortimeslices, as the interactions evolve. Here, we develop and test a new mathematical framework where network evolution is handled over continuous time, giving an elegant dynamical systems representation for the important concept of node centrality. The resulting system allows us to track the relative influence of each individual. This new setting is natural in many digital applications, offering both conceptual and computational advantages. The novel differential equations approach is convenient for modelling and analysis of network evolution and gives rise to an interesting application of the matrix logarithm function. From a computational perspective, it avoids the awkward up-front compromises between accuracy, efficiency and redundancy required in the prevalent discrete-time setting. Instead, we can rely on state-of-the-art ODE software, where discretization takes place adaptively in response to the prevailing system dynamics. The new centrality system generalizes the widely used Katz measure, and allows us to identify and track, at any resolution, the most influential nodes in terms of broadcasting and receiving information through time-dependent links. In addition to the classical static network notion of attenuation across edges, the new ODE also allows for attenuation over time, as information becomes stale. This allows 'running measures' to be computed, so that networks can be monitored in real time over arbitrarily long intervals. With regard to computational efficiency, we explain why it is cheaper to track good receivers of information than good broadcasters. An important consequence is that the overall broadcast activity in the network can also be monitored efficiently. We use two synthetic examples to validate the relevance of the new measures. We then illustrate the ideas on a large-scale voice call network, where key features are discovered that are not evident from snapshots or aggregates.
authors.affiliation: Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK.
authors.forename: Peter
authors.initials: P
authors.lastname: Grindrod
authors.affiliation: Department of Mathematics and Statistics , University of Strathclyde , Glasgow G1 1XH, UK.
authors.forename: Desmond J
authors.initials: DJ
authors.lastname: Higham
keywords: algorithms; matrix computation; matrix logarithm; networks; online behaviour; real-time monitoring