An interruptible algorithm for perfect sampling via Markov chains

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Symposium on the Theory of Computing

• Publication date

  1997-05-04

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.1145/258533.258664
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes

  1999cited by this paper
• Perfect simulation of conditionally specified models

  1999cited by this paper
• The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms

  1998cited by this paper
• Simulating the Invariant Measures of Markov Chains Using Backward Coupling at Regeneration Times

  1998cited by this paper
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph

  1998cited by this paper
• Perfect Simulation for the Area-Interaction Point Process

  1998cited by this paper
• On some weighted Boolean models

  1997cited by this paper
• On some weighted Boolean models

  1997cited by this paper
• Characterisation results and Markov chain Monte Carlo algorithms including exact simulation for some

  1996cited by this paper
• Studying Convergence of Markov Chain Monte Carlo Algorithms Using Coupled Sample Paths

  1996cited by this paper
• Exact sampling with coupled Markov chains and applications to statistical mechanics

  1996cited by this paper
• Bayesian Computation and Stochastic Systems

  1995cited by this paper
• What do we know about the Metropolis algorithm?

  1995cited by this paper
• Exact Mixing in an Unknown Markov Chain

  1995cited by this paper
• Two ergodicity criteria for stochastically recursive sequences

  1994cited by this paper
• Algorithms for Random Generation and Counting: A Markov Chain Approach

  1993cited by this paper
• Stationarity detection in the initial transient problem

  1992cited by this paper
• STOCHASTICALLY RECURSIVE SEQUENCES AND THEIR GENERALIZATIONS

  1992cited by this paper
• Sequential Monte Carlo p-values

  1991cited by this paper
• Strong Stationary Times Via a New Form of Duality

  1990cited by this paper
• A personal communication

  1989cited by this paper
• Lower bounds for covering times for reversible Markov chains and random walks on graphs

  1989cited by this paper
• Generalized Monte Carlo significance tests

  1989cited by this paper
• Group representations in probability and statistics

  1988cited by this paper
• Strong uniform times and finite random walks

  1987cited by this paper
• SHUFFLING CARDS AND STOPPING-TIMES

  1986cited by this paper
• On the Statistical Analysis of Dirty Pictures

  1986cited by this paper
• Enumerative Combinatorics

  1986cited by this paper
• Interacting Particle Systems

  1985cited by this paper
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images

  1984cited by this paper
• Stochastic Inequalities on Partially Ordered Spaces

  1977cited by this paper
• The Existence of Probability Measures with Given Marginals

  1965cited by this paper
• Ein Satz über Untermengen einer endlichen Menge

  1928cited by this paper

• Perfect Privacy and Strong Stationary Times for Markovian Sources

  2026cites this paper
• On perfect sampling: ROCFTP with Metropolis-multishift coupler

  2025cites this paper
• Symbolic State Seeding Improves Coverage of Reinforcement Learning

  2025cites this paper
• Perfecting MCMC Sampling: Recipes and Reservations

  2024cites this paper
• Perfect simulation from unbiased simulation

  2023cites this paper
• Almost Uniform Sampling of Independent Sets in Polynomial Time - Implying NP=RP

  2023cites this paper
• Combinatorics of periods in strings. (English)

  2023cites this paper
• Polarisation-optical model of a controlled random number generator

  2022cites this paper
• The Application of Homogeneous Markov Chains in the Analysis of the Technical State of Tractors

  2022cites this paper
• Boost your favorite Markov Chain Monte Carlo sampler using Kac's theorem: the Kick-Kac teleportation algorithm

  2022cites this paper
• Design of Hamiltonian Monte Carlo for perfect simulation of general continuous distributions

  2022cites this paper
• INSTRUMENTAL AND MATHEMATICAL METHODS IN MANAGEMENT PROCESSES Polarisation-optical model of a controlled random number generator

  2022cites this paper
• UvA-DARE (Digital Academic Repository) Rejection and importance sampling based perfect simulation for Gibbs processes with a focus on hard-sphere models

  2021cites this paper
• J ul 2 02 1 Perfect Sampling for ( Atomic ) Lovász Local Lemma

  2021cites this paper
• Couplings of the Random-Walk Metropolis algorithm

  2021cites this paper
• Bayesian networks: regenerative Gibbs samplings

  2021cites this paper
• Transition kernel couplings of the Metropolis–Hastings algorithm

  2021cites this paper
• Bayesian networks: generating independent samples

  2021cites this paper
• Perfect Sampling for (Atomic) Lovász Local Lemma

  2021cites this paper
• Metropolis–Hastings transition kernel couplings

  2021cites this paper
• Ensemble Rejection Sampling

  2020cites this paper
• Convergence of Markov Chains

  2020cites this paper
• The Amazing Power of Randomness: NP=RP

  2020cites this paper
• Gibbs posterior convergence and the thermodynamic formalism

  2019cites this paper
• Perfect Sampling of graph k-colorings for k>3Δ

  2019cites this paper
• A Review on the Exact Monte Carlo Simulation

  2019influential citation
• Estimating uncertainty in MRF-based image segmentation: A perfect-MCMC approach

  2019cites this paper
• Exact sampling of determinantal point processes with sublinear time preprocessing

  2019cites this paper
• Perfect sampling for Gibbs point processes using partial rejection sampling

  2019cites this paper
• From the Bernoulli factory to a dice enterprise via perfect sampling of Markov chains

  2019cites this paper
• Markov Chain Monte Carlo

  2019cites this paper
• A kind of dual form for coupling from the past algorithm, to sample from Markov chain steady-state probability

  2019cites this paper
• A novel MM algorithm and the mode-sharing method in Bayesian computation for the analysis of general incomplete categorical data

  2019cites this paper
