University | Singapore University of Social Science (SUSS) |
Subject | ST2195 Programming For Data Science Report |
ST2195 Programming For Data Science Report: The Markov Chain Monte Carlo algorithm, in particular the Metropolis-Hastings algorithm
Part 1 In this part, you are asked to work with the Markov Chain Monte Carlo algorithm, in particular the Metropolis-Hastings algorithm. The aim is to simulate random numbers for the distribution with the probability density function given below
where x takes values in the real line and |x| denotes the absolute value of x. More specifically, you are asked to generate x0, x1, . . . , xN values and store them using the following version of the Metropolis-Hastings algorithm (also known as random walk Metropolis) that consists of the steps below:
Stuck with a lot of homework assignments and feeling stressed ? Take professional academic assistance & Get 100% Plagiarism free papers
Random walk Metropolis
Step 1 Set up an initial value x0 as well as a positive integer N and a positive real number s.
Step 2 Repeat the following procedure for i = 1, . . . , N :
• Simulate a random number x∗ from the Normal distribution with mean xi−1 and standard deviation s.
• Compute the ratio
![ST2195 Coursework Project](https://www.myassignmenthelp.sg/wp-content/uploads/2024/02/Capture-12.png)
• Generate a random number u from the uniform distribution between 0 and 1.
• If u < r (x∗, xi−1), set xi = x∗, else set xi = xi−1.
(a) Apply the random walk Metropolis algorithm using N = 10000 and s = 1. Use the generated samples (x1, . . . xN ) to construct a histogram and a kernel density plot in the same figure. Note that these provide estimates of f (x). Overlay a graph of f (x) on this figure to visualize the quality of these estimates. Also, report the sample mean and standard deviation of the generated samples (Note: these are also known as the Monte Carlo estimates of the mean and standard deviation respectively).
Practical tip: To avoid numerical errors, it is better to use the equivalent criterion log u < log r (x∗, xi−1) = log f (x∗) − log f (xi−1) instead of u < r (x∗, xi−1).
Buy Custom Answer of This Assessment & Raise Your Grades
Are you a Singapore University of Social Science (SUSS) student grappling with the ST2195 Coursework Project? Ease your academic journey with our expert Assignment Helper and specialized Case Study Writing Help. Pay for assistance and conquer the complexities of the Markov Chain Monte Carlo algorithm effortlessly.
Tags:-
- Imagine that you are currently working for a precision medicine startup: Machine Learning Paper Review in Precision Medicine, Written Assignment 1, NUS, Singapore
- Go Business offers PSG solutions for enterprises in Singapore: Collective Intelligence and Entrepreneurship, Assignment 1, JCU, Singapore
- Design an ontology based on- Accidents can be categorised as chemical, electrical, fire, kinetic or liquid: Collective Intelligence and Entrepreneurship, Assignment 1, JCU, Singapore
- Project Control Monitoring, Assignment, HU, Singapore: Deliberate Project MONITORING AND CONTROL or PMC Identification
- DSM500: Final Project Report, Coursework 2, UOL, Singapore
- DSM080: Financial Markets, Assignment, UOL, Singapore: A grapefruit juice futures contract is for 15,000 pounds of frozen grapefruit juice
- DSM080: Financial Markets, Assignment, UOL, Singapore: The share price of a certain stock today is $42.50, and five-month European style call options with a strike price of $45 currently sell for $4.25.
- DSM080: Financial Markets, Assignment, UOL, Singapore: A trader who is working in the gold markets is able to borrow money at the interest rate of 7% per annum
- DSM080 Financial Markets, Assignment, UOL, Singapore: A dollar-based American corporation has decided that it will have to pay 6 million UK pounds in three months
- Principle of Finance Assignment, UCD, Singapore: National Gaming Inc. (National) operates the weekly lottery in the country
UP TO 15 % DISCOUNT