LLMpediaThe first transparent, open encyclopedia generated by LLMs

Van H. Vu

Generated by GPT-5-mini
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Parent: Probability theory Hop 4
Expansion Funnel Raw 68 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted68
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
Van H. Vu
NameVan H. Vu
Birth date1970
Birth placeHanoi, Vietnam
FieldsMathematics, Combinatorics, Probability, Random Matrix Theory
Alma materÉcole Polytechnique, Pierre and Marie Curie University, Rutgers University
Doctoral advisorLászló Lovász
WorkplacesUniversity of California, San Diego, Yale University, Columbia University, Princeton University, Institute for Advanced Study, Rutgers University
Known forInverse Littlewood–Offord theory, random matrices, concentration inequalities
AwardsRolf Nevanlinna Prize, Salem Prize, Fulkerson Prize

Van H. Vu is a mathematician known for work in combinatorics, probability theory, and random matrix theory. He has held positions at major institutions including Rutgers University, Princeton University, and the Institute for Advanced Study, and has received international recognition such as the Rolf Nevanlinna Prize and the Salem Prize. Vu's research connects problems in additive number theory, theoretical computer science, and statistical physics.

Early life and education

Vu was born in Hanoi and completed early studies in Vietnam before moving to France and the United States for higher education, attending École Polytechnique and Pierre and Marie Curie University and later earning a Ph.D. under László Lovász at Rutgers University. During his formative years he engaged with problems linked to Paul Erdős-style combinatorics and techniques related to Probabilistic Method pioneers such as Alon, Spencer, and Erdős. His doctoral work situated him within networks involving researchers at Bell Labs-adjacent groups, collaborations with scholars at Microsoft Research, and exchanges with faculty at Stanford University and University of California, Berkeley.

Academic career and positions

Vu has held faculty and visiting positions at institutions across North America and Europe, including appointments at Princeton University, a visiting membership at the Institute for Advanced Study, professorships at Rutgers University and Yale University, and a faculty position at Columbia University before moving to University of California, San Diego. He has been a regular participant in programs at the Mathematical Sciences Research Institute, the Simons Institute, and the Institut des Hautes Études Scientifiques, and has delivered invited lectures at venues such as the International Congress of Mathematicians, the European Congress of Mathematics, and workshops at CIRM. Vu has served on editorial boards of journals linked to American Mathematical Society, Cambridge University Press, and has been involved with grant panels for agencies like the National Science Foundation and foundations such as the Simons Foundation.

Research contributions and notable results

Vu developed the inverse Littlewood–Offord theory alongside researchers including Tao and others, resolving problems initiated by J. E. Littlewood and A. C. Offord and connecting to classical questions of Paul Erdős in additive combinatorics. His work on singularity of random Bernoulli matrices advanced conjectures related to the Circular Law, the Universality Principle in random matrix ensembles, and problems framed by Erdős and Komlós. Vu proved sharp concentration inequalities and small-ball probability estimates that built on methods from Talagrand, Ledoux, and McDiarmid, and he applied these to spectral gap questions tied to Wigner matrices, Wishart ensembles, and adjacency matrices of random graphs studied in the tradition of Erdős–Rényi. Collaborations with mathematicians such as Terence Tao, Mei-Chu Chang, Kannan, and Rudelson led to breakthroughs in inverse problems, additive structure classification, and estimates for condition numbers that influenced algorithms in theoretical computer science and complexity perspectives related to P versus NP-adjacent inquiries. Vu's cross-disciplinary influence touches work by researchers at Google Research, IBM Research, and groups in statistical physics studying spin glass models related to the Sherrington–Kirkpatrick model.

Awards and honors

Vu's honors include the Rolf Nevanlinna Prize, the Salem Prize, the Fulkerson Prize, and fellowships or memberships in societies such as the American Mathematical Society and invitations to the International Congress of Mathematicians. He has received research grants from the National Science Foundation, fellowships from the Simons Foundation, and prizes awarded by mathematical societies in France and the United States. Vu has delivered plenary and invited addresses at meetings organized by the American Mathematical Society, the European Mathematical Society, and the Society for Industrial and Applied Mathematics.

Selected publications and books

- Vu, with collaborators including Terence Tao and Mei-Chu Chang, on inverse Littlewood–Offord and additive combinatorics results appearing in leading journals such as those published by the American Mathematical Society and Elsevier. - Monographs and survey articles by Vu on random matrices, concentration inequalities, and combinatorial number theory distributed through publishers like Cambridge University Press and as lecture notes for programs at the Mathematical Sciences Research Institute and Institut Henri Poincaré. - Influential papers addressing singularity of random matrices, condition number bounds, and universality for spectral distributions that cite and build on works by Wigner, Tracy–Widom, Bai, and Soshnikov.

Category:Vietnamese mathematicians Category:Combinatorialists