Allan SlyUniversity of California, Berkeley |
I'm an assistant professor in the Department of Statistics at UC Berkeley. Previously I was a postdoc in the Theory Group at Microsoft Research and a PhD student at Berkeley under the supervision of Elchanan Mossel.
This semester I will be teaching Stat 150 Stochastic Processes and Stat 204 Applied Probability.
My research is in discrete probability theory and its applications to problems from statistical physics, theoretical computer science and theoretical statistics. Most of my work is centered on stochastic processes on networks in a range of different setting. Two major focuses are the analysis of the mixing times of Markov chains, particularly the Glauber dynamics and the role phase transitions play in the computational complexity. |
Selected WorksA complete list of publications and preprints is given here.Glauber Dynamics for the Ising Model Cutoff for the Ising model on the lattice (with E. Lubetzky) Inventiones mathematicae, 191 (2013) 719--755. Arxiv Critical Ising on the square lattice mixes in polynomial time (with E. Lubetzky) Communications in Mathematical Physics 313 (2013) 815--836. Arxiv In these two papers we study the Glauber Dynamics Markov chain on the lattice. In two dimensions at high temperatures we established the cutoff phenomena a sharp transition of the dynamics from unmixed to mixed over a much smaller window of time than the mixing time. Recently, using a new tool we developed called information percolation, we have extended cutoff to the high temperature regime in all dimensions and at high enough temperatures on any graph. At the critical temperature the mixing time is expected to undergo a critical slowdown and become polynomial in the size of the system. We established a polynomial upper bound for the 2D Ising model combining multi-scale techniques for the Markov chains of spin systems with new results from the world of SLE. Computational Phase Transitions Computational Transition at the Uniqueness Threshold Proceedings of IEEE Symposium on Foundations of Computer, 287-296 (2010). Co-winner of the best paper award. Arxiv. This result, combined with work of Dror Weitz, gave the first example showing a computational threshold that is determined by the phase transition of a statistical physics model. Specifically we showed that in it is NP-hard to sample from the hardcore model on d-regular graphs when there is non-uniqueness for d-regular tree (and it is close enough to the threshold). One consequence is that it is NP-hard to approximately count independent sets on 6-regular graphs. With Nike Sun we extended this work to all anti-ferromagnetic two-spin systems. Together with results of Jerrum--Sinclair, Weitz, and Sinclair--Srivastava--Thurley, this gives an almost complete classification of the computational complexity of approximating the partition function in two-spin systems on bounded-degree graphs. The Sparse Stochastic Block Model A Proof Of The Block Model Threshold Conjecture (with E. Mossel and J. Neeman) Submitted Arxiv The stochastic block model is a classical random graph model containing a community structure. A conjecture of Decelle, Krzkala, Moore and Zdeborova based on ideas from statistical physics, gave a precise prediction for the threshold at which it is possible to recover (approximately) the clusters in the sparse stochastic block model. They conjectured that it corresponded to a spatial mixing threshold for the Ising model on a tree, the reconstruction threshold. In a series of work with Mossel and Neeman we established this conjecture finding efficient algorithms which succeed up to the predicted threshold. We also determined the optimal possible clustering and the point at which exact recovery of the clusters is possible. Random Constraint Satisfaction Problems Maximum independent sets on random regular graphs (with J. Ding and N. Sun) Submitted. Arxiv Predictions from statistical physics give precise estimates of the satisfiability thresholds in a broad class of random constraint satisfaction problems based on relica symmetry breaking arguments. With Ding and Sun we rigorously established such a threshold determining that the asymptotic size of the largest independent set of a random regular graph is given by the 1-step replica symmetry breaking prediction. Our method relied on giving a combinatorial description of clusters of solutions based on survey propagation messages to count clusters of solutions and showed that it is highly concentrated with fluctuations of a constant order. The Slow Bond Problem Last Passage Percolation with a Defect Line and the Solution of the Slow Bond Problem (with R. Basu and Vladas Sidoravicius) Submitted. Arxiv The one dimensional totally asymmetric simple exclusion process (TASEP) is exactly solvable in the KPZ universality class and has been extensively studied with the current and its fluctuations well understood using powerful algebraic tools. When the rate of a single bond is perturbed, however, these methods are no longer applicable. In TASEP with step initial conditions, Janowsky and Lebowitz asked if any reduction in the jump rate of a bond was enough to reduce the long run asymptotic rate at which particles cross the origin. In this paper we found a more geometric approach establishing the conjecture. |