70 likes | 213 Vues
This presentation by David Gleich from Purdue University delves into the fundamentals of Markov chains, covering topics such as transient and recurrent states, ergodicity, the Perron-Frobenius theorem, and stationary distributions. Key applications like PageRank and centrality measures in spectral graph theory are discussed, alongside the importance of stochastic processes and random walks. The outline includes discussions on hitting and commute times, transition-related problems, and significant theoretical insights that underpin the analysis of Markov processes.
E N D
Overview of Markov chains David Gleich Purdue University Network & Matrix Computations Computer Science 15 Sept 2011
Lots of words transient recurrent primitive regular ergodic periodic irreducible Perron root Perron vector stationary distribution first transition analysis Cesáro limit reversible Markov chain simple stationary distribution Perron-Frobenius theorem
Some theory • Theorem Let A ≥ 0 be irreducible then A has a unique positive eigenvector with eigenvalue equal to the spectral radius of A.
In German Oskar Perron, MathematischeAnnalen, 64:248-263, 1907 doi: 10.1007/BF01449896
Important application • PageRank • centrality measures • spectral graph theory • random sampling
Probable outline • Stochastic processes, Markov chains, and random walks, and stochastic matrices • The Perron-Frobenius theorem and stationary distribution • Hitting times, commute times, and other transition related problems