Loading...
Loading...

Go to the content (press return)

Quantum Google in a complex network

Author
Paparo, G.D; Muller, M.; Comellas, F.; Martin, M.
Type of activity
Journal article
Journal
Scientific reports
Date of publication
2013-10-04
Volume
3
First page
2773-1
Last page
2773-16
DOI
https://doi.org/10.1038/srep02773 Open in new window
Project funding
Optimización y Problemas Extremales en Teoría de Grafos y Combinatoria. Aplicaciones a las Redes de Comunicación.
Repository
http://hdl.handle.net/2117/24220 Open in new window
URL
http://www.nature.com/srep/2013/131004/srep02773/full/srep02773.html Open in new window
Abstract
We investigate the behaviour of the recently proposed Quantum PageRank algorithm, in large complex networks. We find that the algorithm is able to univocally reveal the underlying topology of the network and to identify and order the most relevant nodes. Furthermore, it is capable to clearly highlight the structure of secondary hubs and to resolve the degeneracy in importance of the low lying part of the list of rankings. The quantum algorithm displays an increased stability with respect to a va...
Citation
Paparo, G.D [et al.]. Quantum Google in a complex network. "Scientific reports", 04 Octubre 2013, vol. 3, p. 2773-1-2773-16.
Keywords
Complex networks, Computer science, Information technology, Information theory and computation, Quantum information
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments