Sökning: WFRF:(Abola Benard 1971 ) >
Traditional and laz...
Traditional and lazy pageranks for a line of nodes connected with complete graphs
-
- 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
-
- Abola, Benard, 1971- (författare)
- Mälardalens högskola,Utbildningsvetenskap och Matematik,Department of Mathematics, School of Physical Sciences, Makerere University, Kampala, Uganda,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. 391-412
- Relaterad länk:
-
https://www.springer...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Matematik -- Sannolikhetsteori och statistik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Probability Theory and Statistics (hsv//eng)
Nyckelord
- Graph
- Lazy PageRank
- PageRank
- Random walk
- Random processes
- Stochastic systems
- Websites
- Complete graphs
- Diverse methods
- Explicit formula
- Line graph
- Numerical values
- Graph theory
- Mathematics/Applied Mathematics
- matematik/tillämpad matematik
Publikations- och innehållstyp
- ref (ämneskategori)
- kap (ämneskategori)
Hitta via bibliotek
Till lärosätets databas