Real networks are frequently dynamic. Nevertheless, knowledge about analyzing algorithms and stochastic processes on dynamic networks is limited, compared to the wealth of knowledge on static networks. Therefore, dynamic network theoretical analyses have attracted much attention in network science and engineering. This article reviews random walks on dynamic network analysis, focusing on cover time. We also introduce the “collecting coupons with an increasing number of types,” from our recent work on random walks on dynamic graph analysis with an increasing number of vertices.
