An interruptible algorithm for perfect sampling via Markov chains
From MaRDI portal
Publication:1296621
DOI10.1214/aoap/1027961037zbMath0939.60084OpenAlexW2066749736MaRDI QIDQ1296621
Publication date: 2 August 1999
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1027961037
Sampling theory, sample surveys (62D05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stopping times; optimal stopping problems; gambling theory (60G40)
Related Items
Stochastic monotonicity and realizable monotonicity, Perfect sampling of ergodic Harris chains, Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration, A mixture representation of \(\pi\) with applications in Markov chain Monte Carlo and perfect sampling., Efficient Markovian couplings: Examples and counterexamples., Regenerative Markov Chain Monte Carlo for Any Distribution, Perfect sampling for Bayesian variable selection in a linear regression model, The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof, Bayesian networks: regenerative Gibbs samplings, On the simulation of Markov chain steady-state distribution using CFTP algorithm, Multiprocess parallel antithetic coupling for backward and forward Markov chain Monte Carlo, A New Method for Coupling Random Fields, A Guide to Exact Simulation, Likelihood Inference for Gibbs Processes in the Analysis of Spatial Point Patterns, Kalikow-type decomposition for multicolor infinite range particle systems, Comparison inequalities and fastest-mixing Markov chains, Perfect sampling for Gibbs point processes using partial rejection sampling, How to couple from the past using a read-once source of randomness, Polynomial time approximate or perfect samplers for discretized Dirichlet distribution, Bayesian networks: generating independent samples, A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data, Slice sampling. (With discussions and rejoinder), Exact sampling for intractable probability distributions via a Bernoulli factory, Combinatorics of periods in strings., The mathematics of mixing things up, Computational issues for perfect simulation in spatial point patterns., Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings, Mixing times of lozenge tiling and card shuffling Markov chains, Complexity Questions in Non-Uniform Random Variate Generation, Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers, Strong stationary duality for diffusion processes, Unnamed Item, Rejection- and importance-sampling-based perfect simulation for Gibbs hard-sphere models, SMALL AND PSEUDO-SMALL SETS FOR MARKOV CHAINS, Monotonic multigamma coupling for perfect sampling, Efficiency test of pseudorandom number generators using random walks, Perfect simulation and inference for point processes given noisy observations, Existence condition of strong stationary times for continuous time Markov chains on discrete graphs, A kind of dual form for coupling from the past algorithm, to sample from Markov chain steady-state probability, Layer Sampling, Perfect simulation for marked point processes, Perfect Forward Simulation via Simulated Tempering, Simulation study for the clan of ancestors in a perfect simulation scheme of a continuous one-dimensional loss network, A novel MM algorithm and the mode-sharing method in Bayesian computation for the analysis of general incomplete categorical data, Perfect simulation for interacting point processes, loss networks and Ising models., Efficient Markovian couplings: Examples and counterexamples, From the Bernoulli factory to a dice enterprise via perfect sampling of Markov chains, Perfect sampling from independent Metropolis-Hastings chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong stationary times via a new form of duality
- Separation cut-offs for birth and death chains
- Strong uniform times and finite random walks
- Stochastic inequalities on partially ordered spaces
- Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes
- Two ergodicity criteria for stochastically recursive sequences
- Bayesian computation and stochastic systems. With comments and reply.
- Stochastic monotonicity and realizable monotonicity
- Exact mixing in an unknown Markov chain
- Stochastically recursive sequences and their generalizations
- Studying Convergence of Markov Chain Monte Carlo Algorithms Using Coupled Sample Paths
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Shuffling Cards and Stopping Times
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
- Exact sampling from anti‐monotone systems
- Generalized Monte Carlo significance tests
- Stationarity detection in the initial transient problem
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms
- Simulating the Invariant Measures of Markov Chains Using Backward Coupling at Regeneration Times
- The Existence of Probability Measures with Given Marginals
