Journal Articles (Peer-Reviewed)
How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices?
Shuji Kijima, Nobutaka Shimizu, and Takeharu Shiraga
MATHEMATICS OF OPERATIONS RESEARCH, 2025
DOI: 10.1287/moor.2023.0060 | arXiv (2021) | Slide
Preliminary version appeared in SODA2021
Random Walks
Quasi-majority Functional Voting on Expander Graphs
Nobutaka Shimizu and Takeharu Shiraga
Random Structures & Algorithms, 65(4), pp.613-643, 2024
DOI: 10.1002/rsa.21224 | arXiv (2022) | Slide
Preliminary version appeared in ICALP2020
Graph Theory Consensus Dynamics Stochastic Processes
Reversible Random Walks on Dynamic Graphs
Nobutaka Shimizu and Takeharu Shiraga
Random Structures & Algorithms, 63(4), pp.1100-1136, 2023
DOI: 10.1002/rsa.21164 | arXiv (2022)
Graph Theory Random Walks
Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models
Nobutaka Shimizu and Takeharu Shiraga
Random Structures & Algorithms, 59(1), pp.96-140, 2021
DOI: 10.1002/rsa.20992 | Slide
Preliminary version appeared in DISC2019
Graph Theory Consensus Dynamics Stochastic Processes
The average distance and the diameter of dense random regular graphs
Nobutaka Shimizu
The Electronic Journal of Combinatorics, 27(3), 2020
DOI: 10.37236/9809
Preliminary version appeared in SODA2018
Graph Theory Random Graphs