Ranking nodes in directed networks via continuous-time quantum walks
From MaRDI portal
Publication:6107742
DOI10.1007/s11128-023-03975-6arXiv2210.13379OpenAlexW4380483929MaRDI QIDQ6107742
Publication date: 3 July 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.13379
Cites Work
- Laplacian versus adjacency matrix in quantum walk search
- On the relationship between continuous- and discrete-time quantum walk
- Quantum walks: a comprehensive review
- Ranking hubs and authorities using matrix functions
- Comparing classical and quantum pageranks
- Discrete quantum walks hit exponentially faster
- An example of the difference between quantum and classical random walks
- Discrete-time quantum walk algorithm for ranking nodes on a network
- Authoritative sources in a hyperlinked environment
- Distance between two random k-out digraphs, with and without preferential attachment
- Exponential algorithmic speedup by a quantum walk
- Deeper Inside PageRank
- Quantum hub and authority centrality measures for directed networks based on continuous-time quantum walks
- Quantum walks on graphs
- Network Centrality: An Introduction
- A NEW MEASURE OF RANK CORRELATION
- Classical and Quantum Random-Walk Centrality Measures in Multilayer Networks
- Quantum walks and search algorithms
- Unnamed Item
This page was built for publication: Ranking nodes in directed networks via continuous-time quantum walks
