Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Quantum Google in a complex network

Autor
Paparo, G.D; Muller, M.; Comellas, F.; Martin, M.
Tipus d'activitat
Article en revista
Revista
Scientific reports
Data de publicació
2013-10-04
Volum
3
Pàgina inicial
2773-1
Pàgina final
2773-16
DOI
https://doi.org/10.1038/srep02773 Obrir en finestra nova
Projecte finançador
Optimización y Problemas Extremales en Teoría de Grafos y Combinatoria. Aplicaciones a las Redes de Comunicación.
Repositori
http://hdl.handle.net/2117/24220 Obrir en finestra nova
URL
http://www.nature.com/srep/2013/131004/srep02773/full/srep02773.html Obrir en finestra nova
Resum
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...
Citació
Paparo, G.D [et al.]. Quantum Google in a complex network. "Scientific reports", 04 Octubre 2013, vol. 3, p. 2773-1-2773-16.
Paraules clau
Complex networks, Computer science, Information technology, Information theory and computation, Quantum information
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants

Arxius