Loading...
Loading...

Go to the content (press return)

Quantum Google algorithm

Author
Paparo, G.D; Muller, M.; Comellas, F.; Martin, M.
Type of activity
Journal article
Journal
European physical journal plus
Date of publication
2014-07
Volume
129
Number
7
First page
150
Last page
166
DOI
https://doi.org/10.1140/epjp/i2014-14150-y Open in new window
Project funding
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Repository
http://hdl.handle.net/2117/26756 Open in new window
URL
http://link.springer.com/article/10.1140%2Fepjp%2Fi2014-14150-y Open in new window
Abstract
We review the main findings on the ranking capabilities of the recently proposed Quantum PageRank algorithm (G.D. Paparo et al., Sci. Rep. 2, 444 (2012) and G.D. Paparo et al., Sci. Rep. 3, 2773 (2013)) applied to large complex networks. The algorithm has been shown to identify unambiguously the underlying topology of the network and to be capable of clearly highlighting the structure of secondary hubs of networks. Furthermore, it can resolve the degeneracy in importance of the low-lying part of...
Citation
Paparo, G.D [et al.]. Quantum Google algorithm. "European physical journal plus", Juliol 2014, vol. 129, núm. 7, p. 150-166.
Keywords
PageRank, complex networks, quantum Google algorithm
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments