Skip to main content
Top

2016 | OriginalPaper | Chapter

PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph

Authors : Christopher Engström, Sergei Silvestrov

Published in: Engineering Mathematics II

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this article we will look at the PageRank algorithm used as part of the ranking process of different Internet pages in search engines by for example Google. This article has its main focus in the understanding of the behavior of PageRank as the system dynamically changes either by contracting or expanding such as when adding or subtracting nodes or links or groups of nodes or links. In particular we will take a look at link structures consisting of a line of nodes or a complete graph where every node links to all others. We will look at PageRank as the solution of a linear system of equations and do our examination in both the ordinary normalized version of PageRank as well as the non-normalized version found by solving corresponding linear system. We will show that using two different methods we can find explicit formulas for the PageRank of some simple link structures.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Andersson, F.: Estimation of the quality of hyperlinked documents using a series formulation of pagerank. Master’s thesis, Mathematics, Centre for Mathematical sciences, Lund Institute of Technology, Lund University (2006:E22). LUTFMA-3132-2006 Andersson, F.: Estimation of the quality of hyperlinked documents using a series formulation of pagerank. Master’s thesis, Mathematics, Centre for Mathematical sciences, Lund Institute of Technology, Lund University (2006:E22). LUTFMA-3132-2006
3.
go back to reference Berman, A., Plemmons, R.: Nonnegative Matrices in the Mathematical Sciences. No. Del 11 in Classics in Applied Mathematics. Society for Industrial and Applied Mathematics. Academic Press, New York (1994) Berman, A., Plemmons, R.: Nonnegative Matrices in the Mathematical Sciences. No. Del 11 in Classics in Applied Mathematics. Society for Industrial and Applied Mathematics. Academic Press, New York (1994)
4.
go back to reference Bernstein, D.: Matrix Mathematics. Princeton University Press, Princeton (2005) Bernstein, D.: Matrix Mathematics. Princeton University Press, Princeton (2005)
5.
go back to reference Bianchini, M., Gori, M., Scarselli, F.: Inside pagerank. ACM Trans. Int. Technol. 5(1), 92–128 (2005)CrossRef Bianchini, M., Gori, M., Scarselli, F.: Inside pagerank. ACM Trans. Int. Technol. 5(1), 92–128 (2005)CrossRef
6.
go back to reference Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1–7), 107–117 (1998) (Proceedings of the Seventh International World Wide Web Conference) Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1–7), 107–117 (1998) (Proceedings of the Seventh International World Wide Web Conference)
7.
go back to reference Bryan, K., Leise, T.: The $ 25,000,000,000 eigenvector: the linear algebra behind google. SIAM Rev. 48(3), 569–581 (2006) Bryan, K., Leise, T.: The $ 25,000,000,000 eigenvector: the linear algebra behind google. SIAM Rev. 48(3), 569–581 (2006)
8.
go back to reference Dhyani, D., Bhowmick, S.S., Ng, W.K.: Deriving and verifying statistical distribution of a hyperlink-based web page quality metric. Data Knowl. Eng. 46(3), 291–315 (2003)CrossRefMATH Dhyani, D., Bhowmick, S.S., Ng, W.K.: Deriving and verifying statistical distribution of a hyperlink-based web page quality metric. Data Knowl. Eng. 46(3), 291–315 (2003)CrossRefMATH
9.
go back to reference Engström, C., Silvestrov, S.: Non-normalized pagerank and random walks on n-partite graphs. In: Proceedings of 3rd Stochastic Modeling Techniques and Data Analysis, pp. 192–202 (2015) Engström, C., Silvestrov, S.: Non-normalized pagerank and random walks on n-partite graphs. In: Proceedings of 3rd Stochastic Modeling Techniques and Data Analysis, pp. 192–202 (2015)
10.
go back to reference Gantmacher, F.: The Theory of Matrices. Chelsea, New York (1959)MATH Gantmacher, F.: The Theory of Matrices. Chelsea, New York (1959)MATH
11.
go back to reference Haveliwala, T., Kamvar, S.: The second eigenvalue of the google matrix. Technical Report 2003–20, Stanford InfoLab (2003) Haveliwala, T., Kamvar, S.: The second eigenvalue of the google matrix. Technical Report 2003–20, Stanford InfoLab (2003)
12.
go back to reference Ishii, H., Tempo, R., Bai, E.W., Dabbene, F.: Distributed randomized pagerank computation based on web aggregation. In: Proceedings of the 48th IEEE Conference on Decision and Control, 2009 Held Jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009, pp. 3026–3031 (2009) Ishii, H., Tempo, R., Bai, E.W., Dabbene, F.: Distributed randomized pagerank computation based on web aggregation. In: Proceedings of the 48th IEEE Conference on Decision and Control, 2009 Held Jointly with the 2009 28th Chinese Control Conference. CDC/CCC 2009, pp. 3026–3031 (2009)
13.
go back to reference Kamvar, S., Haveliwala, T.: The condition number of the pagerank problem. Technical Report 2003–36, Stanford InfoLab (2003) Kamvar, S., Haveliwala, T.: The condition number of the pagerank problem. Technical Report 2003–36, Stanford InfoLab (2003)
14.
go back to reference Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in P2P networks. In: Proceedings of the 12th International Conference on World Wide Web. WWW ’03, pp. 640–651. ACM, New York (2003) Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in P2P networks. In: Proceedings of the 12th International Conference on World Wide Web. WWW ’03, pp. 640–651. ACM, New York (2003)
15.
go back to reference Lancaster, P.: Theory of Matrices. Academic Press, New York (1969) Lancaster, P.: Theory of Matrices. Academic Press, New York (1969)
16.
go back to reference Norris, J.R.: Markov Chains. Cambridge University Press, New York (2009)MATH Norris, J.R.: Markov Chains. Cambridge University Press, New York (2009)MATH
17.
go back to reference Rydén, T., Lindgren, G.: Markovprocesser. Lund University, Lund (2000) Rydén, T., Lindgren, G.: Markovprocesser. Lund University, Lund (2000)
18.
go back to reference Sepandar, K., Taher, H., Gene, G.: Adaptive methods for the computation of pagerank. Linear Algebra Appl. 386(0), 51–65 (2004) (Special Issue on the Conference on the Numerical Solution of Markov Chains 2003) Sepandar, K., Taher, H., Gene, G.: Adaptive methods for the computation of pagerank. Linear Algebra Appl. 386(0), 51–65 (2004) (Special Issue on the Conference on the Numerical Solution of Markov Chains 2003)
Metadata
Title
PageRank, a Look at Small Changes in a Line of Nodes and the Complete Graph
Authors
Christopher Engström
Sergei Silvestrov
Copyright Year
2016
DOI
https://doi.org/10.1007/978-3-319-42105-6_11

Premium Partner