Asaf Nachmias' Home Page
I am a post-doc researcher at the theory group of Microsoft research.
I obtained my Ph.D. in Mathematics at U.C. Berkeley under the supervision of
of Prof. Yuval Peres .
My research interests are probability theory and statistical physics. I focus on percolation, random walks
and mixing time of Markov chains.
Curriculum Vitae
pdf, ps.
I used to teach
Stat 155: Game Theory , Spring 2007.
Papers
-
Colouring powers of cycles from random lists (with
M. Krivelevich ), European J. of Combinatorics 25 (2004), 961-968.
-
Colouring complete bipartite graphs from random lists (with
M. Krivelevich ), Random Structures and Algorithms 29, 4 (2006), 436-449.
- The critical random graph, with martingales. (with Y. Peres ), Israel Journal of Math, to appear.
- Component sizes of the random graph outside the scaling window (with Y. Peres ), Latin American Journal of Probability and Mathematical Statistics (ALEA), 3, 133-142 (2007). .
- Critical random graphs: diameter and mixing time (with Y. Peres ), Annals of Probability, 36, no. 4, 1267-1286. .
- Critical percolation on random regular graphs (with Y. Peres ), Random Structures and Algorithms, to appear.
- Mixing time power laws at criticality , (with Yun Long and Y. Peres ), Proc. of the 48th IEEE FOCS (2007).
- Mean-field conditions for percolation on finite
graphs , Geometric and Functional Analysis (GAFA) , to appear.
- Testing the expansion of a graph (with Asaf Shapira) , submitted .
- The Alexander-Orbach conjecture holds in high dimensions (with Gady Kozma ), Inventiones Mathematicae , to appear.
- Is the critical percolation probability local?
(with Itai Benjamini and Y. Peres), Probability Theory and Related Fields, to appear.
Contact information
Theory Group, Microsoft Research
One Microsoft Way, Redmond, WA 98052
Email: a s a f n -at- m i c r o s o f t -dot- c o m