Deterministic approximation of random walks via queries in graphs of unbounded size.
Publication information:
Pyne, Edward, and Salil Vadhan. “Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size”. Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA ’22).
Abstract
Version History: Preliminary version posted as arXiv:2111.01997 [cs.CC].
Abstract: Forthcoming.