2009
DOI: 10.1007/978-0-387-92407-6
|View full text |Cite
|
Sign up to set email alerts
|

A First Course in Bayesian Statistical Methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
448
0
9

Year Published

2012
2012
2019
2019

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 619 publications
(457 citation statements)
references
References 0 publications
0
448
0
9
Order By: Relevance
“…Then, for every l−th locus, P l was drawn using the Gibbs sampler. Then, the parameters α, β, and γ were updated using the Metropolis-Hastings algorithm, in which new values were proposed using the reflective random walk (Hoff 2009). The final estimates (posterior means and quantiles) were obtained after 1,000,000 cycles, keeping every 250th update and disregarding the first 100,000 updates for burn-in.…”
Section: Analysis Of Outcrossing Ratesmentioning
confidence: 99%
“…Then, for every l−th locus, P l was drawn using the Gibbs sampler. Then, the parameters α, β, and γ were updated using the Metropolis-Hastings algorithm, in which new values were proposed using the reflective random walk (Hoff 2009). The final estimates (posterior means and quantiles) were obtained after 1,000,000 cycles, keeping every 250th update and disregarding the first 100,000 updates for burn-in.…”
Section: Analysis Of Outcrossing Ratesmentioning
confidence: 99%
“…The samples obtained through this algorithm approximate the posterior distribution πθjd (Hoff, 2009). To minimize the effect of initial values and autocorrelation among samples, we discard an initial portion of the Markov chain and consider only every kth sample (thinning the chain).…”
mentioning
confidence: 99%
“…That is why, the prior distribution on ⌧ n and ⌧ s should be as minimally informative as possible [8]. To this end, one sets ↵ n = ↵ s = 1 and n = s !…”
Section: Choice Of the Prior Probability Distribution Of The Precisionsmentioning
confidence: 99%