Now showing items 1-2 of 2
Random walks on graphs
(Stellenbosch : Stellenbosch University, 2014-04)
ENGLISH ABSTRACT: We study 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 ...
Random walk hitting times in random trees
(Stellenbosch : Stellenbosch University, 2017-12)
ENGLISH ABSTRACT : The hitting time Hxy, between two vertices x and y of a graph, is the average time that the standard simple random walk takes to get from x to y. We start by giving a recursive formula for higher moments ...