معرفی
Allon Percus is the Joseph H. Pengilly Professor of Mathematics at the Institute of Mathematical Sciences at Claremont Graduate University, part of the Claremont Colleges. He holds a B.A. in Physics from Harvard University (1992) and a Ph.D. in Theoretical Physics from Université Paris-Sud (1997). His career includes roles as Associate Director of UCLA's Institute for Pure and Applied Mathematics (IPAM, 2003–2006) and technical staff member at Los Alamos National Laboratory (LANL). Percus specializes in discrete optimization, statistical physics, and network models, with applications to quantum algorithms, fracture networks, and computational complexity. He co-developed the Extremal Optimization method, widely applied in interdisciplinary fields like social networks and protein folding. His research has been funded by NSF, DOE, and others. Percus organizes conferences on combinatorics and computational complexity and teaches courses in scientific computing, discrete mathematical modeling, and statistical mechanics.
Education:
- B.A. Physics, Harvard University, 1992
- Ph.D. Theoretical Physics, Université Paris-Sud, Orsay, 1997
Research Interests:
- Discrete optimization and algorithm performance analysis
- Statistical physics models for combinatorial problems
- Random network structures and real-world data modeling
- Interdisciplinary applications in quantum computing and geology
Recent work emphasizes machine learning for fracture network analysis and affective polarization dynamics in social networks. His publications span computational materials science, graph theory, and epidemic diffusion modeling.
Awards and Grants include major funding from the Air Force Office of Scientific Research, National Science Foundation, and Department of Energy. He has led interdisciplinary teams at LANL and organized IPAM programs fostering cross-disciplinary collaboration between mathematicians and scientists.
Labs/Teams: Part of Claremont’s Institute of Mathematical Sciences and collaborates with LANL teams on computational projects. Active in organizing conferences bridging combinatorics and computational complexity fields.
