Quantum Google in a Complex Network

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 highlig...

Descripción completa

Detalles Bibliográficos
Autores principales: Paparo, Giuseppe Davide, Müller, Markus, Comellas, Francesc, Martin-Delgado, Miguel Angel
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group 2013
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3790229/
https://www.ncbi.nlm.nih.gov/pubmed/24091980
http://dx.doi.org/10.1038/srep02773

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3790229/
https://www.ncbi.nlm.nih.gov/pubmed/24091980
http://dx.doi.org/10.1038/srep02773

Ejemplares similares