The PAGERANK Algorithm (Link Analysis Link Analysis)

From Algorithm Wiki
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m n )$ == Space Complexity == $O(n)$ words (Stores and updates an O(n)-sized vector designed to converge to some sort of stationary distribution) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(m n )$

Space Complexity

$O(n)$ words

(Stores and updates an O(n)-sized vector designed to converge to some sort of stationary distribution)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1998

Reference

http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=The_PAGERANK_Algorithm_(Link_Analysis_Link_Analysis)&oldid=44969"