1 paper
Andrea Ottolini
Given a large connected graph G=(V,E), and two vertices w,=v, let Tw,v be the first hitting time to v starting from w for the simple random walk on G. We prove a…