Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields (Q4364838)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields |
scientific article; zbMATH DE number 1088693
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields |
scientific article; zbMATH DE number 1088693 |
Statements
Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields (English)
0 references
7 January 1998
0 references
Gibbs sampler
0 references
Metropolis algorithm
0 references
NP-completeness
0 references
range of interaction
0 references
rate of convergence
0 references
spectral gap
0 references
stopping rule
0 references
