2018
DOI: 10.3390/e20090642
|View full text |Cite
|
Sign up to set email alerts
|

Bayesian Computational Methods for Sampling from the Posterior Distribution of a Bivariate Survival Model, Based on AMH Copula in the Presence of Right-Censored Data

Abstract: In this paper, we study the performance of Bayesian computational methods to estimate the parameters of a bivariate survival model based on the Ali–Mikhail–Haq copula with marginal distributions given by Weibull distributions. The estimation procedure was based on Monte Carlo Markov Chain (MCMC) algorithms. We present three version of the Metropolis–Hastings algorithm: Independent Metropolis–Hastings (IMH), Random Walk Metropolis (RWM) and Metropolis–Hastings with a natural-candidate generating density (MH). S… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…Therefore, the Random Walk Metropolis (RWM) algorithm was utilized to generate random samples from an unknown distribution. Similar to acceptance-rejection sampling, the algorithm requires that the applied value has an acceptable probability for each iteration of the algorithm to ensure that the Markov chain converges for the goal density ( Saraiva & Suzuki, 2017 ). To use the RWM algorithm to update the shape parameter, the updated value is approved with probability min (1, A k ), where A k is defined by where c ′ ( t ) and k ( t ) , t =1 , 2, …, T are the Bayesian estimators of c ′ and k based on Gibbs’ sampling, respectively.…”
Section: Bayesian Confidence Intervalmentioning
confidence: 99%
“…Therefore, the Random Walk Metropolis (RWM) algorithm was utilized to generate random samples from an unknown distribution. Similar to acceptance-rejection sampling, the algorithm requires that the applied value has an acceptable probability for each iteration of the algorithm to ensure that the Markov chain converges for the goal density ( Saraiva & Suzuki, 2017 ). To use the RWM algorithm to update the shape parameter, the updated value is approved with probability min (1, A k ), where A k is defined by where c ′ ( t ) and k ( t ) , t =1 , 2, …, T are the Bayesian estimators of c ′ and k based on Gibbs’ sampling, respectively.…”
Section: Bayesian Confidence Intervalmentioning
confidence: 99%
“…(11) Aslam et al (2014) apresentam opções para a modelagem das prioris dos parâmetros de escala e forma da distribuição de Weibull; entre estas, o modelo gama-gama, no qual as prioris dos parâmetros de escala s e forma k são modeladas por distribuições gama independentes (Saraiva e Suzuki, 2017), cujas funções densidades de probabilidades são apresentadas a seguir:…”
Section: Inferência Bayesianaunclassified
“…Using the MCMC technique, we pursue generating (stationary) sequences of simulated values from the posterior distribution. The Metropolis-Hastings algorithm was developed by Metropolis et al [29] and generalized by Hastings [30], and it is now the most popular MCMC method (see [31][32][33], for example).…”
Section: Computation By Markov Chain Monte Carlomentioning
confidence: 99%