Markov Chain Monte Carlo Maximum Likelihood
No Thumbnail Available
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Markov Chain Monte Carlo Maximum Likelihood
Alternative title
Authors
Published Date
1991
Publisher
Interface Foundation of North America
Type
Conference Paper
Abstract
Markov chain Monte Carlo (e. g., the Metropolis algorithm and Gibbs sampler) is a general tool for simulation of complex stochastic processes useful in
many types of statistical inference. The basics of Markov chain Monte Carlo are
reviewed, including choice of algorithms and variance estimation, and some new
methods are introduced. The use of Markov chain Monte Carlo for maximum likelihood estimation is explained, and its performance is compared with maximum pseudo
likelihood estimation.
Keywords
Description
Related to
Replaces
License
Collections
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Computing Science and Statistics, Proceedings of the 23rd Symposium on the Interface, pp. 156-163
Other identifiers
Suggested citation
Geyer, Charles J.. (1991). Markov Chain Monte Carlo Maximum Likelihood. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/58440.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.