Motivated by the desire to model internet traffic we consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. We present and test two techniques to analyse these walks. On Erdős–Rényi random graphs where the probability of a walk...