On the radius of centrality in evolving communication networks

Danica Vukadinović Greetham, Zhivko Stoyanov () and Peter Grindrod
Additional contact information
Danica Vukadinović Greetham: University of Reading
Zhivko Stoyanov: University of Reading
Peter Grindrod: University of Oxford, Andrew Wiles Building

Journal of Combinatorial Optimization, 2014, vol. 28, issue 3, No 4, 540-560

Abstract: 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 broadcasters 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$$ 12.4 k individuals during 1 week, and a subset of the Enron email data set.

Keywords: Networks; Evolving networks; Spectral radius; Centrality; Centrality ranking; Communicability; PageRank (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9726-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-014-9726-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9726-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().