Sökning: WFRF:(Abola Benard 1971 ) >
PageRank in evolvin...
PageRank in evolving tree graphs
-
- Abola, Benard, 1971- (författare)
- Mälardalens högskola,Utbildningsvetenskap och Matematik,Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda,MAM
-
- Biganda, Pitos, 1981- (författare)
- Mälardalens högskola,Utbildningsvetenskap och Matematik,Department of Mathematics, College of Natural and Applied Sciences, University of Dar es Salaam,Tanzania,MAM
-
- Engström, Christopher, 1987- (författare)
- Mälardalens högskola,Utbildningsvetenskap och Matematik,MAM
-
visa fler...
-
- Mango, John Magero (författare)
- Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda
-
- Kakuba, Godwin (författare)
- Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda
-
- Silvestrov, Sergei, Professor, 1970- (författare)
- Mälardalens högskola,Utbildningsvetenskap och Matematik,MAM
-
visa färre...
-
(creator_code:org_t)
- 2018-12-05
- 2018
- Engelska.
-
Ingår i: Stochastic Processes and Applications. - Cham : Springer. - 9783030028244 ; , s. 375-390
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
- NATURVETENSKAP -- Matematik -- Sannolikhetsteori och statistik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Probability Theory and Statistics (hsv//eng)
Nyckelord
- Breadth-first search
- Forward edge
- PageRank
- Random walk
- Tree
- Forestry
- Graph theory
- Iterative methods
- Random processes
- Stochastic systems
- Trees (mathematics)
- Mathematics/Applied Mathematics
- matematik/tillämpad matematik
Publikations- och innehållstyp
- ref (ämneskategori)
- kap (ämneskategori)
Hitta via bibliotek
Till lärosätets databas