mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
PageRank in evolving tree graphs
Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda. (MAM)
Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. Department of Mathematics, College of Natural and Applied Sciences, University of Dar es Salaam,Tanzania. (MAM)
Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics. (MAM)ORCID iD: 0000-0002-1624-5147
Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda.
Show others and affiliations
2018 (English)In: Stochastic Processes and Applications: SPAS2017, Västerås and Stockholm, Sweden, October 4-6, 2017 / [ed] Sergei Silvestrov, Anatoliy Malyarenko, Milica Rančić, Springer, 2018, Vol. 271, p. 375-390Chapter in book (Refereed)
Abstract [en]

In this article, we study how PageRank can be updated in an evolving tree graph. We are interested in finding how ranks of the graph can be updated simultaneously and effectively using previous ranks without resorting to iterative methods such as the Jacobi or Power method. We demonstrate and discuss how PageRank can be updated when a leaf is added to a tree, at least one leaf is added to a vertex with at least one outgoing edge, an edge added to vertices at the same level and forward edge is added in a tree graph. The results of this paper provide new insights and applications of standard partitioning of vertices of the graph into levels using breadth-first search algorithm. Then, one determines PageRanks as the expected numbers of random walk starting from any vertex in the graph. We noted that time complexity of the proposed method is linear, which is quite good. Also, it is important to point out that the types of vertex play essential role in updating of PageRank.

Place, publisher, year, edition, pages
Springer, 2018. Vol. 271, p. 375-390
Series
Springer Proceedings in Mathematics and Statistics, ISSN 2194-1009 ; 271
Keywords [en]
Breadth-first search, Forward edge, PageRank, Random walk, Tree, Forestry, Graph theory, Iterative methods, Random processes, Stochastic systems, Trees (mathematics)
National Category
Computational Mathematics Probability Theory and Statistics
Research subject
Mathematics/Applied Mathematics
Identifiers
URN: urn:nbn:se:mdh:diva-41833DOI: 10.1007/978-3-030-02825-1_16Scopus ID: 2-s2.0-85058567338ISBN: 978-3-030-02824-4 (print)OAI: oai:DiVA.org:mdh-41833DiVA, id: diva2:1274027
Conference
International Conference on “Stochastic Processes and Algebraic Structures – From Theory Towards Applications”, SPAS 2017; Västerås and Stockholm; Sweden; 4 October 2017 through 6 October 2017; Code 221789
Available from: 2018-12-27 Created: 2018-12-27 Last updated: 2018-12-31Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Abola, BenardBiganda, PitosEngström, ChristopherSilvestrov, Sergei

Search in DiVA

By author/editor
Abola, BenardBiganda, PitosEngström, ChristopherSilvestrov, Sergei
By organisation
Educational Sciences and Mathematics
Computational MathematicsProbability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 244 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf