A new approach for aggregated PageRank computation via distributed randomized algorithms

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2011, Pages 6421-6426

  Ishii, Hideaki ^a   Tempo, Roberto ^b   Bai, Er Wei ^c  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b POLITECNICO DI TORINO   (Italy)

^c University of Iowa   (United States)

Author keywords

Distributed computation; Multi agent consensus; PageRank algorithm; Randomization; Search engines

Indexed keywords

MULTI AGENT SYSTEMS; SEARCH ENGINES;

CONVERGENCE PROPERTIES; DISTRIBUTED COMPUTATIONS; MULTI AGENT; PAGERANK ALGORITHM; PAGERANK COMPUTATIONS; RANDOMIZATION; RANDOMIZED ALGORITHMS; RANDOMIZED APPROACH;

WEBSITES;

EID: 84860658357     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2011.6160880     Document Type: Conference Paper

References (18)

1. K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova. Monte Carlo methods in PageRank computation: When one iteration is sufficient. SIAM J. Numer. Anal., 45:890-904, 2007.
2. E. Biyik and M. Arcak. Area aggregation and time-scale modeling for sparse nonlinear networks. Syst. & Contr. Lett., 57:142-149, 2008.
3. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE Trans. Inform. Theory, 52:2508-2530, 2006.
4. A. Z. Broder, R. Lempel, F. Maghoul, and J. Pedersen. Efficient PageRank approximation via graph aggregation. Inform. Retrieval, 9:123-138, 2006.
5. K. Cai and H. Ishii. Quantized consensus and averaging on gossip digraphs. IEEE Trans. Autom. Control, 56:2087-2100, 2011.
6. R. Carli, F. Fagnani, A. Speranzon, and S. Zampieri. Communication constraints in the average consensus problem. Automatica, 44:671-684, 2008.
7. J. H. Chow and P. V. Kokotovic. Time scale modeling of sparse dynamic networks. IEEE Trans. Autom. Control, 30:714-722, 1985.
8. G. H. Golub and C. F. Van Loan. Matrix Computations, 3rd edition. Johns Hopkins University Press, 1996.
9. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge Univ. Press, 1985.
10. H. Ishii and R. Tempo. Distributed randomized algorithms for the PageRank computation. IEEE Trans. Autom. Control, 55:1987-2002, 2010.
11. H. Ishii, R. Tempo, and E.-W. Bai. Distributed randomized PageRank algorithms based on web aggregation over unreliable channels. In Proc. 49th IEEE Conf. Decision and Control, pages 6602-6607, 2010.
12. H. Ishii, R. Tempo, and E.-W. Bai. Distributed randomized PageRank algorithms based on web aggregation. Technical Report, 2011.
13. H. Ishii, R. Tempo, E.-W. Bai, and F. Dabbene. Distributed randomized PageRank computation based on web aggregation. In Proc. 48th IEEE Conf. on Decision and Control, pages 3026-3031, 2009.
14. S. Kamvar, T. Haveliwala, and G. Golub. Adaptive methods for the computation of PageRank. Linear Algebra Appl., 386:51-65, 2004.
15. G. Kollias, E. Gallopoulos, and D. B. Szyld. Asynchronous iterative computations with web information retrieval structures: The PageRank case. In G. R. Joubert et al., editors, Parallel Computing: Current and Future Issues of High-End Computing, vol. 33 of NIC Series, pages 309-316. J. von Neumann-Institut for Computing, Germany, 2006.
16. A. N. Langville and C. D. Meyer. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton Univ. Press, 2006.
17. R. G. Phillips and P. V. Kokotovic. A singular perturbation approach to modeling and control of Markov chains. IEEE Trans. Autom. Control, 26:1087-1094, 1981.
18. R. Tempo, G. Calafiore, and F. Dabbene. Randomized Algorithms for Analysis and Control of Uncertain Systems. Springer, London, 2005.