mighty-metropolis

The Metropolis algorithm.

http://github.com/jtobin/mighty-metropolis

Version on this page:1.0.4
LTS Haskell 24.18:2.0.0@rev:1
Stackage Nightly 2025-11-04:2.0.0@rev:1
Latest on Hackage:2.0.0@rev:1

See all snapshots mighty-metropolis appears in

MIT licensed by Jared Tobin
Maintained by [email protected]
This version can be pinned in stack with:mighty-metropolis-1.0.4@sha256:ad9d6e96b1b25461231f1c7b6c40c99db5715fe2234aad0b5c4bc6ecf62afc25,2006

Module documentation for 1.0.4

Used by 1 package in lts-7.24(full list with versions):
declarative

The classic Metropolis algorithm.

Wander around parameter space according to a simple spherical Gaussian distribution.

Exports a mcmc function that prints a trace to stdout, as well as a metropolis transition operator that can be used more generally.

import Numeric.MCMC.Metropolis

rosenbrock :: [Double] -> Double
rosenbrock [x0, x1] = negate (5  *(x1 - x0 ^ 2) ^ 2 + 0.05 * (1 - x0) ^ 2)

main :: IO ()
main = withSystemRandom . asGenIO $ mcmc 10000 1 [0, 0] rosenbrock