1 paper
Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue +1
In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undir…