Classical and quantum random-walk centrality measures in multilayer networks
arXiv:2012.07157 · doi:10.1137/20M1385998
Abstract
Multilayer network analysis is a useful approach for studying the structural properties of entities with diverse, multitudinous relations. Classifying the importance of nodes and node-layer tuples is an important aspect of the study of multilayer networks. To do this, it is common to calculate various centrality measures, which allow one to rank nodes and node-layers according to a variety of structural features. In this paper, we formulate occupation, PageRank, betweenness, and closeness centralities in terms of node-occupation properties of different types of continuous-time classical and quantum random walks on multilayer networks. We apply our framework to a variety of synthetic and real-world multilayer networks, and we identify marked differences between classical and quantum centrality measures. Our computations also give insights into the correlations between certain random-walk-based and geodesic-path-based centralities.
arXiv comment21 pages, 8 figures
References in corpus (35)
- Quantum Mechanics helps in searching for a needle in a haystack
- Multilayer Networks
- Diffusion dynamics on multiplex networks
- Spatial search by quantum walk
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Random walks and diffusion on networks
- Photons Walking the Line: A quantum walk with adjustable coin operations
- Random Walks on Multiplex Networks
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Realization of a quantum walk with one and two trapped ions
- Centrality in Interconnected Multilayer Networks
- Quantum walk of a trapped ion in phase space
- Eigenvector centrality of nodes in multiplex networks
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Spectral properties of the Laplacian of multiplex networks
- Experimental Implementation of Discrete Time Quantum Random Walk on an NMR Quantum Information Processor
- Identifying Infection Sources and Regions in Large Networks
- Multilayer Networks in a Nutshell
- Network Analysis of Particles and Grains
- Spatial search by quantum walk is optimal for almost all graphs
- Quantum stochastic walks: A generalization of classical random walks and quantum walks
- Random walk centrality in interconnected multilayer networks
- Google in a Quantum Network
- Quantum Navigation and Ranking in Complex Networks
- Survival Probabilities in Coherent Exciton Transfer with Trapping
- Ranking and clustering of nodes in networks with smart teleportation
- Global Symmetry is Unnecessary for Fast Quantum Search
- Quantum walk-based search and centrality
- Laplacian versus Adjacency Matrix in Quantum Walk Search
- Centrality measure based on continuous-time quantum walks and experimental realization
- Continuous-Time Quantum Search on Balanced Trees
- From classical to quantum walks with stochastic resetting on networks
- Random-Graph Models and Characterization of Granular Networks
- TensorFlow Solver for Quantum PageRank in Large-Scale Networks
- Random Walks on Complex Networks
Cited by in corpus (6)
- Multilayer Network Science: from Cells to Societies
- Complex networks with complex weights
- Higher-order Connection Laplacians for Directed Simplicial Complexes
- Coined quantum walks on the line: Disorder, entanglement, and localization
- Clustering-induced localization of quantum walks on networks
- Classical and Quantum Random Walks to Identify Leaders in Criminal Networks