Results 1  10
of
71
Iterated random functions
 SIAM Review
, 1999
"... Abstract. Iterated random functions are used to draw pictures or simulate large Ising models, among other applications. They offer a method for studying the steady state distribution of a Markov chain, and give useful bounds on rates of convergence in a variety of examples. The present paper surveys ..."
Abstract

Cited by 135 (1 self)
 Add to MetaCart
Abstract. Iterated random functions are used to draw pictures or simulate large Ising models, among other applications. They offer a method for studying the steady state distribution of a Markov chain, and give useful bounds on rates of convergence in a variety of examples. The present paper surveys the field and presents some new examples. There is a simple unifying idea: the iterates of random Lipschitz functions converge if the functions are contracting on the average. 1. Introduction. The
Exact sampling from a continuous state space, Scandinavian
 Journal of Statistics
, 1998
"... ABSTRACT. Propp & Wilson (1996) described a protocol, called coupling from the past, for exact sampling from a target distribution using a coupled Markov chain Monte Carlo algorithm. In this paper we extend coupling from the past to various MCMC samplers on a continuous state space; rather than ..."
Abstract

Cited by 89 (7 self)
 Add to MetaCart
ABSTRACT. Propp & Wilson (1996) described a protocol, called coupling from the past, for exact sampling from a target distribution using a coupled Markov chain Monte Carlo algorithm. In this paper we extend coupling from the past to various MCMC samplers on a continuous state space; rather than following the monotone sampling device of Propp & Wilson, our approach uses methods related to gammacoupling and rejection sampling to simulate the chain, and direct accounting of sample paths.
An Interruptible Algorithm for Perfect Sampling via Markov Chains
 Annals of Applied Probability
, 1998
"... For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution # on an enormously large state space, but elementary sampling is ruled out by the infeasibility of calculating an appropriate nor ..."
Abstract

Cited by 82 (6 self)
 Add to MetaCart
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution # on an enormously large state space, but elementary sampling is ruled out by the infeasibility of calculating an appropriate normalizing constant. The same difficulty arises in computer science problems where one seeks to sample randomly from a large finite distributive lattice whose precise size cannot be ascertained in any reasonable amount of time. The Markov chain Monte Carlo (MCMC) approximate sampling approach to such a problem is to construct and run "for a long time" a Markov chain with longrun distribution #. But determining how long is long enough to get a good approximation can be both analytically and empirically difficult. Recently, Jim Propp and David Wilson have devised an ingenious and efficient algorithm to use the same Markov chains to produce perfect (i.e., exact) samples from #. However, the running t...
Exact sampling for Bayesian inference: towards general purpose algorithms
 Bayesian Statistics 6
, 1998
"... this paper are fairly easy to implement and could be used as diagnostics instead. Nonexact uses of couplers are also discussed in Murdoch and Rosenthal (1998). Regarding Professor Tierney's ideas for a use for noncoalesced endpoints: unfortunately, we do not have a coupler that is both genera ..."
Abstract

Cited by 40 (6 self)
 Add to MetaCart
this paper are fairly easy to implement and could be used as diagnostics instead. Nonexact uses of couplers are also discussed in Murdoch and Rosenthal (1998). Regarding Professor Tierney's ideas for a use for noncoalesced endpoints: unfortunately, we do not have a coupler that is both general purpose and easy to apply, where it is straightforward to come up with a finite list of candidates from an easily identifiable time. The rejection and multigamma couplers are too hard to apply, and the random walk couplers can have infinite sets of states that take a long time to move. Finally, we know this is a Bayesian conference and a Bayesian volume, but we still think it is entirely appropriate to take a frequentist perspective in judging the quality of a Monte Carlo sample!
Exact Sampling From AntiMonotone Systems
 Statistica Neerlandica
, 1998
"... A new approach to Markov chain Monte Carlo simulation was recently proposed by Propp and Wilson. This approach, unlike traditional ones, yields samples which have exactly the desired distribution. The ProppWilson algorithm requires this distribution to have a certain structure called monotonicity. ..."
Abstract

