249 citations
1 paper · 1 filter
Jason Schweinsberg
Let (Gn)n=1∞ be a sequence of finite graphs, and let Y_t be the length of a loop-erased random walk on G_n after t steps. We show that for a large family of sequences…