Author:
Denysyuk Oksana,Rodrigues Luís
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on Graphs. Unpublished (1995)
2. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science, FOCS 1979, pp. 218–223 (1979)
3. Lecture Notes in Computer Science;C. Avin,2008
4. Bar-Yossef, Z., Friedman, R., Kliot, G.: Rawms - random walk based lightweight membership service for wireless ad hoc networks. ACM Trans. Comput. Syst. 26(2), 1–66 (2008)
5. Brightwell, G., Winkler, P.: Extremal cover times for random walks on trees. Journal of Graph Theory 14(5), 547–554 (1990)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Robustness of Random Walk on a Graph against Adversary Attacks;2024 IEEE 48th Annual Computers, Software, and Applications Conference (COMPSAC);2024-07-02
2. Smoothed Analysis of Information Spreading in Dynamic Networks;Journal of the ACM;2024-06-11
3. Reversible random walks on dynamic graphs;Random Structures & Algorithms;2023-06-21
4. Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11
5. On the Periodicity of Random Walks in Dynamic Networks;IEEE Transactions on Network Science and Engineering;2020-07-01