The randomness recycler: a new technique for perfect sampling

  title={The randomness recycler: a new technique for perfect sampling},
  author={James Allen Fill and Mark L. Huber},
  journal={Proceedings 41st Annual Symposium on Foundations of Computer Science},
  • J. A. Fill, M. Huber
  • Published 29 September 2000
  • Mathematics
  • Proceedings 41st Annual Symposium on Foundations of Computer Science
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples from these distributions. The primary drawback to traditional Markov chain methods is that the mixing time of the chain is usually unknown, which makes it impossible to determine how close the output samples are to having the target distribution. The authors present a novel protocol, the randomness recycler (RR), that… 


Perfect simulation refers to the art of converting suitable Markov Chain Monte Carlo algorithms into algorithms which return exact draws from the target distribution, instead of long-time

Markov Chains and Mixing Times

This book is an introduction to the modern approach to the theory of Markov chains. The main goal of this approach is to determine the rate of convergence of a Markov chain to the stationary

Dynamic sampling from graphical models

The main contribution of this paper is an algorithm that can sample dynamically from a broad class of graphical models over discrete random variables and relies on a local resampling algorithm and a new ``equilibrium'' property that is shown to be satisfied by the algorithm at each step, and enables it to prove its correctness.

Perfect simulation for marked point processes

Perfect simulation with exponential tails on the running time

  • M. Huber
  • Computer Science
    Random Struct. Algorithms
  • 2008
This article shows that commonly used protocols for creating perfect simulation algorithms, such as Coupling From the Past can be used in such a fashion that the running time is unlikely to be very much larger than the expected running time.

Appendix A . A Bernoulli Factory for Margin Overflow 39 Appendix B . Monotonicity of Constraint Properties 41 Appendix C . { 2 , 3 }-tree Witness for Constraint Properties

A fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime with running time polynomial in both = and Δ, which departs from all previous fast algorithms for sampling LLL.

Sampling Lovász Local Lemma For General Constraint Satisfaction Solutions In Near-Linear Time

A fast algorithm for sampling uniform solutions of general constraint satisfaction problems (CSPs) in a local lemma regime with running time polynomial in both 𝑛 and Δ, which departs from all previous fast algorithms for sampling LLL.

Fundamentals of Partial Rejection Sampling

This article provides a largely self-contained account of the basic form of the partial rejection sampling algorithm and its analysis, and aims at greater efficiency by resampling only a subset of variables that ‘go wrong’.

Parallel Local Approximation MCMC for Expensive Models

It is proved that samplers running in parallel can collaboratively construct a shared posterior approximation while ensuring ergodicity of each associated chain, providing a novel opportunity for exploiting parallel computation in MCMC.



Exact sampling with coupled Markov chains and applications to statistical mechanics

This work describes a simple variant of this method that determines on its own when to stop and that outputs samples in exact accordance with the desired distribution, and uses couplings which have also played a role in other sampling schemes.

Exact sampling and approximate counting techniques

  • M. Huber
  • Computer Science, Mathematics
    STOC '98
  • 1998
This work presents two algorithms for uniformly sampling from the proper colorings of a graph using colors using the Potts model, and presents the first polynomial time exact sampling algorithm for this problem, which is the first to run in polynometric time.

Fast convergence of the Glauber dynamics for sampling independent sets

This paper proves complementary hardness of approximation results, which show that it is hard to sample from this distribution when > c for a constant c > 0 and shows fast convergence of this dynamics.

The Swendsen-Wang process does not always mix rapidly

It is shown that there are occasions when the mixing time of the Swendsen–Wang process is exponential in the size of the system, related to the phenomenon of first-order phase transitions in Potts systems with q > 2 states.

On Markov Chains for Independent Sets

A new rapidly mixing Markov chain for independent sets is defined and a polynomial upper bound for the mixing time of the new chain is obtained for a certain range of values of the parameter ?, which is wider than the range for which the mixingTime of the Luby?Vigoda chain is known to be polynomially bounded.

The Swendsen–Wang Process Does Not Always Mix Rapidly

The Swendsen–Wang process provides one possible dynamics for the q-state Potts model. Computer simulations of this process are widely used to estimate the expectations of various observables (random

Sampling spin configurations of an Ising system

This work shows that by using the JS algorithm and a third equivalent representation of the Ising partition function (the Fortuin-Kasteleyn `random-cluster model’), self-reducibility yields a (classical) polynomial time algorithm for sampling Ising spin configurations.

Amortized efficiency of list update and paging rules

This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory.

Loss networks

The model presents questions of call acceptance and capacity allocation (for example, routing), with the aim of ensuring good network performance which is additionally robust with respect to variations in network parameters.