|
Vu graduated at the Eötvös University, Budapest, in 1994, his M.Sc. thesis supervisor was Tamás Szőnyi. He received his Ph.D. at Yale University, in 1998 under the direction of László Lovász (another Polya prize winner).[1][3] He worked as a postdoc at IAS and Microsoft Research (1998-2001). He joined the University of California, San Diego as an assistant professor in 2001 and was promoted to full professor in 2005. In Fall 2005, he moved to Rutgers University and stayed there until he joined Yale in Fall 2011. Vu was a member at IAS on three occasions (1998, 2005, 2007), the last time (2007) as the leader of the special program Arithmetic Combinatorics [1] Contributions In 2010, Terence Tao and Vu solved the circular law conjecture. Awards and honors In 2012, Vu was awarded the Fulkerson Prize (jointly with Anders Johansson and Jeff Kahn) for determining the threshold of edge density above which a random graph can be covered by disjoint copies of a given smaller graph. Also in 2012, he became a fellow of the American Mathematical Society.[4] Van H. Vu (Vietnamese: Vũ Hà Văn) is a Vietnamese mathematician, Percey F. Smith Professor of Mathematics at Yale University,[1] and the 2008 winner of the Pólya Prize of the Society for Industrial and Applied Mathematics for his work on concentration of measure.[2] He is a collaborator of Terence Tao. |
About us|Jobs|Help|Disclaimer|Advertising services|Contact us|Sign in|Website map|Search|
GMT+8, 2015-9-11 21:23 , Processed in 0.129905 second(s), 16 queries .
