This Master's thesis in the mathematical sciences studies random walks on nite graphs. The reader is introduced to general Markov chains before we move on more specifically to random walks on graphs. A random walk on a graph is just a Markov chain that is time-reversible. The main parameters we study are the hitting time, commute time and cover time
|
|
Scooped by
Andrew van Zyl
onto Maths resources for teachers May 20, 2014 9:56 AM
|
Your new post is loading...