• Dynamic sampling from graphical models

  2018cites this paper
• Network Structure Sampling in Bayesian Networks via Perfect Sampling from Linear Extensions

  2018cites this paper
• Doeblin trees

  2018cites this paper
• Recursive functions on conditional Galton‐Watson trees

  2018cites this paper
• Analysis of Perfect Sampling Methods for Hard-sphere Models

  2018cites this paper
• A minimax near-optimal algorithm for adaptive rejection sampling

  2018cites this paper
• Strong Stationary Times and its use in Cryptography

  2017influential citation
• Scalable Parallelization of a Markov Coalescent Genealogy Sampler

  2017cites this paper
• Acceptance-rejection and Importance Sampling Methodologies for Perfect Sampling from Gibbs Point Processes

  2017cites this paper
• Rejection- and importance-sampling-based perfect simulation for Gibbs hard-sphere models

  2017cites this paper
• Pennsylvania’s Congressional districting is an outlier: Expert Report

  2017cites this paper
• Convergence rate of the powers of an operator. Applications to stochastic systems

  2017cites this paper
• From Monte Carlo to Las Vegas: Improving Restricted Boltzmann Machine Training Through Stopping Sets

  2017cites this paper
• Existence Condition of Strong Stationary Times for Continuous Time Markov Chains on Discrete Graphs

  2017influential citation
• Markov Chains and Mixing Times: Second Edition

  2017cites this paper
• Circularly-Coupled Markov Chain Sampling

  2017cites this paper
• Perfect Sampling for Gibbs Processes with a focus on Hard-sphere Models

  2017cites this paper
• A new rejection sampling method without using hat function

  2017cites this paper
• Advances in statistical methodology and analysis in a study of ARC syndrome

  2016cites this paper
• Recueil de modèles aléatoires

  2016cites this paper
• Assessing significance in a Markov chain without mixing

  2016cites this paper
• Existence Condition of Strong Stationary Times for Continuous Time Markov Chains on Discrete Graphs

  2016influential citation
• Probability Theory and Stochastic Modelling

  2016cites this paper
• Layer Sampling

  2016cites this paper
• Perfect Simulation for Markov Chains Arising From Discrete-Event Simulation

  2016cites this paper
• Randomized Stopping Times and Provably Secure Pseudorandom Permutation Generators

  2016cites this paper
• Pliable Rejection Sampling

  2016cites this paper
• Application of Selection Rejection Methodology to some Statistical Distributions

  2015cites this paper
• Regenerative Markov Chain Importance Sampling

  2015cites this paper
• Perfect and nearly perfect sampling of work-conserving queues

  2015cites this paper
• Strong Stationary Duality for Diffusion Processes

  2015cites this paper
• Graph Inference and Graph Matching

  2015cites this paper
• Algorithmic and geometric aspects of the random-cluster model

  2015cites this paper
• Strong Stationary Duality for Diffusion Processes

  2014cites this paper
• Markov Chain Monte Carlo (MCMC)

  2013cites this paper
• Strong stationary times for one-dimensional diffusions

  2013cites this paper
• Intertwinings, interlacing eigenvalues, and strong stationary duality for diffusions

  2013influential citation
• A Class Coupler for Perfect Sampling from Continuous Distributions With and Without Atoms

  2012cites this paper
• Ergodic Theory for Interested Computer Scientists

  2012cites this paper
• Monotonic multigamma coupling for perfect sampling

  2012cites this paper
• Hitting Times and Interlacing Eigenvalues: A Stochastic Approach Using Intertwinings

  2012cites this paper
• A Quasi-Likelihood Approach to Zero-Inflated Spatial Count Data

  2012cites this paper
• Sampling Online Social Networks Using Coupling from the Past

  2012cites this paper
• Hitting Times and Interlacing Eigenvalues: A Stochastic Approach Using Intertwinings

  2012influential citation
• Regenerative Markov Chain Monte Carlo for Any Distribution

  2012cites this paper
• Notes for the course: Semigroups and Markov Processes

  2012cites this paper
• Parallel Monte Carlo Methods

  2012cites this paper
• Introduction to CFTP using

  2012cites this paper
• Random generation of hypotheses in the JSM method using simple Markov chains

  2012cites this paper
• Simulation and Markov Chain Monte Carlo

  2011cites this paper
• A Short History of MCMC: Subjective Recollections from Incomplete Data

  2011cites this paper
• The double CFTP method

  2011cites this paper
• Psc 585: Dynamic and Computational Modeling

  2011cites this paper
• MCMC Using Hamiltonian Dynamics

  2011cites this paper
• A Practical Implementation of the Bernoulli Factory

  2011cites this paper
• Comparison inequalities and fastest-mixing Markov chains

  2011cites this paper
• The Mathematics of Mixing Things Up

  2011cites this paper
• Efficient, concurrent Bayesian analysis of full waveform LaDAR data

  2011cites this paper
• Introduction to Markov Chain Monte Carlo

  2011cites this paper
• Gaussian Random Field Models for Spatial Data

  2011cites this paper
• Kalikow-type decomposition for multicolor infinite range particle systems

  2010cites this paper
• Complexity Questions in Non-Uniform Random Variate Generation

  2010cites this paper
• Exact sampling for intractable probability distributions via a Bernoulli factory

  2010cites this paper
• On perfect simulation and EM estimation

  2010cites this paper
• Polynomial time approximate or perfect samplers for discretized Dirichlet distribution

  2010cites this paper
• Exact Markov chain Monte Carlo and Bayesian linear regression

  2009cites this paper
• A primer on perfect simulation

  2009influential citation