Classical and quantum random-walk centrality measures in multilayer networks

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.

21 pages, 8 figures

References in corpus (7)

• Diffusion dynamics on multiplex networks
• Spatial search by quantum walk
• Quantum Walk in Position Space with Single Optically Trapped Atoms
• Realization of quantum walks with negligible decoherence in waveguide lattices
• Survival Probabilities in Coherent Exciton Transfer with Trapping
• Centrality measure based on continuous-time quantum walks and experimental realization
• 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