Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph-Reference-Cited by-同舟云学术

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

Published:2020-01-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 13th International Conference on Web Search and Data Mining
language:
Short-container-title:

Author:

Zhang Zuobai¹,Xu Wanyue¹,Zhang Zhongzhi¹

Affiliation:

1. Fudan University, Shanghai, China

Funder

the National Natural Science Foundation of China

the National Key R & D Program of China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3336191.3371777

Reference41 articles.

1. Database-friendly random projections

2. The architecture of complex weighted networks

3. Adi Ben-Israel and Thomas N. E Greville. 1974. Generalized inverses: theory and applications .J. Wiley. 406--413 pages. Adi Ben-Israel and Thomas N. E Greville. 1974. Generalized inverses: theory and applications .J. Wiley. 406--413 pages.

4. Centers for Random Walks on Trees

5. A Hitting Time Formula for the Discrete Green's Function

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Computation of Kemeny's Constant for Directed Graphs;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Efficient Approximation of Kemeny's Constant for Large Graphs;Proceedings of the ACM on Management of Data;2024-05-29

3. Modeling spatial networks by contact graphs of disk packings;Theoretical Computer Science;2023-09

4. Hitting Times of Random Walks on Edge Corona Product Graphs;The Computer Journal;2023-01-09

5. Measures and Optimization for Robustness and Vulnerability in Disconnected Networks;IEEE Transactions on Information Forensics and Security;2023