Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Markov Chains: Convergence and Spectral Gap

Related lectures (33)

Markov Chains: Ergodicity and Stationary Distribution

Explores ergodicity and stationary distribution in Markov chains, emphasizing convergence properties and unique distributions.

Markov Chains: PageRank Algorithm

Explores the PageRank algorithm within Markov chains, emphasizing ergodicity and convergence for web page ranking.

Theory of MCMC

Covers the theory of Markov Chain Monte Carlo (MCMC) sampling and discusses convergence conditions, transition matrix choice, and target distribution evolution.

Coupling of Markov Chains: Ergodic Theorem

Explores the coupling of Markov chains and the proof of the ergodic theorem, emphasizing distribution convergence and chain properties.

Ergodic Theorem: Proof and Applications

Explains the proof of the ergodic theorem and the concept of positive-recurrence in Markov chains.

Markov Chains and Algorithm Applications

Covers Markov chains and their applications in algorithms, focusing on Markov Chain Monte Carlo sampling and the Metropolis-Hastings algorithm.

Limiting Distribution and Ergodic Theorem

Explores limiting distribution in Markov chains and the implications of ergodicity and aperiodicity on stationary distributions.

Lower Bound on Total Variation Distance

Explores the lower bound on total variation distance in Markov chains and its implications on mixing time.

Ergodic Theory: Markov Chains

Explores ergodic theory in Markov chains, discussing irreducibility and unique stationary distributions.

Invariant Measures: Properties and Applications

Covers the concept of invariant measures in Markov chains and their role in analyzing irreducible recurrent processes.

Monte Carlo Moves in Simulation

Explores Monte Carlo moves in simulation, including trial moves and biased moves, comparing Monte Carlo with Molecular Dynamics.

Spectral Gap in Markov Chains

Explores the spectral gap in Markov chains and its impact on convergence speed.

Ergodic properties of low complexity symbolic systems

Explores the influence of complexity on ergodic properties of symbolic systems, presenting the Curtis-Hedlund-Lyndon Theorem and constructions of minimal subshifts.

Markov Chains: Homogeneous Processes and Stationary Distributions

Explores Markov chains, focusing on homogeneous processes and stationary distributions, with practical exercises.

Markov Chain Monte Carlo

Explores the Markov Chain Monte Carlo method, covering ergodic chains, stationary distributions, and the Metropolis algorithm.

Markov Chains: Applications and Sampling Methods

Covers the basics of Markov chains and their algorithmic applications.

Markov Chains: Introduction and Properties

Covers the introduction and properties of Markov chains, including transition matrices and stochastic processes.

Hidden Markov Models: Primer

Introduces Hidden Markov Models, explaining the basic problems and algorithms like Forward-Backward, Viterbi, and Baum-Welch, with a focus on Expectation-Maximization.

Eigenvalues and Eigenvectors of Markov Chains

Explores eigenvalues and eigenvectors of Markov chains, focusing on convergence rates and matrix properties.

Markov Chains: Simulation and Optimization

Explores Markov chains, Metropolis-Hastings, and simulation for optimization purposes, highlighting the significance of ergodicity in efficient variable simulation.