Random Walks on Graphs
Year: 2014
Type: dissertation
Abstract: We study random walks on finite 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.We find novel formulas for the cover time of the subdivided star graph and broom graph before looking at the trees with extremal cover times.Lastly we look at a connection between random walks on graphs and electrical networks, where the hitting time between two vertices of a graph is expressed in terms of a weighted sum of effective resistances.This expression in turn proves useful when we study the cover cost, a parameter related to the cover time.ii
Author: Joubert Oosthuizen
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: National Research Foundation
OpenAlex ID: W338804902
