Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields (Q4364838): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61719227, #quickstatements; #temporary_batch_1710702420720 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/biomet/84.1.1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014441733 / rank | |||
Normal rank | |||
Revision as of 02:52, 20 March 2024
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
