21 citations · 114 across the 18 of their papers we have counts for
1 paper · 1 filter
David Lancaster
We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs…