Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph.

@inproceedings{zhang-2020-nearly, author = {Zuobai Zhang and Wanyue Xu and Zhongzhi Zhang}, editor = {James Caverlee and Xia Ben Hu and Mounia Lalmas-Roelleke and Wei Wang}, title = {{Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph}}, booktitle = {{WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, Houston, TX, USA, February 3-7, 2020}}, pages = {726--734}, publisher = {ACM}, year = {2020}, url = {https://doi.org/10.1145/3336191.3371777}, doi = {https://doi.org/10.1145/3336191.3371777} }