Affiliation:
1. Dipartimento di Matematica, Università di Pisa, Largo B. Pontecorvo 5, 56127 Pisa, Italy
2. C. R. ENEA Casaccia, Dipartimento TERIN, via Anguillarese 301, 00123 Rome, Italy
Abstract
Abstract
In this article, we introduce, test and discuss three quantum methods for computing hub and authority centrality scores in directed networks. The methods are based on unitary, continuous-time quantum walks; the construction of a suitable Hermitian Hamiltonian is achieved by performing a quantum walk on the associated bipartite graph. Two methods, called CQAu and CQAw, use the same evolution operator, inspired by the classical Hyperlink-Induced Topic Search (HITS) algorithm, but with different initial states; the computation of hub and authority scores is performed simultaneously. The third method, called CQG and inspired by classical PageRank, requires instead two separate runs with different evolution operators, one for hub and one for authority scores. The methods are tested on several directed graphs with different sizes and properties; a comparison with other well-established ranking algorithms is provided. CQAw emerges as the most reliable of the three methods and yields rankings that are largely compatible with results from HITS, although CQAu and CQG also present interesting features and potential for applications.
Publisher
Oxford University Press (OUP)
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization,Management Science and Operations Research,Computer Networks and Communications
Reference41 articles.
1. Centrality in social networks conceptual clarification;Freeman,;Soc. Netw.,1978
2. The anatomy of a large-scale hypertextual web search engine;Brin,;Comput. Netw. ISDN Syst.,1998
3. The PageRank citation ranking: bringing order to the web;Page,;Stanford InfoLab.,1999
4. Authoritative sources in a hyperlinked environment;Kleinberg,;J. ACM,1999
5. Ranking hubs and authorities using matrix functions;Benzi,;Linear Algebra Appl.,2013
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献