Algorithms for improving efficiency of discrete Markov chains (Q1745667)
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: Algorithms for improving efficiency of discrete Markov chains |
scientific article; zbMATH DE number 6861221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for improving efficiency of discrete Markov chains |
scientific article; zbMATH DE number 6861221 |
Statements
Algorithms for improving efficiency of discrete Markov chains (English)
0 references
18 April 2018
0 references
Markov chain Monte Carlo
0 references
Peskun ordering
0 references
Metropolis-Hastings algorithm
0 references
asymptotic efficiency
0 references
0.8152834177017212
0 references
0.7743456363677979
0 references
0.7733441591262817
0 references
0.7555043697357178
0 references
0.7548791766166687
0 references