Cited by 39 (1 self)
 Add to MetaCart
A new approach to Markov chain Monte Carlo simulation was recently proposed by Propp and Wilson. This approach, unlike traditional ones, yields samples which have exactly the desired distribution. The ProppWilson algorithm requires this distribution to have a certain structure called monotonicity. In this paper an idea of Kendall is applied to show how the algorithm can be extended to the case where monotonicity is replaced by antimonotonicity. As illustrating examples, simulations of the hardcore model and the randomcluster model are presented.
Perfect simulation for interacting point processes, loss networks and Ising models
, 1999
"... We present a perfect simulation algorithm for measures that are absolutely continuous with respect to some Poisson process and can be obtained as invariant measures of birthanddeath processes. Examples include area and perimeterinteracting point processes (with stochastic grains), invariant meas ..."
Abstract

Cited by 38 (11 self)
 Add to MetaCart
We present a perfect simulation algorithm for measures that are absolutely continuous with respect to some Poisson process and can be obtained as invariant measures of birthanddeath processes. Examples include area and perimeterinteracting point processes (with stochastic grains), invariant measures of loss networks, and the Ising contour and random cluster models. The algorithm does not involve any coupling hence it is not tied up to monotonicity requirements and it directly provides samples of the infinitevolume measure. The algorithm is based on a twostep procedure: (i) a perfectsimulation scheme for (spacetime) marked Poisson processes (free birthanddeath process, free loss networks), and (ii) a "cleaning" algorithm that trims out this process according to the interaction rules of the target process. The first step involves the perfect generation of "ancestors" of a given object, that is of predecessors 1 that may have an influence on the birthrate under the targe...
How to Couple from the Past Using a ReadOnce Source of Randomness
, 1999
"... We give a new method for generating perfectly random samples from the stationary distribution of a Markov chain. The method is related to coupling from the past (CFTP), but only runs the Markov chain forwards in time, and never restarts it at previous times in the past. The method is also related ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
We give a new method for generating perfectly random samples from the stationary distribution of a Markov chain. The method is related to coupling from the past (CFTP), but only runs the Markov chain forwards in time, and never restarts it at previous times in the past. The method is also related to an idea known as PASTA (Poisson arrivals see time averages) in the operations research literature. Because the new algorithm can be run using a readonce stream of randomness, we call it readonce CFTP. The memory and time requirements of readonce CFTP are on par with the requirements of the usual form of CFTP, and for a variety of applications the requirements may be noticeably less. Some perfect sampling algorithms for point processes are based on an extension of CFTP known as coupling into and from the past; for completeness, we give a readonce version of coupling into and from the past, but it remains unpractical. For these point process applications, we give an alternative...
Perfect simulation of conditionally specified models
, 1999
"... . JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the ..."
Abstract

Cited by 32 (4 self)
 Add to MetaCart
. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at
On some weighted Boolean models.
 Advances in Theory and Applications of Random Sets
, 1997
"... An overview is given of some recent work (joint with Adrian Baddeley of Perth and Colette van Lieshout of Warwick) on a new class of random point and set processes, obtained using a rather natural weighting procedure employing quermass integrals. The concept of exact (or perfect) simulation of point ..."
Abstract

Cited by 30 (10 self)
 Add to MetaCart
An overview is given of some recent work (joint with Adrian Baddeley of Perth and Colette van Lieshout of Warwick) on a new class of random point and set processes, obtained using a rather natural weighting procedure employing quermass integrals. The concept of exact (or perfect) simulation of point processes is then introduced, and a discussion is given of possibilities for perfect simulation of quermass weighted processes. 1 Introduction. This short paper is a progress report on some recent work of mine (partly in collaboration with Adrian Baddeley of Perth and Colette van Lieshout of Warwick); concerning new models for point processes and random sets, and the application to them of a new technique for "exact" or "perfect" simulation. 2 A brief overview of quermassinteraction processes In this section we review the idea of weighting point processes and random sets using quermass integrals. Recall Baddeley and Van Lieshout's definition [BvL95] of an areainteraction point process: ...