Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Hittingtime And Pagerank, Shanthi Kannan
Hittingtime And Pagerank, Shanthi Kannan
Master's Theses
In this thesis, we study convergence of finite state, discrete, and time homogeneous Markov chains to a stationary distribution. Expressing the probability of transitioning between states as a matrix allows us to look at the conditions that make the matrix primitive. Using the Perron-Frobenius theorem we find the stationary distribution of a Markov chain to be the left Perron vector of the probability transition matrix.
We study a special type of Markov chain &mdash random walks on connected graphs. Using the concept of fundamental matrix and the method of spectral decomposition, we derive a formula
that calculates expected hitting times …