MATH 7685 - Simulation & Computing

(3) Uniform random number generation and testing, generation methods for non-uniform random variables, simulating random numbers from specific distributions, Metropolis-Hastings algorithm, Markov Chain Monet-Carlo (MCMC), Gibbs sampling. PREREQUISITE(S): Two semesters (or equivalent) of undergraduate improvisation, and permission of instructor.