Analysis of an on-line algorithm for solving large Markov chains

Nelly Litvak, Philippe H. Robert · 2008

Algorithms for ranking of web pages such as Google Page-Rank assign importance scores according to a stationary distribution of a Markov random walk on the web graph. Although in the classical search scheme the ranking scores are pre-computed off-line, several challenging problems in contemporary we

Read the paper · More papers on PaperTik