Quantum Google algorithm
Visualitza/Obre
Cita com:
hdl:2117/26756
Tipus de documentArticle
Data publicació2014-07
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
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 the list of rankings. Examples of applications include real-world instances from the WWW, which typically display a scale-free network structure and models of hierarchical networks. The quantum algorithm has been shown to display an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance among the nodes, as compared to the classical algorithm.
CitacióPaparo, G.D [et al.]. Quantum Google algorithm. "European physical journal plus", Juliol 2014, vol. 129, núm. 7, p. 150-166.
ISSN2190-5444
Versió de l'editorhttp://link.springer.com/article/10.1140%2Fepjp%2Fi2014-14150-y
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
QGoogleReview_v13a.pdf | Article complet | 2,027Mb | Visualitza/Obre |