Null-eigenvalue localization of quantum walks on complex networks

  title={Null-eigenvalue localization of quantum walks on complex networks},
  author={Ruben Bueno and Naomichi Hatano},
  journal={arXiv: Physics and Society},
First we report that the adjacency matrices of real-world complex networks systematically have null eigenspaces with much higher dimensions than that of random networks. These null eigenvalues are caused by duplication mechanisms leading to structures with local symmetries which should be more present in complex organizations. The associated eigenvectors of these states are strongly localized. We then evaluate these microstructures in the context of quantum mechanics, demonstrating the… 

Figures and Tables from this paper


Enhancing the spreading of quantum walks on star graphs by additional bonds
The numerical results suggest that the maximal spreading is reached halfway between the star graph and the complete graph, and it is shown how this disorder-enhanced spreading is related to the networks’ eigenvalues.
Spectra and eigenvectors of scale-free networks.
  • K. Goh, B. Kahng, D. Kim
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
The spectral density shows an exponential decay around the center, followed by power-law long tails at both spectrum edges, and the mass gap scales as N(-0.68) and the component of the normalized eigenfunction at the hub is of order unity.
Spectra of Modular and Small-World Matrices
For small-world networks, it is found that the introduction of short cuts can lead to the creation of satellite bands outside the central band of extended states, exhibiting only localized states in the band gaps.
Localization of two-dimensional quantum walks
The Grover walk, which is related to Grover's search algorithm on a quantum computer, is one of the typical discrete time quantum walks. However, a localization of the two-dimensional Grover walk
Origin and implications of zero degeneracy in networks spectra.
This work provides all the possible reasons behind the occurrence of the zero degeneracy in the network spectra, namely, the complete and partial duplications, as well as their implications.
Spectra of complex networks.
It is shown that spectra of locally treelike random graphs may serve as a starting point in the analysis of spectral properties of real-world networks, e.g., of the Internet.
Discrete-time quantum walk on complex networks for community detection
It is claimed that the time average of the probability of the Fourier-coin quantum walk on complex networks reveals the community structure more explicitly than that of the Grover-coins quantum walk and a snapshot of the classical random walk.
Random Incidence Matrices: Moments of the Spectral Density
Two algorithms to compute the moments of the eigenvalue distribution as explicit polynomials in N and p are given and it is shown that the spectrum always contains a discrete component.
Spectral analysis and the dynamic response of complex networks.
It is shown that the spectral density of hierarchical networks follows a very different pattern, which can be used as a fingerprint of modularity, related to the homeostatic response of the network.
Spectral properties of complex networks.
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three