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. © 2012 Springer-Verlag Berlin Heidelberg.
|Data di pubblicazione:||2012|
|Titolo:||Approximate Axial Symmetries from Continuous Time Quantum Walks|
|Titolo del libro:||Structural, Syntactic, and Statistical Pattern Recognition - Joint IAPR International Workshop, SSPR&SPR 2012|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-642-34166-3_16|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|