1995
DOI: 10.1080/00031305.1995.10476177
|View full text |Cite
|
Sign up to set email alerts
|

Understanding the Metropolis-Hastings Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
741
0
22

Year Published

1999
1999
2012
2012

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 2,363 publications
(766 citation statements)
references
References 18 publications
3
741
0
22
Order By: Relevance
“…(28) are nonstandard we use a MetropolisHasting sampler (see Chib and Greenberg (1995)). Candidate draws of h (t,τ ) are made with a l t -variate Student-t distribution with mean vector m, covariance matrix, S, and ξ degrees of freedom where m is the argument maximizing π(…”
Section: Latent Volatility Samplermentioning
confidence: 99%
“…(28) are nonstandard we use a MetropolisHasting sampler (see Chib and Greenberg (1995)). Candidate draws of h (t,τ ) are made with a l t -variate Student-t distribution with mean vector m, covariance matrix, S, and ξ degrees of freedom where m is the argument maximizing π(…”
Section: Latent Volatility Samplermentioning
confidence: 99%
“…Instead, we implemented a MCMC algorithm for our model within the C language. A Metropolis-Hasting algorithm [15] is used. The details of the Metropolis-Hasting algorithm used in this study are given in the Appendix.…”
Section: Joint Posterior Distributionmentioning
confidence: 99%
“…It generates correlated draws from the joint posterior distribution of model parameters. For our MRDD data analysis, a Metropolis-Hastings algorithm [15,29] was employed to sample for all the parameters. This Metropolis-Hasting algorithm can draw samples from any probability distribution and does not involve knowledge of the conditional posteriors to update the parameters.…”
Section: Appendixmentioning
confidence: 99%
“…In this study we use the random walk approach (Chib & Greenberg, 1995) to sample candidates, i.e. a uniform proposal density centred on the current value d i .…”
Section: (Ii) a Bayesian Hierarchical Modelmentioning
confidence: 99%
“…a uniform proposal density centred on the current value d i . The length of this uniform is determined empirically and should result in average acceptance rates between 0n20 and 0n50 (Chib & Greenberg, 1995) to ensure proper mixing through the parameter space. Note that for a discrete prior on d, i.e.…”
Section: (Ii) a Bayesian Hierarchical Modelmentioning
confidence: 99%