Grapham: Graphical Models with Adaptive Random Walk Metropolis Algorithms

Details Grapham: Graphical Models with Adaptive Random Walk Metropolis Algorithms Grapham: Graphical Models with Adaptive Random Walk Metropolis Algorithms

2008-11-25

arxiv.org/abs/0811.4095v3

Computational Statistics & Data Analysis 54 (2010) 49-54

Statistics

Computation

9 pages, 3 figures; added references, revised language, other minor changes

Scientific paper

10.1016/j.csda.2009.09.001

Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementation covering several such methods, with emphasis on graphical models for directed acyclic graphs. The implemented algorithms include the seminal Adaptive Metropolis algorithm adjusting the proposal covariance according to the history of the chain and a Metropolis algorithm adjusting the proposal scale based on the observed acceptance probability. Different variants of the algorithms allow one, for example, to use these two algorithms together, employ delayed rejection and adjust several parameters of the algorithms. The implemented Metropolis-within-Gibbs update allows arbitrary sampling blocks. The software is written in C and uses a simple extension language Lua in configuration.

Affiliated with

Also associated with

No associations

Rating

Grapham: Graphical Models with Adaptive Random Walk Metropolis Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Grapham: Graphical Models with Adaptive Random Walk Metropolis Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grapham: Graphical Models with Adaptive Random Walk Metropolis Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-304571