On the radius of centrality in evolving communication networks

Vukadinović Greetham, Danica; Stoyanov, Zhivko and Grindrod, Peter (2014). On the radius of centrality in evolving communication networks. Journal of Combinatorial Optimization, 28(3) pp. 540–560.

DOI: https://doi.org/10.1007/s10878-014-9726-0

Abstract

In this article, we investigate how the choice of the attenuation factor in an extended version of Katz centrality influences the centrality of the nodes in evolving communication networks. For given snapshots of a network, observed over a period of time, recently developed communicability indices aim to identify the best broad- casters and listeners (receivers) in the network. Here we explore the attenuation factor constraint, in relation to the spectral radius (the largest eigenvalue) of the network at any point in time and its computation in the case of large networks. We compare three different communicability measures: standard, exponential, and relaxed (where the spectral radius bound on the attenuation factor is relaxed and the adjacency matrix is normalised, in order to maintain the convergence of the measure). Furthermore, using a vitality-based measure of both standard and relaxed communicability indices, we look at the ways of establishing the most important individuals for broadcasting and receiving of messages related to community bridging roles. We compare those measures with the scores produced by an iterative version of the PageRank algorithm and illustrate our findings with three examples of real-life evolving networks: the MIT reality mining data set, consisting of daily communications between 106 individuals over the period of 1 year, a UK Twitter mentions network, constructed from the direct tweets between 12.4 k individuals during 1 week, and a subset of the Enron email data set.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI