How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices?
Published Online:4 Apr 2025https://doi.org/10.1287/moor.2023.0060
Volume 51, Issue 1
February 2026
Pages iv-viii, 1-851
Article Information
Metrics
Information
- Received:March 03, 2023
- Accepted:January 25, 2025
- Published Online:April 04, 2025
Copyright © 2025 The Author(s)
Cite as
Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga (2025) How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices?. Mathematics of Operations Research 51(1):783-805.
https://doi.org/10.1287/moor.2023.0060
Keywords
A preliminary version appeared in Proceedings of the 32nd Symposium on Discrete Algorithms (SODA21) [Kijima S, Shimizu N, Shiraga T (2021) How many vertices does a random walk miss in a network with moderately increasing the number of vertices? Proc. 32nd Annual ACM-SIAM Sympos. Discrete Algorithms (SODA) (SIAM, Philadelphia), 106–122].
