Encyclopedia of Systems and Control

2015 Edition
| Editors: John Baillieul, Tariq Samad

Markov Chains and Ranking Problems in Web Search

  • Hideaki Ishii
  • Roberto Tempo
Reference work entry
DOI: https://doi.org/10.1007/978-1-4471-5058-9_135

Abstract

Markov chains refer to stochastic processes whose states change according to transition probabilities determined only by the states of the previous time step. They have been crucial for modeling large-scale systems with random behavior in various fields such. as control, communications, biology, optimization, and economics. In this entry, we focus on their recent application to the area of search engines, namely, the PageRank algorithm employed at Google, which provides a measure of importance for each page in the web. We present several researches carried out with control theoretic tools such as aggregation, distributed randomized algorithms, and PageRank optimization. Due to the large size of the web, computational issues are the underlying motivation of these studies.

Keywords

Aggregation Distributed randomized algorithms Markov chains Optimization PageRank Search engines World wide web 
This is a preview of subscription content, log in to check access

Bibliography

  1. Aldhaheri R, Khalil H (1991) Aggregation of the policy iteration method for nearly completely decomposable Markov chains. IEEE Trans Autom Control 36:178–187MathSciNetGoogle Scholar
  2. Bertsekas D, Tsitsiklis J (1989) Parallel and distributed computation: numerical methods. Prentice-Hall, Englewood CliffsGoogle Scholar
  3. Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30:107–117Google Scholar
  4. de Kerchove C, Ninove L, Van Dooren P (2008) Influence of the outlinks of a page on its PageRank. Linear Algebra Appl 429:1254–1276MathSciNetGoogle Scholar
  5. Fercoq O, Akian M, Bouhtou M, Gaubert S (2013) Ergodic control and polyhedral approaches to PageRank optimization. IEEE Trans Autom Control 58:134–148MathSciNetGoogle Scholar
  6. Horn R, Johnson C (1985) Matrix analysis. Cambridge University Press, CambridgeGoogle Scholar
  7. Ishii H, Tempo R (2010) Distributed randomized algorithms for the PageRank computation. IEEE Trans Autom Control 55:1987–2002MathSciNetGoogle Scholar
  8. Ishii H, Tempo R, Bai EW (2012) A web aggregation approach for distributed randomized PageRank algorithms. IEEE Trans Autom Control 57:2703–2717MathSciNetGoogle Scholar
  9. Kumar P, Varaiya P (1986) Stochastic systems: estimation, identification, and adaptive control. Prentice Hall, Englewood CliffsGoogle Scholar
  10. Langville A, Meyer C (2006) Google’s PageRank and beyond: the science of search engine rankings. Princeton University Press, PrincetonGoogle Scholar
  11. Meyer C (1989) Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems. SIAM Rev 31:240–272MathSciNetGoogle Scholar
  12. Norris J (1997) Markov chains. Cambridge University Press, CambridgeGoogle Scholar
  13. Phillips R, Kokotovic P (1981) A singular perturbation approach to modeling and control of Markov chains. IEEE Trans Autom Control 26:1087–1094Google Scholar
  14. Puterman M (1994) Markov decision processes: discrete stochastic dynamic programming. Wiley, New YorkGoogle Scholar
  15. Zhao W, Chen H, Fang H (2013) Convergence of distributed randomized PageRank algorithms. IEEE Trans Autom Control 58:3255–3259Google Scholar

Copyright information

© Springer-Verlag London 2015

Authors and Affiliations

  • Hideaki Ishii
    • 1
  • Roberto Tempo
    • 2
  1. 1.Tokyo Institute of TechnologyYokohamaJapan
  2. 2.CNR-IEIIT, Politecnico di TorinoTorinoItaly