Abstract
The study of complex networks has recently attracted increasing interest because of the large variety of systems that can be modeled using graphs. A fundamental operation in the analysis of complex networks is that of measuring the centrality of a vertex. In this paper, we propose to measure vertex centrality using a continuous-time quantum walk. More specifically, we relate the importance of a vertex to the influence that its initial phase has on the interference patterns that emerge during the quantum walk evolution. To this end, we make use of the quantum Jensen-Shannon divergence between two suitably defined quantum states. We investigate how the importance varies as we change the initial state of the walk and the Hamiltonian of the system. We find that, for a suitable combination of the two, the importance of a vertex is almost linearly correlated with its degree. Finally, we evaluate the proposed measure on two commonly used networks.
Chapter PDF
Similar content being viewed by others
References
Estrada, E.: The Structure of Complex Networks. Oxford University Press (2011)
Jeong, H., Tombor, B., Albert, R., Oltvai, Z., Barabási, A.: The large-scale organization of metabolic networks. Nature 407, 651–654 (2000)
Ito, T., Chiba, T., Ozawa, R., Yoshida, M., Hattori, M., Sakaki, Y.: A comprehensive two-hybrid analysis to explore the yeast protein interactome. Proceedings of the National Academy of Sciences 98, 4569 (2001)
Sporns, O.: Network analysis, complexity, and brain function. Complexity 8, 56–60 (2002)
Newman, M.: Scientific collaboration networks. i. network construction and fundamental results. Physical Review E 64, 016131 (2001)
Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry, 35–41 (1977)
Freeman, L.C.: Centrality in social networks conceptual clarification. Social Networks 1, 215–239 (1979)
Newman, M.E.: A measure of betweenness centrality based on random walks. Social Networks 27, 39–54 (2005)
Bonacich, P.: Power and centrality: A family of measures. American Journal of Sociology, 1170–1182 (1987)
Stanley, W., Faust, K.: Social network analysis: methods and applications. Cambridge University, Cambridge (1994)
Kempe, J.: Quantum random walks: an introductory overview. Contemporary Physics 44, 307–327 (2003)
Lamberti, P., Majtey, A., Borras, A., Casas, M., Plastino, A.: Metric character of the quantum jensen-shannon divergence. Physical Review A 77, 052311 (2008)
Lin, J.: Divergence measures based on the shannon entropy. IEEE Transactions on Information Theory 37, 145–151 (1991)
Farhi, E., Gutmann, S.: Quantum computation and decision trees. Physical Review A 58, 915 (1998)
Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information. Cambridge University Press, Cambridge (2010)
Rossi, L., Torsello, A., Hancock, E.R., Wilson, R.C.: Characterizing graph symmetries through quantum jensen-shannon divergence. Physical Review E 88, 032806 (2013)
Lee, C.Y.: Correlations among centrality measures in complex networks. arXiv preprint physics/0605220 (2006)
Zachary, W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)
Padgett, J.F., Ansell, C.K.: Robust action and the rise of the medici, 1400-1434. American Journal of Sociology, 1259–1319 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rossi, L., Torsello, A., Hancock, E.R. (2014). Node Centrality for Continuous-Time Quantum Walks. In: Fränti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds) Structural, Syntactic, and Statistical Pattern Recognition. S+SSPR 2014. Lecture Notes in Computer Science, vol 8621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44415-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-44415-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44414-6
Online ISBN: 978-3-662-44415-3
eBook Packages: Computer ScienceComputer Science (R0)
