Journal article
PageRank computation via a distributed randomized approach with lossy communication
Systems & control letters, Vol.61(12), pp.1221-1228
12/2012
DOI: 10.1016/j.sysconle.2012.09.004
Abstract
For ranking web pages in search results, Google employs the so-called PageRank algorithm, which provides a measure of importance to each page based on the web structure. Recently, we have developed a distributed randomized approach for this algorithm, where pages compute their own PageRank by communicating over selected links. In this paper, the focus is on the effects of unreliability in communication channels. Specifically, we consider random data losses modeled as a Markov chain and introduce a generalized version of the distributed scheme. Its convergence properties and the error in the approximated PageRank are analyzed.
Details
- Title: Subtitle
- PageRank computation via a distributed randomized approach with lossy communication
- Creators
- Hideaki Ishii - Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology, 4259 Nagatsuta-cho, Midori-ku, Yokohama 226-8502, JapanRoberto Tempo - CNR-IEIIT, Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, ItalyEr-Wei Bai - Department of Electrical and Computer Engineering, The University of Iowa, 4316 Seamans Center for the Engineering Arts and Sciences, Iowa City, IA 52242-1527, USA
- Resource Type
- Journal article
- Publication Details
- Systems & control letters, Vol.61(12), pp.1221-1228
- DOI
- 10.1016/j.sysconle.2012.09.004
- ISSN
- 0167-6911
- eISSN
- 1872-7956
- Publisher
- Elsevier B.V
- Grant note
- 21760323 / Ministry of Education, Culture, Sports, Science and Technology in Japan FP7/2007-2013 / European Union Seventh Framework Programme 257462 / Network of Excellence
- Language
- English
- Date published
- 12/2012
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984083848802771
Metrics
24 Record Views