#### Filter Results:

- Full text PDF available (61)

#### Publication Year

1992

2018

- This year (1)
- Last 5 years (12)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- James Gary Propp, David Bruce Wilson
- Random Struct. Algorithms
- 1996

For many applications it is useful to sample from a nite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chainâ€¦ (More)

- David Bruce Wilson
- STOC
- 1996

It is widely known how to generate random spanning trees of an undirected graph. Broder showed how at FOCS [6], and Aldous too found the algorithm [2]. Start at any vertex and do a simple random walkâ€¦ (More)

We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach itsâ€¦ (More)

- James Gary Propp, David Bruce Wilson
- J. Algorithms
- 1998

A general problem in computational probability theory is that of generating a random sample from the state space of a Markov chain in accordance with the steady-state probability law of the chain.â€¦ (More)

- Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David Bruce Wilson
- EUROCRYPT
- 1992

In several crypt,ographic systems, a fixed elcment g of a group (generally z/qz) is repeatedly raised to many different powers. In this paper we present a practical method of speeding u p suchâ€¦ (More)

1.1. Overview. We consider a class of zero-sum two-player stochastic games called tug-of-war and use them to prove that every bounded real-valued Lipschitz function F on a subset Y of a length spaceâ€¦ (More)

- David Bruce Wilson
- Random Struct. Algorithms
- 2000

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â€¦ (More)

A random walk on Z d is excited if the first time it visits a vertex there is a bias in one direction, but on subsequent visits to that vertex the walker picks a neighbor uniformly at random. We showâ€¦ (More)

- BÃ©la BollobÃ¡s, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, David Bruce Wilson
- Random Struct. Algorithms
- 2001

We consider the random 2-satisfiability problem, in which each instance is a formula that is the conjunction of m clauses of the form xâˆ¨ y, chosen uniformly at random from among all 2-clauses on nâ€¦ (More)

We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguingâ€¦ (More)