| Exact sampling with coupled Markov chains and applications to statistical mechanics JG Propp, DB Wilson Random Structures & Algorithms 9 (1‐2), 223-252, 1996 | 1507 | 1996 |
| Generating random spanning trees more quickly than the cover time DB Wilson Proceedings of the twenty-eighth annual ACM symposium on Theory of computing …, 1996 | 470 | 1996 |
| Fast exponentiation with precomputation EF Brickell, DM Gordon, KS McCurley, DB Wilson Workshop on the Theory and Application of of Cryptographic Techniques, 200-207, 1992 | 400 | 1992 |
| Tug-of-war and the infinity Laplacian Y Peres, O Schramm, S Sheffield, D Wilson Journal of the American Mathematical Society 22 (1), 167-210, 2009 | 393 | 2009 |
| Mixing times of lozenge tiling and card shuffling Markov chains DB Wilson Annals of Applied Probability 14 (1), 274-325, 2004 | 246 | 2004 |
| How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph JG Propp, DB Wilson Journal of Algorithms 27 (2), 170-217, 1998 | 240 | 1998 |
| The scaling window of the 2‐SAT transition B Bollobás, C Borgs, JT Chayes, JH Kim, DB Wilson Random Structures & Algorithms 18 (3), 201-256, 2001 | 230 | 2001 |
| Chip-firing and rotor-routing on directed graphs AE Holroyd, L Levine, K Mészáros, Y Peres, J Propp, DB Wilson In and out of equilibrium 2, 331-364, 2008 | 215 | 2008 |
| Event-chain Monte Carlo algorithms for hard-sphere systems EP Bernard, W Krauth, DB Wilson Physical Review-Section E-Statistical Nonlinear and Soft Matter Physics 25 …, 2010 | 148 | 2010 |
| Trees and matchings RW Kenyon, JG Propp, DB Wilson arXiv preprint math/9903025, 1999 | 140 | 1999 |
| How to couple from the past using a read‐once source of randomness DB Wilson Random Structures & Algorithms 16 (1), 85-113, 2000 | 135 | 2000 |
| SLE coordinate changes O Schramm, DB Wilson arXiv preprint math/0505368, 2005 | 129 | 2005 |
| Excited random walk I Benjamini, D Wilson Electronic Communications in Probability 8, 86-92, 2003 | 114 | 2003 |
| Coupling from the past: a user’s guide J Propp, D Wilson Microsurveys in discrete probability 41, 181-192, 1998 | 109 | 1998 |
| Scaling limits for minimal and random spanning trees in two dimensions M Aizenman, A Burchard, CM Newman, DB Wilson Arxiv preprint math/9809145, 1998 | 87 | 1998 |
| Conformal radii for conformal loop ensembles O Schramm, S Sheffield, DB Wilson Communications in Mathematical Physics 288 (1), 43-53, 2009 | 62 | 2009 |
| Layered multishift coupling for use in perfect sampling algorithms (with a primer on CFTP) DB Wilson Monte Carlo Methods 26, 141-176, 2000 | 62 | 2000 |
| Boundary partitions in trees and dimers RW Kenyon, DB Wilson Trans. Amer. Math. Soc 363 (3), 1325-1364, 2011 | 56 | 2011 |
| Winding angle variance of Fortuin-Kasteleyn contours B Wieland, DB Wilson Physical Review E 68 (5), 056101, 2003 | 55 | 2003 |
| The martini synch D Kirovski, M Sinclair, D Wilson tech. rep., Technical report MSR-TR-2007-123, Microsoft Research, 2007 | 51* | 2007 |
Scott SheffieldProfessor of Mathematics, MITVerified email at math.mit.edu
