Advertisement

Traditional and Lazy PageRanks for a Line of Nodes Connected with Complete Graphs

  • Pitos Seleka Biganda
  • Benard Abola
  • Christopher Engström
  • John Magero Mango
  • Godwin Kakuba
  • Sergei Silvestrov
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 271)

Abstract

PageRank was initially defined by S. Brin and L. Page for the purpose of measuring the importance of web pages (nodes) based on the structure of links between them. Due to existence of diverse methods of random walk on the graph, variants of PageRank now exists. They include traditional (or normal) PageRank due to normal random walk and Lazy PageRank due to lazy random walk on a graph. In this article, we establish how the two variants of PageRank changes when complete graphs are connected to a line of nodes whose links between the nodes are in one direction. Explicit formulae for the two variants of PageRank are presented. We have noted that the ranks on a line graph are the same except their numerical values which differ. Further, we have observed that both normal random walk and lazy random walk on complete graphs spend almost the same time at each node.

Keywords

Graph Random walk PageRank Lazy PageRank 

Notes

Acknowledgements

This research was supported by the Swedish International Development Cooperation Agency (Sida), International Science Programme (ISP) in Mathematical Sciences (IPMS), Sida Bilateral Research Program (Makerere University and University of Dar-es-Salaam). We are also grateful to the research environment Mathematics and Applied Mathematics (MAM), Division of Applied Mathematics, Mälardålen University for providing an excellent and inspiring environment for research education and research. The authors are grateful to Dmitrii Silvestrov for useful comments and discussions.

References

  1. 1.
    Anderson, F., Silvestrov, S.: The mathematics of internet search engines. Acta Appl. Math. 104, 211–242 (2008)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Battiston, S., Puliga, M., Kaushik, R., Tasca, P., Calderelli, G.: DeptRank: Too central to fail? Financial networks, the fed and systemic risk. Technical Report (2012)Google Scholar
  3. 3.
    Bernstein, D.: Matrix Mathematics. Princeton Unversity Press, NY (2005)Google Scholar
  4. 4.
    Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. Society for industrial and applied mathematics (1994)Google Scholar
  5. 5.
    Biganda, P.S., Abola, B., Engström, C., Silvestrov, S.: PageRank, connecting a line of nodes with multiple complete graphs. In: Proceedings of the 17th Conference of the ASMDA International Society Applied Stochastic Models and Data Analysis (ASMDA 2017), pp. 125–138 (2017)Google Scholar
  6. 6.
    Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30((1–7)), 107–117 (1998). Proceedings of the Seventh International World Wide Web ConferenceGoogle Scholar
  7. 7.
    Chung, F., Zhao, W.: PageRank and random walks on graphs (2008). http://www.math.ucsd.edu/~fan/wp/lov.pdf
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Engström, C., Silvestrov, S.: PageRank, a look at small changes in a line of nodes and the complete graph. In: Silvestrov S., Rančić M. (eds) Engineering Mathematics II. Springer Proceedings in Mathematics and Statistics, vol 179. Springer, Cham, 223-247 (2016)zbMATHGoogle Scholar
  10. 10.
    Engström, C., Silvestrov, S.: PageRank, connecting a line of nodes with a complete graph. In: Silvestrov, S., Rančić, M. (eds.) Engineering Mathematics II. Springer proceedings in mathematics and statistics, vol. 179, pp. 249–274. Springer, Cham (2016)Google Scholar
  11. 11.
    Engström, C., Silvestrov, S.: A componentwise PageRank algorithm. In: Bozeman, J.R., Oliveira, T., Skiadas, C.H. (eds.) Stochastic and Data Analysis Methods and Applications in Statistics and Demography, pp. 375–388 (2016). ASMDA 2015 Proceedings: 16th Applied Stochastic Models and Data Analysis International Conference with 4th Demographics 2015 Workshop.,ISAST: International Society for the Advancement of Science and TechnologyGoogle Scholar
  12. 12.
    Haveliwala, T., Kamvar, S.: The second eigenvalue of the google matrix. Technical Report 2003–20, Stanford InfoLab (2003)Google Scholar
  13. 13.
    Ishii, H., Tempo, R., Bai, E.W., Dabbene, F.: Distributed randomized pagerank computation based on web aggregation. In: Decision and Control, 2009 held jointly with the 2009 28th Chinese Control Conference. CDC/CCC, pp. 3026–3031 (2009)Google Scholar
  14. 14.
    Kamvar, S.D., Haveliwala, T.: The Condition Number of the PageRank Problem. Technical Report, Stanford InfoLab (2003)Google Scholar
  15. 15.
    Kamvar, S., Haveliwala, T., Golub, G.: Adaptive methods for the computation of pagerank. Linear Algebra Appl. 386, 51–65 (2004)MathSciNetCrossRefGoogle Scholar
  16. 16.
    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 (2003)Google Scholar
  17. 17.
    Klopotek, M.A., Wierzchon, S.T., Ciesielski, K., Czerski, D., Draminski, M.: Lazy walks versus walks with backstep: flavor of PageRank. In: Proceedings of the 2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)-Vol. 01, pp. 262–265 (2014)Google Scholar
  18. 18.
    Norris, J.R.: Markov Chains. Cambridge University Press, New York (2009)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Pitos Seleka Biganda
    • 1
    • 2
  • Benard Abola
    • 1
    • 3
  • Christopher Engström
    • 1
  • John Magero Mango
    • 3
  • Godwin Kakuba
    • 3
  • Sergei Silvestrov
    • 1
  1. 1.Division of Applied Mathematics, School of Education, Culture and CommunicationMälardalen UniversityVästeråsSweden
  2. 2.Department of Mathematics, College of Natural and Applied SciencesUniversity of Dar es SalaamDar es SalaamTanzania
  3. 3.Department of Mathematics, School of Physical SciencesMakerere UniversityKampalaUganda

Personalised recommendations