Pages that link to "Item:Q4943355"
From MaRDI portal
The following pages link to How to couple from the past using a read-once source of randomness (Q4943355):
Displaying 29 items.
- Coupling from the past with randomized quasi-Monte Carlo (Q622169) (← links)
- Polynomial time approximate or perfect samplers for discretized Dirichlet distribution (Q623726) (← links)
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers (Q940932) (← links)
- Slice sampling. (With discussions and rejoinder) (Q1412362) (← links)
- Computational issues for perfect simulation in spatial point patterns. (Q1421552) (← links)
- Efficiency test of pseudorandom number generators using random walks (Q1765462) (← links)
- A mixture representation of \(\pi\) with applications in Markov chain Monte Carlo and perfect sampling. (Q1879910) (← links)
- Exact sampling for intractable probability distributions via a Bernoulli factory (Q1950803) (← links)
- Parallel simulation of two-dimensional Ising models using probabilistic cellular automata (Q2046507) (← links)
- Correlation decay for hard spheres via Markov chains (Q2170370) (← links)
- Doeblin trees (Q2279314) (← links)
- Criticality of measures on 2-d Ising configurations: from square to hexagonal graphs (Q2283157) (← links)
- A kind of dual form for coupling from the past algorithm, to sample from Markov chain steady-state probability (Q2293281) (← links)
- Multiprocess parallel antithetic coupling for backward and forward Markov chain Monte Carlo (Q2388353) (← links)
- One-shot CFTP; application to a class of truncated Gaussian densities (Q2433243) (← links)
- Exact Monte Carlo simulation for fork-join networks (Q3021247) (← links)
- On the simulation of Markov chain steady-state distribution using CFTP algorithm (Q3182209) (← links)
- Using a Markov Chain to Construct a Tractable Approximation of an Intractable Probability Distribution (Q3411057) (← links)
- Relating Time and Customer Averages for Queues Using ‘forward’ Coupling from the Past (Q3516428) (← links)
- Likelihood-based inference for Matérn type-III repulsive point processes (Q3558933) (← links)
- Extension of Fill's perfect rejection sampling algorithm to general chains. (Q4521550) (← links)
- Probability and algorithmics: a focus on some recent developments (Q4606438) (← links)
- Monotonic multigamma coupling for perfect sampling (Q4912039) (← links)
- Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm (Q4982617) (← links)
- Perfect simulation of steady-state Markov chain on mixed state space (Q5079882) (← links)
- Nonasymptotic Bounds on the Mean Square Error for MCMC Estimates via Renewal Techniques (Q5326129) (← links)
- Perfect Simulation for Image Restoration (Q5421586) (← links)
- Perfect Forward Simulation via Simulated Tempering (Q5481741) (← links)
- On the sub-additivity of stochastic matching (Q6623437) (← links)
