2 citations · 2 across the 1 of their papers we have counts for
1 paper
Pierre Andreoletti, Alexis Kagan
In this work, we are interested in the set of visited vertices of a tree T by a randomly biased random walk X:=(Xn,n∈N). The aim is to study a g…