- Access by Xinjiang University
Temporal node centrality in complex networks
Phys. Rev. E 85, 026107 – Published 13 February, 2012
DOI: https://doi.org/10.1103/PhysRevE.85.026107
Abstract
Many networks are dynamic in that their topology changes rapidly—on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been lacking for the dynamic case. In this paper we present a simple but powerful model, the time-ordered graph, which reduces a dynamic network to a static network with directed flows. This enables us to extend network properties such as vertex degree, closeness, and betweenness centrality metrics in a very natural way to the dynamic case. We then demonstrate how our model applies to a number of interesting edge cases, such as where the network connectivity depends on a small number of highly mobile vertices or edges, and show that our centrality definition allows us to track the evolution of connectivity. Finally we apply our model and techniques to two real-world dynamic graphs of human contact networks and then discuss the implication of temporal centrality metrics in the real world.
Article Text
References (15)
- The Structure and Dynamics of Networks, edited by M. E. J. Newman, A. L. Barabási, and D. J. Watts (Princeton University Press, Princeton, 2010).
- R. Albert, H. Jeong, and A. Barabasi, Nature (London) 406, 378 (2000).
- S. Nagaraja and R. Anderson, in Proceedings of the Fifth Workshop on the Economics of Information Security (WEIS 2006), edited by Ross Anderson (Cambridge, UK, 2006).
- H. Kim, J. Tang, R. Anderson, and C. Mascolo, Comput. Networks 56, 983 (2012).
- J. Tang, M. Musolesi, C. Mascolo, V. Latora, and V. Nicosia, in Proceedings of the 3rd Workshop on Social Network Systems, SNS ’10 (ACM, New York, 2010), pp. 3:1–3:6.
- D. Kempe, J. Kleinberg, and A. Kumar, J. Comput. Syst. Sci. 64, 820 (2002).
- A. Ferreira, Network, IEEE 18, 24 (2004).
- V. Kostakos, Physica A 388, 1007 (2009).
- J. Tang, M. Musolesi, C. Mascolo, and V. Latora, SIGCOMM Comput. Commun. Rev. 40, 118 (2010).
- J. Tang, C. Mascolo, M. Musolesi, and V. Latora, in Proceedings of the 12th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM 2011) (IEEE, Lucca, Italy, 2011), pp. 1–9.
- T. Opsahl, F. Agneessens, and J. Skvoretz, Social Networks 32, 245 (2010).
- http://www.haggleproject.org.
- N. Eagle and A. (Sandy) Pentland, Personal Ubiquitous Comput. 10, 255 (2006).
- http://web.mit.edu/registrar/www/calendar0405.html.
- J. L. Myers, A. D. Well, and R. F. Lorch, Research Design and Statistical Analysis (Lawrence Erlbaum Associates, Hillsdale, NJ, 2003).