Quantum transport senses community structure in networks
arXiv:1711.04979 · doi:10.1103/PhysRevE.98.022301
Abstract
Quantum time evolution exhibits rich physics, attributable to the interplay between the density and phase of a wave function. However, unlike classical heat diffusion, the wave nature of quantum mechanics has not yet been extensively explored in modern data analysis. We propose that the Laplace transform of quantum transport (QT) can be used to construct an ensemble of maps from a given complex network to a circle , such that closely-related nodes on the network are grouped into sharply concentrated clusters on . The resulting QT clustering (QTC) algorithm is as powerful as the state-of-the-art spectral clustering in discerning complex geometric patterns and more robust when clusters show strong density variations or heterogeneity in size. The observed phenomenon of QTC can be interpreted as a collective behavior of the microscopic nodes that evolve as macroscopic cluster orbitals in an effective tight-binding model recapitulating the network. Python source code implementing the algorithm and examples are available at https://github.com/jssong-lab/QTC.
References in corpus (10)
- Quantum Computation and Decision Trees
- A Quantum Random Walk Search Algorithm
- Detecting fuzzy community structures in complex networks with a Potts model
- An example of the difference between quantum and classical random walks
- Quantum Navigation and Ranking in Complex Networks
- Potts model based on a Markov process computation solves the community structure problem effectively
- Degree Distribution in Quantum Walks on Complex Networks
- Community Detection in Quantum Complex Networks
- Information sharing in Quantum Complex Networks
- Exact heat kernel on a hypersphere and its applications in kernel SVM