David Bruce Wilson
I am a senior researcher at Microsoft Research and an affiliate associate professor at the University of Washington math department.
425 703-7736
|
David Bruce Wilson
I am a senior researcher at Microsoft Research and an affiliate associate professor at the University of Washington math department.
425 703-7736
|
![[Abs]](buttons/abs.gif){kind=small}
![[PS]](buttons/ps.gif){kind=small}
![[PDF]](buttons/pdf.gif){kind=small}
Chip-firing and rotor-routing on directed graphs,
by
Alexander E. Holroyd,
Lionel Levine,
Karola Mészáros,
Yuval Peres,
James Propp,
and myself.
In and out of Equilibrium II, eds. V. Sidoravicius, M. E. Vares, Series ``Progress in Probability,'' Birkhauser (2008), to appear.
Card shuffling and Diophantine approximation,
by Omer Angel,
Yuval Peres,
and myself. Annals of Applied Probability, 18(3):1215--1231, 2008.
The electrical response matrix of a regular 2n-gon,
by Nathaniel D. Blair-Stahn
and myself.
Two-player Knock 'em Down,
by James A. Fill
and myself. Electronic Journal of Probability,
9:198--212, 2008.
Conformal radii for conformal loop ensembles,
by Oded Schramm,
Scott Sheffield,
and myself.
Boundary partitions in trees and dimers,
by Richard W. Kenyon
and myself.
Tug-of-war and the infinity Laplacian,
by Yuval Peres,
Oded Schramm,
Scott Sheffield,
and myself. To appear in Journal of the AMS.
![[Hex]](hex.png)
Random-turn Hex and other selection games,
by Yuval Peres,
Oded Schramm,
Scott Sheffield,
and myself.
American Mathematical Monthly, 114:373--387, May 2007.
SLE coordinate changes,
by
Oded Schramm,
and myself.
New York Journal of Mathematics, 11:659--669, 2005.
Balanced Boolean functions that can be evaluated so that every input bit is unlikely to be read,
by Itai Benjamini,
Oded Schramm,
and myself. In 37th ACM Symposium on Theory of Computing, pages 244-250, 2005.
Excited Random Walk,
by Itai Benjamini
and myself.
Electronic Communications in Probability, 8:86--92, 2003.
Mixing Time of the Rudvalis Shuffle.
Electronic Communications in Probability, 8:77--85, 2003.
Winding angle variance of Fortuin-Kasteleyn contours, by Benjamin Wieland and myself. Physical Review E 68, 056101, 2003.
On the Red-Green-Blue Model,
Physical Review E 69, 037105, 2004.
Critical resonance in the non-intersecting lattice path model,
by Richard W. Kenyon
and myself.
Probability Theory and Related Fields 130(3):289--318, 2004.
Mixing times of lozenge tiling and card shuffling Markov chains.
The Annals of Applied Probability, 14(1):274--325, 2004.
On the critical exponents of random k-SAT.
Random Structures and Algorithms, 21(2):182--195, 2002.
The Scaling Window of the 2-SAT Transition,
by Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, and myself.
Random Structures and Algorithms
18(3):201--256, 2001.
Diagonal Sums of Boxed Plane Partitions. Electronic Journal of Combinatorics
8(1):N1, 2001.
Layered multishift coupling
for use in perfect sampling algorithms (with a primer on CFTP).
In Neil Madras, editor, Monte Carlo Methods, volume 26 of
Fields Institute Communications, pages 143--179.
American Mathematical Society, 2000.
Trees and Matchings,
by Richard W. Kenyon,
James G. Propp,
and myself.
Electronic Journal of Combinatorics,
7(1):R25, 2000.
How to Couple from the Past Using a Read-Once Source of Randomness.
Random Structures and Algorithms 16(1):85--113, 2000.
Scaling Limits for Minimal and Random Spanning Trees in Two Dimensions,
by
Michael Aizenman,
Almut Burchard,
Charles M. Newman,
and
myself.
Random Structures and Algorithms 15(3&4):319--367, 1999.
Sampling Spin Configurations of an Ising System, by Dana Randall and myself. Two-page note presented at SODA '99.
Coupling from the past: a user's guide,
by James Propp
and myself.
In D. Aldous and J. Propp, editors, Microsurveys in Discrete
Probability, volume 41 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 181--192. American
Mathematical Society, 1998.
Postscript.
How to Get a Perfectly Random Sample From a Generic Markov Chain
and Generate a Random Spanning Tree of a Directed Graph
by Jim Propp and myself.
Journal of Algorithms 27:170--217, 1998.
This article combines two conference articles,
the first one appearing in
The 1996 ACM-SIAM Symposium on Discrete Algorithms, and
the second one appearing in
The 1996 ACM Symposium on the Theory of Computing.
Random Random Walks on
Determinant Algorithms for Random Planar Structures. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 258-267, 1997.
Beyond Islands: Runs in Clone-Probe Matrices, by David S. Greenberg, Cynthia A. Phillips, and myself. RECOMB 97, Proceedings of the First Annual International Conference on Computational Molecular Biology, pp. 320-329, 1997.
Learning Foraging Thresholds for Lizards by Leslie Ann Goldberg, William E. Hart, and myself. J. Theoretical Biology, 197:361-369. A preliminary version appeared in Proceedings of the 9th Conference on Computational Learning Theory, pp. 2-9, 1996.
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics by Jim Propp and myself. Random Structures and Algorithms, 9(1&2):223--252, 1996.
On the Number of Graphs Which Lack Small Cycles by Daniel J. Kleitman and myself. To appear in Discrete Mathematics.
Fast Exponentiation with Precomputation: Algorithms and Lower Bounds by Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, and myself. An extended abstract of this paper appeared in Advances in Cryptology: Eurocrypt '92, Lecture Notes in Computer Science #658, pp. 200-207.
Embedding Leveled Hypercube Algorithms into Hypercubes.
SPAA '92, 4th Annual ACM Symposium on Parallel Algorithms and Architectures
, pp. 264-270, 1992.
This is the article version of my bachelor's thesis, which won the
William A. Martin
memorial prize for best undergraduate computer science
thesis at MIT. (The thesis was supervised by Charles E. Leiserson.)
Pictures handcrafted in the one true language of mathematical computer art: PostScript.