Design and Application of Fast Random Walks Using Graph Topological Structures

点击翻译按钮获取中文摘要

A random walk on a finite graph is the model of repeatedly moving a particle on a vertex to one of its adjacent vertices. In this study, we obtain the following results: (1) we obtain inequalities about the relationship between hitting time and cover time of multiplex random walks, (2) for coalescing random walks, we obtain upper bounds on the expected coalescing time.