Skip to main content
SpringerLink
Log in

The Mathematics of Internet Search Engines

  • Published:
Acta Applicandae Mathematicae Aims and scope Submit manuscript

Abstract

This article presents a survey of techniques for ranking results in search engines, with emphasis on link-based ranking methods and the PageRank algorithm. The problem of selecting, in relation to a user search query, the most relevant documents from an unstructured source such as the WWW is discussed in detail. The need for extending classical information retrieval techniques such as boolean searching and vector space models with link-based ranking methods is demonstrated. The PageRank algorithm is introduced, and its numerical and spectral properties are discussed. The article concludes with an alternative means of computing PageRank, along with some example applications of this new method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Andersson, F.: Estimation of the quality of hyperlinked documents using a series formulation of PageRank. Master Thesis at the Centre for Mathematical Sciences, Faculty of Engineering, Lund University (2006)

  2. Bellman, R.: Introduction to Matrix Analysis. Classics in Applied Mathematics, vol. 19. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1997). Reprint of the second (1970) edition. With a foreword by Gene Golub

    MATH  Google Scholar 

  3. Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. Classics in Applied Mathematics, vol. 9. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1994). Revised reprint of the 1979 original

    MATH  Google Scholar 

  4. Billingsley, P.: Ergodic Theory and Information. Wiley, New York (1965)

    MATH  Google Scholar 

  5. Billingsley, P.: Convergence of Probability Measures, 2nd edn. Wiley Series in Probability and Statistics: Probability and Statistics. Wiley, New York (1999)

    MATH  Google Scholar 

  6. Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. In: Proceedings of the 7th International World Wide Web Conference, 1998

  7. Cvetković, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Academic, New York (1980)

    Google Scholar 

  8. Feller, W.: An Introduction to Probability Theory and its Applications, vol. I, 3rd edn. Wiley, New York (1968)

    MATH  Google Scholar 

  9. Feller, W.: An Introduction to Probability Theory and its Applications, vol. II, 2nd edn. Wiley, New York (1971)

    MATH  Google Scholar 

  10. Gantmacher, F.R.: Applications of the Theory of Matrices (1960)

  11. Golub, G.H., van Loan, C.F.V.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  12. Haveliwala, T.H., Kamvar, S.D.: The second eigenvalue of the Google matrix. Stanford University (2003)

  13. Haveliwala, T.H., Kamvar, S.D.: The condition number of the PageRank problem. Stanford University (2003)

  14. Isaacson, D.L., Madsen, R.W.: Markov Chains: Theory and Applications. Wiley, New York (1976)

    MATH  Google Scholar 

  15. Jorgensen, P.E.T.: Analysis and Probability: Wavelets, Signals, Fractals. Graduate Texts in Mathematics, vol. 234. Springer, New York (2006)

    MATH  Google Scholar 

  16. Kamvar, S.D., Haveliwala, T.H., Golub, G.: Adaptive methods for the computation of PageRank. Stanford University (2003)

  17. Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Exploiting the block structure of the Web for computing PageRank. Stanford University (2003)

  18. Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Extrapolation methods for accelerating PageRank computations. In: Proceedings of the 12th International World Wide Web Conference, 2003

  19. Kleinberg, J.: Authoritative sources in a hyperlinked environment. In: Journals of the 9th ACM-SIAM Symposium on Discrete Algorithms, 1999

  20. Lancaster, P., Tismenetsky, M.: The Theory of Matrices. Academic, Orlando (1985)

    MATH  Google Scholar 

  21. Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Math. 1(3), 335–380 (2004)

    MATH  MathSciNet  Google Scholar 

  22. Langville, A.N., Meyer, C.D.: Google’s PageRank and Beyond the Science of Search Engine Rankings. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

  23. Minc, H.: Nonnegative Matrices. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1988)

    Google Scholar 

  24. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the Web. Stanford Digital Libraries Working Paper, Stanford University (1998)

  25. Perron, O.: Jacobischer Kettenbruchalgorithmus. Math. Ann. 64, 1–76 (1907)

    Article  MATH  MathSciNet  Google Scholar 

  26. Perron, O.: Ueber Matrizen. Math. Ann. 64, 248–263 (1907)

    Article  MATH  MathSciNet  Google Scholar 

  27. Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27 (1948)

  28. Spärck-Jones, K., Walker, S., Robertson, S.E.: A probabilistic model of information retrieval: Development and comparative experiments. Inf. Process. Manag. 36(6), 779–808 (2000)

    Article  Google Scholar 

  29. Wilkinson, J.H.: The Algebraic Eigenvalue Problem. Clarendon, Oxford (1965)

    MATH  Google Scholar 

  30. Zipf, G.K.: Selective Studies and the Principle of Relative Frequency in Language. Harvard University Press, Cambridge (1932)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. WorldLight.com AB, Kastanjeallén 1, 30231, Halmstad, Sweden

    Fredrik K. Andersson

  2. Centre for Mathematical Sciences, Lund University, Box 118, 22100, Lund, Sweden

    Sergei D. Silvestrov

Authors
  1. Fredrik K. Andersson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergei D. Silvestrov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergei D. Silvestrov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andersson, F.K., Silvestrov, S.D. The Mathematics of Internet Search Engines. Acta Appl Math 104, 211–242 (2008). https://doi.org/10.1007/s10440-008-9254-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10440-008-9254-y

Keywords

Search

Navigation