Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More

Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More

In this paper, we provide faster algorithms for computing variousfundamental quantities associated with random walks on a directedgraph, including the stationary distribution, personalized PageRankvectors, hitting times, and escape probabilities. In particular, ona directed graph with n vertices and...

Full description

Bibliographic Details
Main Authors: Peng, Richard (Author), Sidford, Aaron (Author), Cohen, Michael B. (Contributor), Kelner, Jonathan Adam (Contributor), Peebles, John Lee Thompson (Contributor), Vladu, Adrian Valentin (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers (IEEE), 2018-05-30T17:02:51Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items