Lecture
Geometric Ergodicity: Convergence Diagnostics
In course
DEMO: dolor ut
Velit do adipisicing elit incididunt nisi magna aute exercitation consectetur labore Lorem aliquip quis. Pariatur sunt officia dolore eu consectetur ex Lorem. Deserunt excepteur ea adipisicing ea anim mollit enim duis veniam incididunt aliquip tempor dolor veniam. Eu dolore consequat ad duis Lorem irure nulla aliqua. Est ea duis non aute elit Lorem. Nostrud magna tempor culpa et irure. Sit ipsum sint tempor adipisicing in excepteur aliqua aute nisi.
Description
This lecture covers the concept of geometric ergodicity in the context of convergence diagnostics for Markov chains. The instructor explains the importance of density functions and the process of evaluating them. Various properties of the chain are discussed, such as bias and relaxation time estimation.
Instructor
culpa do consectetur anim
Occaecat officia ullamco est sint magna. Consectetur nulla fugiat nisi incididunt nostrud ad nisi enim id adipisicing enim ea velit Lorem. Ullamco cillum enim cillum culpa occaecat deserunt qui minim dolor et dolore. Est et eiusmod officia officia ipsum aliqua sunt. Do nostrud ad ipsum consectetur ex id. Aute labore in esse in nulla qui.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related lectures (61)
Estimating Relaxation Time: Variance and Chains
Covers the estimation of relaxation time in chains and the importance of sample sizes.
Markov Chains: Theory and Applications
Covers the theory and applications of Markov chains, focusing on key concepts and properties.
Stochastic Simulation: Markov Chains and Metropolis Hastings
Introduces Markov chains and Metropolis Hastings algorithm in stochastic simulation.
Markov Chains: Reversibility & Convergence
Covers Markov chains, focusing on reversibility, convergence, ergodicity, and applications.
Markov Chain Monte Carlo
Covers the Markov Chain Monte Carlo method and the Metropolis-Hastings algorithm for generating samples from a target probability distribution.