id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ns064457m4p	Andrea Asztalos	Applications of Random Walks: From Network Exploration to Cellulose Hydrolysis	2010		.txt	text/plain	236	9	40	We show that for STP walks site and edge exploration obey the same scaling ~n to the power of nu as function of time n, and therefore edge exploration on graphs with many loops is always lagging compared to site exploration. In the first part of the thesis we investigate network exploration by random walks defined via stationary and adaptive transition probabilities on large, but finite graphs.	cache/ns064457m4p.txt	txt/ns064457m4p.txt