On the convergence of the minimally irreducible Markov chain method with applications to PageRank (Q2363682)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6752034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the convergence of the minimally irreducible Markov chain method with applications to PageRank |
scientific article; zbMATH DE number 6752034 |
Statements
On the convergence of the minimally irreducible Markov chain method with applications to PageRank (English)
0 references
25 July 2017
0 references
complex network analysis
0 references
pagerank
0 references
Markov chain
0 references
minimal irreducibility
0 references
maximal irreducibility
0 references
damping factor
0 references
asymptotic convergence
0 references
numerical experiments
0 references
0 references
0 references
0.8002878427505493
0 references
0.798942506313324
0 references
0.7953677177429199
0 references
0.7927457094192505
0 references
0.7763736844062805
0 references
