معرفی
Louis Theran is a Lecturer in Mathematics at the University of St Andrews, School of Mathematics and Statistics. His research bridges geometry, combinatorics, and algorithmic problems, with applications in physics, materials, and machine learning.
Education:
- Ph.D. in Computer Science, University of Massachusetts, Amherst (2010)
- M.S. in Computer Science, University of Massachusetts, Amherst (2007)
- B.S. in Computer Science and Mathematics, University of Massachusetts, Amherst (2006)
Theran’s research focuses on the rigidity theory of frameworks, exploring how geometric and combinatorial properties determine structural stability. He investigates discrete geometry, sparse hypergraphs, and pebble game algorithms, connecting these to machine learning (e.g., low-rank matrix completion) and materials science (e.g., auxetic metamaterials, sticky disks).
His recent work analyzes rigidity transitions in random graphs, universal rigidity in one-dimensional frameworks, and maximum likelihood thresholds via graph rigidity. Collaborations span computational geometry, algebraic statistics, and physics, emphasizing interdisciplinary applications.
Scientific Awards:
- Heilbronn small grants scheme (2021)
- NSF/KOSEF East Asia and Pacific Summer Institutes Fellowship (2006)
Theran has supervised numerous BSc, MMath, and PhD projects, including topics like tensegrities, graphons, and geometric constraint systems. He has also contributed to Gaussian graphical models and universality theorems for Delaunay triangulations.
