Abstract
The analysis of complex networks is usually based on key properties such as small-worldness and vertex degree distribution. The presence of symmetric motifs on the other hand has been related to redundancy and thus robustness of the networks. In this paper we propose a method for detecting approximate axial symmetries in networks. For each pair of nodes, we define a continuous-time quantum walk which is evolved through time. By measuring the probability that the quantum walker to visits each node of the network in this time frame, we are able to determine whether the two vertices are symmetrical with respect to any axis of the graph. Moreover, we show that we are able to successfully detect approximate axial symmetries too. We show the efficacy of our approach by analysing both synthetic and real-world data.
Keywords
- Complex Network
- Symmetry
- Quantum Walk
Chapter PDF
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)
West, G., Brown, J., Enquist, B.: A general model for the structure, function, and allometry of plant vascular systems. Nature 400, 664–667 (1999)
Newman, M.: Scientific collaboration networks. i. network construction and fundamental results. Physical Review E 64, 016131 (2001)
Kalapala, V., Sanwalani, V., Moore, C.: The structure of the united states road network. University of New Mexico (2003) (preprint)
Erdös, P., Rényi, A.: On random graphs. Publ. Math. Debrecen 6, 290–297 (1959)
MacArthur, B., Sánchez-García, R., Anderson, J.: Symmetry in complex networks. Discrete Applied Mathematics 156, 3525–3531 (2008)
Xiao, Y., Xiong, M., Wang, W., Wang, H.: Emergence of symmetry in complex networks. Phys. Rev. E 77, 066108 (2008)
Mowshowitz, A.: Entropy and the complexity of graphs: I. an index of the relative complexity of a graph. Bulletin of Mathematical Biology 30, 175–204 (1968)
Emms, D., Wilson, R., Hancock, E.: Graph Embedding Using Quantum Commute Times. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol. 4538, pp. 371–382. Springer, Heidelberg (2007)
Emms, D., Severini, S., Wilson, R., Hancock, E.: Coined Quantum Walks Lift the Cospectrality of Graphs and Trees. In: Rangarajan, A., Vemuri, B.C., Yuille, A.L. (eds.) EMMCVPR 2005. LNCS, vol. 3757, pp. 332–345. Springer, Heidelberg (2005)
Kempe, J.: Quantum random walks: an introductory overview. Contemporary Physics 44, 307–327 (2003)
Farhi, E., Gutmann, S.: Quantum computation and decision trees. Physical Review A 58, 915 (1998)
Mahdian, M., Xu, Y.: Stochastic Kronecker Graphs. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 179–186. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rossi, L., Torsello, A., Hancock, E.R. (2012). Approximate Axial Symmetries from Continuous Time Quantum Walks. In: Gimel’farb, G., et al. Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2012. Lecture Notes in Computer Science, vol 7626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34166-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-34166-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34165-6
Online ISBN: 978-3-642-34166-3
eBook Packages: Computer ScienceComputer Science (R0)
-
Published in cooperation with
http://www.iapr.org/
