Lecture

Stochastic Simulation: Metropolis-Hastings Algorithm

Related lectures (32)

Explores probability convergence, discussing conditions for random variable sequences to converge and the uniqueness of convergence.

Matrix Operations: Trends and Convergence

Explores matrix operations, trends, and convergence conditions with a focus on clear definitions and examples.

Markov Chain Monte Carlo: Sampling and Convergence

Explores Markov Chain Monte Carlo for sampling high-dimensional distributions and optimizing functions using the Metropolis-Hastings algorithm.

Link-Based Ranking: HITS

Covers the HITS algorithm, computing hubs and authorities, convergence, and sample results.

Sampling Theory: Statistics for Mathematicians

Covers the theory of sampling, focusing on statistics for mathematicians.

Probability & Stochastic Processes

Covers applied probability, stochastic processes, Markov chains, rejection sampling, and Bayesian inference methods.

Convergence of Langevin Monte Carlo: Tail Growth and Smoothness

Explores the convergence of Langevin Monte Carlo algorithms under different growth rates and smoothness conditions, emphasizing fast convergence for a wide class of potentials.

Newton Method: Convergence Analysis

Explores the Newton method for root finding and its convergence analysis, including the modified Newton method.

Uniform Convergence: Series of Functions

Explores uniform convergence of series of functions and its significance in complex analysis.

Sampling Distributions: Theory and Applications

Explores sampling distributions, estimators' properties, and statistical measures for data science applications.

Banach Spaces: Reflexivity and Convergence

Explores Banach spaces, emphasizing reflexivity and sequence convergence in a rigorous mathematical framework.

Diffusion Models

Explores diffusion models, focusing on generating samples from a distribution and the importance of denoising in the process.

Density of States and Bayesian Inference in Computational Mathematics

Explores computing density of states and Bayesian inference using importance sampling, showcasing lower variance and parallelizability of the proposed method.

Uniform Integrability and Convergence

Explores uniform integrability, convergence theorems, and the importance of bounded sequences in understanding the convergence of random variables.

Central Limit Theorem: Proof

Presents the proof of the Central Limit Theorem using Lindeberg's principle.

Theory of MCMC

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

Approximation of Functions: Principles and Theorems

Explores the principles and theorems of function approximation, focusing on Littlewood 3 principles and Egorov's theorem.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Convergence of Random Variables

Explores the convergence of random variables, the law of large numbers, and the distribution of failure time.

Pointwise Convergence of Fourier Series

Explores the pointwise convergence of Fourier series and its applications in optimal transport.