A proposal distribution generates candidate moves for an iterative sampling algorithm. In Metropolis–Hastings, it suggests where the chain might go next, while an accept/reject rule decides whether the move becomes part of the sample trail. section 5.6
A useful proposal usually favors points near the current location, helping the chain remain in high-density regions, while sometimes suggesting farther points so it can explore elsewhere. Its suggestions are filtered against the target distribution. section 5.7
Metropolis–Hastings repeats a short cycle:
- Start at a current point θ. section 5.6
- Draw a candidate θ′ from a Normal proposal centered at θ, using a chosen standard deviation. section 5.6
- Compare the unnormalized posterior densities with r = PDF(θ′) / PDF(θ). section 5.6
- Accept θ′ with probability min(1, r); otherwise retain θ and try again. section 5.6
A small sampling walk
A Python implementation can set an initial value, choose a proposal standard deviation such as 0.05, generate Normal candidates, evaluate an unnormalized Beta(4, 3) posterior, and store either the candidate or the current value. Repeated accepted and repeated retained states form the Markov chain. section 5.6


