David Bruce Wilson
I am a principal 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 principal 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}
![[PDF]](buttons/pdf.gif){kind=small}
The Hausdorff dimension of the CLE gasket,
by
Jason Miller,
Nike Sun, and
David B. Wilson,
2012.
arXiv:1206.0725.
To appear in Annals of Probability.
Sampling Spin Configurations of an Ising System,
by Dana Randall and David B. Wilson. 10th Symposium on Discrete Algorithms (SODA) pp. S959–960, 1999.
Coupling from the past: a user's guide,
by James G. Propp
and David B. Wilson.
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.
How to Get a Perfectly Random Sample From a Generic Markov Chain
and Generate a Random Spanning Tree of a Directed Graph
by James G. Propp and David B. Wilson.
Journal of Algorithms 27:170–217, 1998.
Random Random Walks on
Determinant Algorithms for Random Planar Structures,
by David B. Wilson.
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 David B. Wilson.
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 David B. Wilson. 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 James G. Propp and David B. Wilson.
Random Structures and Algorithms, 9(1&2):223–252, 1996.
On the Number of Graphs Which Lack Small Cycles, by
Daniel J. Kleitman and David B. Wilson. To appear in Discrete Mathematics.
Fast Exponentiation with Precomputation:
Algorithms and Lower Bounds, by Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, and David B. Wilson. 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,
by David B. Wilson.
SPAA '92, 4th Annual ACM Symposium on Parallel Algorithms and Architectures
, pp. 264–270, 1992.
PNG and GIF and SVG pictures:
Dyck tilings, linear extensions, descents, and inversions,
by
Jang Soo Kim,
Karola Mészáros,
Greta Panova, and
David B. Wilson,
2012.
arXiv:1205.6578.
Extended abstract appeared in DMTCS Proceedings for the 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), pages 769–780, 2012.
The min mean-weight cycle in a random network,
by
Claire Mathieu and
David B. Wilson,
2012.
arXiv:1201.3955
Avoidance coupling,
by
Omer Angel,
Alexander E. Holroyd,
James Martin,
David B. Wilson, and
Peter Winkler,
2011.
arXiv:1112.3304
Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z2,
by Richard W. Kenyon
and David B. Wilson, 2011.
arXiv:1107.3377
XOR-Ising loops and the Gaussian free field,
by David B. Wilson, 2011. arXiv:1102.3782
The dimension of loop-erased random walk in 3D,
by David B. Wilson. Physical Review E 82(6):062102, 2010.
Double-dimer pairings and skew Young diagrams,
by Richard W. Kenyon
and David B. Wilson.
Electronic Journal of Combinatorics 18(1) #P130, 2011.
Schramm's proof of Watts' formula,
by Scott Sheffield
and David B. Wilson.
Annals of Probability, 39(5):1844–1863, 2011.
Approach to criticality in sandpiles,
by Anne Fey,
Lionel Levine,
and David B. Wilson. Physical Review E 82, 031121, 2010. (Contains proofs of results announced in below PRL article.)
Driving sandpiles to criticality and beyond,
by Anne Fey,
Lionel Levine,
and David B. Wilson.
Physical Review Letters 104:145703, 2010.
Event-chain Monte Carlo algorithms for hard-sphere systems,
by Etienne P. Bernard,
Werner Krauth
and David B. Wilson.
Physical Review E 80, 056704, 2009.
Combinatorics of tripartite boundary connections for trees and dimers,
by Richard W. Kenyon
and David B. Wilson.
Electronic Journal of Combinatorics
16(1):R112, 2009.
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks,
by Omer Angel,
Abraham D. Flaxman,
and David B. Wilson.
Combinatorica 32(1):1–33, 2012.
“Coupling from the past,” by James G. Propp and David B. Wilson, Chapter 22 of the textbook “Markov Chains and Mixing Times,” by David A. Levin, Yuval Peres, and Elizabeth L. Wilmer, published by the American Mathematical Society, 2009. [download for free] [order from AMS]
Chip-firing and rotor-routing on directed graphs,
by
Alexander E. Holroyd,
Lionel Levine,
Karola Mészáros,
Yuval Peres,
James Propp,
and David B. Wilson.
In and Out of Equilibrium 2, eds. Vladas Sidoravicius and Maria Eulália Vares, “Progress in Probability” vol. 60, pages 331–364, Birkhäuser (2008).
Card shuffling and Diophantine approximation,
by Omer Angel,
Yuval Peres,
and David B. Wilson. Annals of Applied Probability, 18(3):1215–1231, 2008.
The electrical response matrix of a regular 2n-gon,
by Nathaniel D. Blair-Stahn
and David B. Wilson.
Proceedings of the American Mathematical Society 137(6):2015–2025, 2009.
Two-player Knock 'em Down,
by James A. Fill
and David B. Wilson. Electronic Journal of Probability, 9:198–212, 2008.
Conformal radii for conformal loop ensembles,
by Oded Schramm,
Scott Sheffield,
and David B. Wilson.
Communications in Mathematical Physics 288(1):43–53, 2009.
Boundary partitions in trees and dimers,
by Richard W. Kenyon
and David B. Wilson.
Transactions of the American Mathematical Society 363(3):1325–1364, 2011.
Tug-of-war and the infinity Laplacian,
by Yuval Peres,
Oded Schramm,
Scott Sheffield,
and David B. Wilson. Journal of the American Mathematical Society 22(1):167–210, 2009.
![[Hex]](hex.png)
Random-turn Hex and other selection games,
by Yuval Peres,
Oded Schramm,
Scott Sheffield,
and David B. Wilson.
American Mathematical Monthly, 114:373–387, May 2007.
SLE coordinate changes,
by
Oded Schramm,
and David B. Wilson.
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 David B. Wilson. In Proc. 37th ACM Symposium on Theory of Computing, pages 244–250, 2005.
Excited Random Walk,
by Itai Benjamini
and David B. Wilson.
Electronic Communications in Probability, 8:86–92, 2003.
Mixing Time of the Rudvalis Shuffle,
by David B. Wilson.
Electronic Communications in Probability, 8:77–85, 2003.
Winding angle variance of Fortuin-Kasteleyn contours,
by Benjamin Wieland
and David B. Wilson.
Physical Review E 68, 056101, 2003.
On the Red-Green-Blue Model,
by David B. Wilson.
Physical Review E 69, 037105, 2004.
Critical resonance in the non-intersecting lattice path model,
by Richard W. Kenyon
and David B. Wilson.
Probability Theory and Related Fields 130(3):289–318, 2004.
Mixing times of lozenge tiling and card shuffling Markov chains,
by David B. Wilson.
The Annals of Applied Probability, 14(1):274–325, 2004.
On the critical exponents of random k-SAT,
by David B. Wilson.
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 David B. Wilson.
Random Structures and Algorithms
18(3):201–256, 2001.
Diagonal Sums of Boxed Plane Partitions,
by David B. Wilson.
Electronic Journal of Combinatorics
8(1):N1, 2001.
Layered multishift coupling
for use in perfect sampling algorithms (with a primer on CFTP),
by David B. Wilson.
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 David B. Wilson.
Electronic Journal of Combinatorics,
7(1):R25, 2000.
How to Couple from the Past Using a Read-Once Source of Randomness,
by David B. Wilson.
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
David B. Wilson.
Random Structures and Algorithms 15(3&4):319–367, 1999.
Postscript.
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.
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.)
Some Free Software I've Written
Gallery of Pictures
Postscript pictures:
Information Resources
Software Sites
Interesting Links
Oded Schramm Memorial web site
Oded Schramm Memorial blog
Oded Schramm Memorial Workshop, August 30–31, 2009 at Microsoft Research
