Abstract
One way to get a random sample is using simulation. Simulation can be done directly or indirectly. Markov Chain Monte Carlo (MCMC) is an indirectly simulation method. MCMC method has some algorithms. In this thesis only discussed about Gibbs Sampling algorithm. Gibbs Sampling is introduced by Geman and Geman at 1984. This algorithm can be used if the conditional distribution of the target distribution is known. It has applied on two casses, these are generation of bivariate normal random data and parameters estimation using Bayesian method. The data used in this research are the death of pulmonary tuberculosis in ASEAN in 2007. The results obtained are and with standard error for and .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
