Tyck till om SwePub Sök
här!
Sökning: hsv:(NATURVETENSKAP) hsv:(Matematik) hsv:(Beräkningsmatematik) >
PageRank and pertur...
PageRank and perturbed Markov chains
-
- 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, Gudwin (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)
- ISAST: International Society for the Advancement of Science and Technology, 2019
- 2019
- Engelska.
-
Ingår i: Proceedings of 18th Applied Stochastic Models and Data Analysis International Conference with the Demographics 2019 Workshop, Florence, Italy: 11-14 June, 2019. - : ISAST: International Society for the Advancement of Science and Technology. - 9786185180331 ; , s. 233-247
- Relaterad länk:
-
http://www.asmda.es/
-
visa fler...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- PageRank is a widely-used hyperlink-based algorithm to estimate the relative importance of nodes in networks [11]. Since many real world networks are large sparse networks, this makes efficient calculation of PageRank complicated. Moreover, one needs to escape from dangling effects in some cases as well as slow convergence of the transition matrix. Primitivity adjustment with a damping (perturbation) parameter ε(0,ε0] (for fixed ε0 0.15) is one of the essential procedure that is known to ensure convergence of the transition matrix [24]. If ε is large, the transition matrix looses information due to shift of information to teleportation matrix [27]. In this paper, we formulate PageRank problem as the first and second order Markov chains perturbation problem. Using numerical experiments, we compare convergence rates for the two problems for different values of ε on different graph structures and investigate the difference in ranks for the two problems.
Ämnesord
- NATURVETENSKAP -- Matematik -- Sannolikhetsteori och statistik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Probability Theory and Statistics (hsv//eng)
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
Nyckelord
- PageRank
- Markov chains
- Perturbation problem
- Mathematics/Applied Mathematics
- matematik/tillämpad matematik
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas