Monotonicity requirements for efficient exact sampling with Markov chains (Q4604155)
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: Monotonicity requirements for efficient exact sampling with Markov chains |
scientific article; zbMATH DE number 6843249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monotonicity requirements for efficient exact sampling with Markov chains |
scientific article; zbMATH DE number 6843249 |
Statements
23 February 2018
0 references
exact simulations
0 references
perfect simulation
0 references
coupling from the past
0 references
Fill's rejection algorithm
0 references
strong stationary duality
0 references
strong stationary time
0 references
coupling
0 references
stochastic monotonicity
0 references
realizable monotonicity
0 references
Möbius monotonicity
0 references
failure rate monotonicity
0 references
Siegmund duality
0 references
0.7797672748565674
0 references
0.7775694131851196
0 references
0.7699195146560669
0 references
