High-precision Estimation of Random Walks in Small Space
© 2020 IEEE. In this paper, we provide a deterministic tilde{O}(log N)-space algorithm for estimating random walk probabilities on undirected graphs, and more generally Eulerian directed graphs, to within inverse polynomial additive error (epsilon=1 text{poly}(N)) where N is the length of the input....
Main Authors: | , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
IEEE
2021
|
Online Access: | https://hdl.handle.net/1721.1/137303 |