No Cover Image

Journal article 831 views

Quantum Google algorithm

G. D. Paparo, M. Müller, F. Comellas, M. A. Martin-Delgado, Markus Muller

The European Physical Journal Plus, Volume: 129, Issue: 7

Swansea University Author: Markus Muller

Full text not available from this repository: check for access using links below.

DOI (Published version): 10.1140/epjp/i2014-14150-y

Abstract

We review the main findings on the ranking capabilities of the recently proposed QuantumPageRank 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 theunderl...

Full description

Published in: The European Physical Journal Plus
Published: 2014
URI: https://cronfa.swan.ac.uk/Record/cronfa28644
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2016-06-03T19:16:41Z
last_indexed 2018-02-09T05:12:57Z
id cronfa28644
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2017-08-14T14:47:02.6151210</datestamp><bib-version>v2</bib-version><id>28644</id><entry>2016-06-03</entry><title>Quantum Google algorithm</title><swanseaauthors><author><sid>9b2ac559af27c967ece69db08b83762a</sid><firstname>Markus</firstname><surname>Muller</surname><name>Markus Muller</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2016-06-03</date><deptcode>FGSEN</deptcode><abstract>We review the main findings on the ranking capabilities of the recently proposed QuantumPageRank 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 theunderlying topology of the network and to be capable of clearly highlighting the structure of secondary hubsof networks. Furthermore, it can resolve the degeneracy in importance of the low-lying part of the list ofrankings. Examples of applications include real-world instances from the WWW, which typically display ascale-free network structure and models of hierarchical networks. The quantum algorithm has been shownto display an increased stability with respect to a variation of the damping parameter, present in theGoogle algorithm, and a more clearly pronounced power-law behaviour in the distribution of importanceamong the nodes, as compared to the classical algorithm.</abstract><type>Journal Article</type><journal>The European Physical Journal Plus</journal><volume>129</volume><journalNumber>7</journalNumber><publisher/><keywords/><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2014</publishedYear><publishedDate>2014-12-31</publishedDate><doi>10.1140/epjp/i2014-14150-y</doi><url/><notes/><college>COLLEGE NANME</college><department>Science and Engineering - Faculty</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>FGSEN</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2017-08-14T14:47:02.6151210</lastEdited><Created>2016-06-03T17:50:20.6096306</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Biosciences, Geography and Physics - Physics</level></path><authors><author><firstname>G. D.</firstname><surname>Paparo</surname><order>1</order></author><author><firstname>M.</firstname><surname>M&#xFC;ller</surname><order>2</order></author><author><firstname>F.</firstname><surname>Comellas</surname><order>3</order></author><author><firstname>M. A.</firstname><surname>Martin-Delgado</surname><order>4</order></author><author><firstname>Markus</firstname><surname>Muller</surname><order>5</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2017-08-14T14:47:02.6151210 v2 28644 2016-06-03 Quantum Google algorithm 9b2ac559af27c967ece69db08b83762a Markus Muller Markus Muller true false 2016-06-03 FGSEN We review the main findings on the ranking capabilities of the recently proposed QuantumPageRank 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 theunderlying topology of the network and to be capable of clearly highlighting the structure of secondary hubsof networks. Furthermore, it can resolve the degeneracy in importance of the low-lying part of the list ofrankings. Examples of applications include real-world instances from the WWW, which typically display ascale-free network structure and models of hierarchical networks. The quantum algorithm has been shownto display an increased stability with respect to a variation of the damping parameter, present in theGoogle algorithm, and a more clearly pronounced power-law behaviour in the distribution of importanceamong the nodes, as compared to the classical algorithm. Journal Article The European Physical Journal Plus 129 7 31 12 2014 2014-12-31 10.1140/epjp/i2014-14150-y COLLEGE NANME Science and Engineering - Faculty COLLEGE CODE FGSEN Swansea University 2017-08-14T14:47:02.6151210 2016-06-03T17:50:20.6096306 Faculty of Science and Engineering School of Biosciences, Geography and Physics - Physics G. D. Paparo 1 M. Müller 2 F. Comellas 3 M. A. Martin-Delgado 4 Markus Muller 5
title Quantum Google algorithm
spellingShingle Quantum Google algorithm
Markus Muller
title_short Quantum Google algorithm
title_full Quantum Google algorithm
title_fullStr Quantum Google algorithm
title_full_unstemmed Quantum Google algorithm
title_sort Quantum Google algorithm
author_id_str_mv 9b2ac559af27c967ece69db08b83762a
author_id_fullname_str_mv 9b2ac559af27c967ece69db08b83762a_***_Markus Muller
author Markus Muller
author2 G. D. Paparo
M. Müller
F. Comellas
M. A. Martin-Delgado
Markus Muller
format Journal article
container_title The European Physical Journal Plus
container_volume 129
container_issue 7
publishDate 2014
institution Swansea University
doi_str_mv 10.1140/epjp/i2014-14150-y
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Biosciences, Geography and Physics - Physics{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Biosciences, Geography and Physics - Physics
document_store_str 0
active_str 0
description We review the main findings on the ranking capabilities of the recently proposed QuantumPageRank 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 theunderlying topology of the network and to be capable of clearly highlighting the structure of secondary hubsof networks. Furthermore, it can resolve the degeneracy in importance of the low-lying part of the list ofrankings. Examples of applications include real-world instances from the WWW, which typically display ascale-free network structure and models of hierarchical networks. The quantum algorithm has been shownto display an increased stability with respect to a variation of the damping parameter, present in theGoogle algorithm, and a more clearly pronounced power-law behaviour in the distribution of importanceamong the nodes, as compared to the classical algorithm.
published_date 2014-12-31T03:34:53Z
_version_ 1763751486943133696
score 11.012678

Similar Items