The probability of the walker to be at a particular vertex is given by the Markov chain on the graph.
recently, Ferre-i-Cancho (Ferrer-i-Cancho and Sole, 2001) and Sigman (Sigman and Cecchi, 2002) who work on graph theory highlighted the "hierarchical small world" (HSW) structure used in language studies.