Skip to main content
SpringerLink
Log in

Generalisation of the Damping Factor in PageRank for Weighted Networks

  • Chapter
  • First Online:
Modern Problems in Insurance Mathematics

Part of the book series: EAA Series ((EAAS))

Abstract

In this article we will look at the PageRank algorithm used to rank nodes in a network. While the method was originally used by Brin and Page to rank home pages in order of “importance”, since then many similar methods have been used for other networks such as financial or P2P networks. We will work with a non-normalised version of the usual PageRank definition which we will then generalise to enable better options, such as adapting the method or allowing more types of data. We will show what kind of effects the new options creates using examples as well as giving some thoughts on what it can be used for. We will also take a brief look at how adding new connections between otherwise unconnected networks can change the ranking.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Andersson, F., Silvestrov, S.: The mathematics of internet search engines. Acta Appl. Math. 104, 211–242 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  2. Battiston, S., Puliga, M., Kaushik, R., Tasca, P., Calderelli, G., DebtRank.: Too Central to Fail? Financial Networks, the FED and Systemic Risk. Macmillan, London (2012)

    Google Scholar 

  3. Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. Society for Industrial Applied Mathematics, Philadelphia (1994)

    Google Scholar 

  4. Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. Internet Technol. 5(1), 92–128 (2005)

    Google Scholar 

  5. Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1–7), 107–117 (1998)

    Article  Google Scholar 

  6. Bryan, K., Leise, T.: The \(\$25,000,000,000\) eigenvector: the linear algebra behind Google. SIAM Rev. 48(3), 569–581 (2006)

    Google Scholar 

  7. Engström, C.: PageRank as a solution to a linear system, PageRank in changing systems and non-normalized versions of PageRank, Masters Thesis, Lund University, (2011) (LUTFMA-3220-2011)

    Google Scholar 

  8. Gantmacher, F.R.: The Theory of Matrices. Gantmacher, Chelsea (1959)

    MATH  Google Scholar 

  9. Haveliwala, T., Kamvar, S.: The second eigenvalue of the Google matrix. Technical Report 2003-36, Stanford InfoLab, Stanford University (2003)

    Google Scholar 

  10. 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 Held Jointly with the 2009 28th Chinese Control Conference (CDC/CCC 2009), pp. 3026–3031 (2009)

    Google Scholar 

  11. James, R.N.: Markov Chains. Cambridge University Press, Cambridge (2009)

    Google Scholar 

  12. Kamvar, S., Haveliwala, T.: The condition number of the PageRank problem. Technical Report 2003-20, Stanford InfoLab (2003)

    Google Scholar 

  13. Kamvar, S., Haveliwala, T., Golub, G.: Adaptive methods for the computation of PageRank. Linear Algebra Appl. 386, 51–65 (2004)

    Google Scholar 

  14. 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, ACM, pp. 640–651. Budapest (2003)

    Google Scholar 

  15. Lancaster, P.: Theory of Matrices. Academic Press, New York (1969)

    Google Scholar 

  16. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Technical Report 1999–66, Stanford InfoLab (1999)

    Google Scholar 

  17. Rydén, T., Lindgren, G.: Markov Processer (in Swedish). Lund University, Lund (2000)

    Google Scholar 

Download references

Acknowledgments

This research was supported in part by the Swedish Research Council (621- 2007-6338), the Swedish Foundation for International Cooperation in Research and Higher Education (STINT), the Royal Swedish Academy of Sciences, the Royal Physiographic Society in Lund and the Crafoord Foundation.

Author information

Authors and Affiliations

  1. Mälardalen University, Västerås, Sweden

    Christopher Engström & Sergei Silvestrov

Authors
  1. Christopher Engström
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergei Silvestrov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christopher Engström .

Editor information

Editors and Affiliations

  1. Department of Mathematics Professor of Mathematical Statistics, Stockholm University, Stockholm, Sweden

    Dmitrii Silvestrov

  2. Department of Mathematics Professor in Mathematical Statistics, Stockholm University, Stockholm, Sweden

    Anders Martin-Löf

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Engström, C., Silvestrov, S. (2014). Generalisation of the Damping Factor in PageRank for Weighted Networks. In: Silvestrov, D., Martin-Löf, A. (eds) Modern Problems in Insurance Mathematics. EAA Series. Springer, Cham. https://doi.org/10.1007/978-3-319-06653-0_19

Download citation

Publish with us

Policies and ethics

Search

Navigation