A Course in Graduate Algorithms

Designed by Bo Waggoner for the University of Colorado, Boulder CSCI 5454: Design and Analysis of Algorithms.



Lecture 11: Random Walks on Graphs




Videos - Original Speed


Section 1: Adjacency Matrices for Counting Paths


Direct download

Section 2: Normalized Adjacency Matrices and Markov Chains


Direct download

Section 3: Convergence to Stationary


Direct download

Section 4: PageRank


Direct download

Section 5: Markov Chain Monte Carlo


Direct download






Videos - 1.4x Speed


Section 1: Adjacency Matrices for Counting Paths (1.4x)


Direct download

Section 2: Normalized Adjacency Matrices and Markov Chains (1.4x)


Direct download

Section 3: Convergence to Stationary (1.4x)


Direct download

Section 4: PageRank (1.4x)


Direct download

Section 5: Markov Chain Monte Carlo (1.4x)


Direct download