Exact computation for meeting times and infection times of random walks on graphs

摘要

We consider independent multiple random walks on graphs and study comparison results of meeting times and infection times between many conditions of the random walks by obtaining the exact density functions or expectations.