Centrality and spectral radius in dynamic communication networksVukadinovic Greetham, D., Stoyanov, Z. and Grindrod, P. (2013) Centrality and spectral radius in dynamic communication networks. In: CSoNet, COCOON 2013, LNCS 7936, 22 June 2013, Hangzhou, China, pp. 791-800.
It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing. Official URL: http://link.springer.com/chapter/10.1007%2F978-3-6... Abstract/SummaryWe explore the influence of the choice of attenuation factor on Katz centrality indices for evolving communication networks. For given snapshots of a network observed over a period of time, recently developed communicability indices aim to identify best broadcasters and listeners in the network. In this article, we looked into the sensitivity of communicability indices on the attenuation factor constraint, in relation to spectral radius (the largest eigenvalue) of the network at any point in time and its computation in the case of large networks. We proposed relaxed communicability measures where the spectral radius bound on attenuation factor is relaxed and the adjacency matrix is normalised in order to maintain the convergence of the measure. Using a vitality based measure of both standard and relaxed communicability indices we looked at the ways of establishing the most important individuals for broadcasting and receiving of messages related to community bridging roles. We illustrated our findings with two examples of real-life networks, MIT reality mining data set of daily communications between 106 individuals during one year and UK Twitter mentions network, direct messages on Twitter between 12.4k individuals during one week.
Download Statistics DownloadsDownloads per month over past year Deposit Details University Staff: Request a correction | Centaur Editors: Update this record |