The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank (Q736033)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank |
scientific article; zbMATH DE number 5621475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank |
scientific article; zbMATH DE number 5621475 |
Statements
The randomized algorithm for finding an eigenvector of the stochastic matrix with application to PageRank (English)
0 references
26 October 2009
0 references
eigenvector
0 references
largest eigenvalue
0 references
stochastic matrix
0 references
randomized algorithm
0 references
convergence
0 references
mirror-descent method
0 references
convex stochastic optimization
0 references
PageRank problem
0 references
0 references
0.9642398357391356
0 references
0.9158123135566713
0 references
0.8805418610572815
0 references
0.7703452706336975
0 references
0.7696734666824341
0 references
