Speeding up the FMMR perfect sampling algorithm: A case study revisited (Q4446872)
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: Speeding up the FMMR perfect sampling algorithm: A case study revisited |
scientific article; zbMATH DE number 2037529
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Speeding up the FMMR perfect sampling algorithm: A case study revisited |
scientific article; zbMATH DE number 2037529 |
Statements
Speeding up the FMMR perfect sampling algorithm: A case study revisited (English)
0 references
3 February 2004
0 references
Markov Chain Monte Carlo method
0 references
move-to-front rule
0 references
perfect simulation
0 references
exact sampling
0 references
rejection sampling
0 references
FMMR algorithm
0 references
Fill's algorithm
0 references
coupling from the past
0 references
Propp-Wilson algorithm
0 references
running time
0 references
monotonicity
0 references
separation
0 references
strong stationary time
0 references
partially ordered set
0 references
0.8394248
0 references
0.8265108
0 references
0.80044055
0 references
0.79653144
0 references
