Continuous and discontinuous phase transitions in hypergraph processes. - R. W. R. Darling; David A. Levin; James R. Norris (Random Struct. Algorithms, 2004)

Identifying several biased coins encountered by a hidden random walk. - David A. Levin; Yuval Peres (Random Struct. Algorithms, 2004)

(1, -1)-Matrices with Near-Extremal Properties. - Warwick de Launey; David A. Levin (SIAM J. Discret. Math., 2009)

A Fourier-analytic approach to counting partial Hadamard matrices. - Warwick de Launey; David A. Levin (Cryptogr. Commun., 2010)

Pólya's Theorem on Random Walks via Pólya's Urn. - David A. Levin; Yuval Peres (Am. Math. Mon., 2010)

Mixing time estimation in reversible Markov chains from a single sample path. - Daniel J. Hsu; Aryeh Kontorovich; David A. Levin; Yuval Peres; Csaba Szepesvári (CoRR, 2017)

Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling. - David A. Levin; Yuval Peres (Am. Math. Mon., 2017)

Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings. - Sarah Cannon; David A. Levin; Alexandre Stauffer (Comb. Probab. Comput., 2019)

Fast mixing of a randomized shift-register Markov chain. - David A. Levin; Chandan Tankala (J. Appl. Probab., 2023)