جست‌وجوی استاد و پژوهشگر

• Machine Learning
• Probability
• Mathematical Physics
• +۶ مورد دیگر

Boris Hanin is an Associate Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE) and Associated Faculty at the Program in Applied and Computational Mathematics (PACM). Prior to Princeton, he held academic positions at Texas A&M University (Assistant Professor of Mathematics), MIT (NSF Postdoctoral Fellow), and Northwestern University (PhD in Mathematics under Steve Zelditch). He works part-time at Foundry, an AI/computing startup, leading the Foundry Institute. PhD in Mathematics, Northwestern University NSF Postdoctoral Fellowship, MIT Mathematics Associate Professor, Princeton ORFE Part-Time Leader, Foundry Institute His research spans machine learning, probability theory, and mathematical physics, focusing on neural network theory (approximation power, optimization guarantees), random matrix theory, and spectral asymptotics. He has made foundational contributions to understanding gradient behavior, initialization, and infinite-width limits in deep learning. Boris has supervised numerous PhD students and postdocs, with former members securing prestigious positions at Harvard, MIT, and Huawei. He serves as Associate Editor for journals like Pure and Applied Analysis and Mathematics of Operations Research , and has taught short courses at Oxford, Luxembourg, and Tor Vergata on statistical physics of neural networks and deep learning theory. 2024 Sloan Fellowship in Mathematics NSF CAREER grant DMS-2143754 NSF grant DMS-2133806 His research group collaborates on topics including hyperparameter transfer, architecture-aware scaling, and spectral analysis of random waves and neural networks. He actively contributes to theoretical machine learning through foundational publications in venues like Probability Theory and Related Fields , Journal of Machine Learning Research , and Communications in Mathematical Physics .

Chantal Davidمشاهده پروفایل

استاد

• Number Theory
• Elliptic Curves
• L-functions
• +۱ مورد دیگر

Chantal David is a Professor in the Department of Mathematics and Statistics at Concordia University. Her research focuses on number theory and its intersections with mathematical statistics. Formal Affiliation: Concordia University, Department of Mathematics and Statistics Email: chantal.david@concordia.ca Office: Library Building, LB 927.09 Research Interests revolve around Number Theory , particularly: L-functions and their non-vanishing properties Elliptic curves over finite fields and function fields Statistics of group structures and root numbers Connections to random matrix theory and metaplectic functions Extremal primes and Frobenius distributions Drinfeld modules and supersingular reductions Article Trends show a focus on cubic and quartic L-functions, non-vanishing phenomena, and statistical properties of elliptic curves over finite fields. Recent work explores metaplectic theta functions, extreme value distributions, and one-level density analysis. Labs & Teams : She is affiliated with the Montreal Number Theory Group (CICMA) .

Renjie Fengمشاهده پروفایل

پژوهشگر ارشد

• Probability Theory
• Random Matrix Theory
• Machine Learning
• +۵ مورد دیگر

Renjie Feng is a Research Fellow in Mathematics and AI at the School of Mathematics and Statistics and the Sydney Mathematical Research Institute , University of Sydney. His work bridges probability theory, statistics, and applications in machine learning, deep learning, and artificial intelligence. His research interests focus on probability theory and its applications to machine learning , random matrix theory , and statistical physics . He investigates extreme value problems, spectral properties of random matrices, and topological features of random fields over Riemannian manifolds. Recent publications highlight trends in random matrix theory (GUE, GOE, GSE), extreme gap problems , determinantal point processes , and Wiener chaos . Collaborative works with F. Götze, D. Yao, and R. Adler emphasize U-statistics , multivariate linear statistics , and random topology inspired by Poisson point process studies.

Lijie Chenمشاهده پروفایل

استادیار

• Theoretical Computer Science
• Computational Complexity Theory
• Quantum Complexity Theory
• +۴ مورد دیگر

Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.

Aleksandar Jeremicمشاهده پروفایل

دانشیار

• Biomedical Signal Processing
• Statistical Signal Processing
• Biometrics
• +۷ مورد دیگر

Aleksandar Jeremic is an Associate Professor in both the Electrical & Computer Engineering department and the McMaster School of Biomedical Engineering at McMaster University. His research focuses on biomedical signal processing, statistical signal processing, and biometrics, with applications in healthcare and biomedical systems. He holds a Dipl. Ing. from the University of Belgrade, and an M.S. and Ph.D. from the University of Illinois at Chicago. His expertise spans physiological signal analysis (e.g., ECG/EEG), medical imaging, and machine learning for biomedical applications. He has authored over 50 technical articles and two book chapters, and has been recognized with a teaching award from the McMaster Electrical and Computer Engineering Society (2018). He supervises graduate students in both theoretical and applied research areas. Dr. Jeremic teaches advanced courses such as Biomedical Signal Modeling and Processing and Advanced Probability and Random Processes , emphasizing practical applications of signal processing in healthcare. His work includes clinical implementations like neonatal seizure monitoring software and microwave imaging for breast cancer detection.

Kenneth McLaughlinمشاهده پروفایل

استاد

• Integrable Systems
• Mathematical Physics
• Nonlinear Dynamics
• +۳ مورد دیگر

Kenneth McLaughlin is the Evelyn and John G. Phillips Distinguished Chair in Mathematics at Tulane University's School of Science & Engineering. He holds a Ph.D. and B.A. in Mathematics from New York University (1994 and 1989). Prior to Tulane, he served as faculty at the University of North Carolina, Chapel Hill, the University of Arizona, Universidade Federal de Brasília, and Colorado State University, where he also held leadership roles as Department Head and Chair. His research focuses on integrability, applying techniques across mathematics to study complex systems and phenomena. He has held visiting positions at institutions worldwide, including France, Italy, Brazil, Belgium, and the UK. McLaughlin’s research spans integrable systems, nonlinear dynamics, and asymptotic analysis. His work often involves the Riemann-Hilbert problem approach, orthogonal polynomials, and random matrix theory. Notable contributions include studies on soliton gases, the KdV equation, and universality in quantum operator dynamics. His recent articles explore topics such as asymptotic behavior of polynomials, soliton gas condensation, and hydrodynamic limits in integrable systems. McLaughlin’s academic career is marked by interdisciplinary collaboration and international research engagement.

Grégoire Ithierمشاهده پروفایل

مدرس ارشد

• Quantum Engineering
• Quantum Decoherence
• Thermalization
• +۳ مورد دیگر

Grégoire Ithier is a Senior Lecturer in Physics at the Department of Physics, Royal Holloway, University of London. His research focuses on quantum engineering, decoherence, thermalization, mesoscopic physics, and random matrix theory. He leads the 'TypDyn' project exploring typical dynamics of embedded quantum systems, and co-leads the Leverhulme Trust-funded 'Generation and detection of quantum signals' initiative. His work bridges theoretical and experimental domains, including superconducting circuits and cryogenic microwave engineering. Ithier's research tools include advanced numerical methods (e.g., exact diagonalization) and statistical techniques (e.g., random matrix theory). Key Projects: TypDyn: Studies typical dynamics in embedded quantum systems (2015–present) QSimFP: Quantum simulators for fundamental physics (2020–2024) A new statistical theory of disordered quantum systems (2020–2024) His experimental work involves superconducting qubits, Josephson devices, and nano-superfluidic cavities. Grants include STFC and Leverhulme Trust funding. Recent publications address quantum thermalization, many-body systems, and random Hamiltonian analysis.

Afonso S. Bandeiraمشاهده پروفایل

استاد

• High Dimensional Probability
• Random Matrices
• Mathematical Statistics
• +۳ مورد دیگر

Afonso S. Bandeira is a Professor in the Department of Mathematics (D-MATH) at ETH Zurich, where he conducts research at the intersection of mathematics, statistics, and computer science. He maintains strong affiliations with several interdisciplinary research centers including the Institute For Operations Research (IFOR), the Max Planck ETH Center for Learning Systems, the ETH Foundations of Data Science, and the ETH AI Center, with a courtesy appointment at D-ITET. Bandeira actively teaches courses including Mathematics of Signals, Networks, and Learning, and Mathematics of Data Science. His research focuses on High Dimensional Probability, Random Matrices, Mathematical Statistics, Theoretical Computer Science, Combinatorics, and Mathematical Optimization. Bandeira's work often explores the theoretical foundations of data science, examining phase transitions in statistical problems, computational barriers, and the geometry of high-dimensional spaces. He maintains a research group blog called Randomstrasse101 that emphasizes open problems in his field. Analysis of his recent publications reveals a strong focus on matrix and tensor concentration inequalities, synchronization problems, nonconvex optimization landscapes, and computational-statistical tradeoffs in high-dimensional inference. His work bridges theoretical mathematics with practical applications in machine learning and data analysis, particularly examining where computational limitations arise in statistical problems. Bandeira actively mentors students and researchers, currently supervising several doctoral candidates including Daniil Dmitriev, Konstantin Donhauser, Anastasia Kireeva, Kevin Lucca, Chiara Meroni, Gil Kur, Petar Nizic-Nikolac, and Almut Roedder. He emphasizes that students working with him should participate in the DACO seminar and group meetings, and encourages prospective students to have completed his Mathematics of Signals, Networks, and Learning or Mathematics of Data Science courses. He leads a research group focused on the mathematics of data science, with regular group meetings and seminars. Bandeira has developed comprehensive lecture notes including 'A Tour Through the Mathematics of Signals, Learning, and Networks' (2025) and 'Mathematics of Machine Learning' (2021), and previously authored 'Ten Lectures and Forty-Two Open Problems in the Mathematics of Data Science' (2015).

Shirshendu Gangulyمشاهده پروفایل

دانشیار

• Probability Theory
• Statistical Mechanics
• Markov Chains
• +۳ مورد دیگر

Shirshendu Ganguly is an Associate Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on probability theory, statistical physics, and their applications, including percolation models, phase transitions, Markov chains, and random graphs. He holds a PhD in Mathematics from the University of Washington and has held postdoctoral positions at UC Berkeley. Ganguly has been recognized with the 2019 Sloan Research Fellowship. Education: PhD in Mathematics, University of Washington, 2011–2016 Miller Postdoctoral Fellow, UC Berkeley, 2016–2018 Research Interests: Probability Theory, Statistical Mechanics, Markov Chains, Random Graphs, Percolation Theory, Sparse Combinatorial Structures His work explores geometric and probabilistic phenomena in disordered systems, including polymer models, self-organized criticality, and random matrix theory. He has advised multiple PhD students and contributes to teaching advanced probability courses at Berkeley. Awards: 2019 Sloan Research Fellowship

Asaf Ferberمشاهده پروفایل

استادیار

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +۱ مورد دیگر

Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.

Daniel A. Spielmanمشاهده پروفایل

استاد

• Spectral Graph Theory
• Algebraic Graph Theory
• Laplacian Matrices
• +۷ مورد دیگر

Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.

Jonathan A. Kelnerمشاهده پروفایل

استاد

• Algorithms
• Spectral Graph Theory
• Combinatorial Optimization
• +۷ مورد دیگر

Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.

Kurt Johanssonمشاهده پروفایل

استاد

• Probability Theory
• Mathematical Physics
• Random Matrix Theory

Kurt Johansson is a Full Professor of Mathematics at KTH Royal Institute of Technology, Sweden. His academic journey includes roles as Associate Professor at KTH (1993-2001) and Uppsala University (1988-1993), alongside research funded by the Swedish Natural Science Research Council (1998-2003). His primary affiliations are within the Department of Probability, Mathematical Physics & Statistics at KTH, where he also coordinates courses on Differential Equations and Fourier Analysis. Education: BSc in Physics (1982) and PhD in Mathematics (1988), both from Uppsala University. Research interests focus on Probability Theory , Mathematical Physics , and Random Matrix Theory , with contributions to stochastic models, determinantal processes, and universality in statistical mechanics. Key Awards: Wallenberg Prize (1995), Rollo Davidson Prize (2000), Göran Gustafsson Prize (2002), Fellow of the American Mathematical Society (2012), and multiple Wallenberg Scholar grants (2011-2023). Grants: Major funding from the Swedish Research Council (VR), K&A Wallenberg Foundation, and others. His research group explores Random Matrices, Stochastic Models, and Analysis , with notable work on the Arctic Circle Theorem and KPZ universality class. Recent publications analyze Brownian directed percolation and domino tilings of the Aztec diamond, reflecting his focus on interdisciplinary applications of probability and mathematical physics.

• Mathematical Physics
• Number Theory
• Stochastic Analysis
• +۱ مورد دیگر

Jon Keating is a Professor at the University of Oxford affiliated with the Mathematical Institute . His research spans Mathematical Physics , Number Theory , and Stochastic Analysis , with a focus on Random Matrix Theory and its applications to quantum systems and number theory. Research Trends: His recent work explores connections between random matrices and number-theoretic functions, with contributions to understanding moments of L-functions, characteristic polynomials, and quantum chaos. Key themes include asymptotic analysis, recursive structures, and interdisciplinary applications in nonlinear systems. Publications: Highlights include studies on CUE characteristic polynomials, the Ratios Conjecture, and collaborations in Nonlinearity , International Mathematics Research Notices , and Transactions of the American Mathematical Society .

Ivan Dokmanicمشاهده پروفایل

استادیار

• Machine Learning
• Signal Processing
• Inverse Problems
• +۱۱ مورد دیگر

Ivan Dokmanic is an Assistant Professor at the Coordinated Science Laboratory (CSL) within the University of Illinois . His research bridges signal processing , machine learning , and applied inverse problems , with a focus on acoustics, biomedical imaging, and distance geometry. Current Role : Assistant Professor, CSL Email : dokmanic@illinois.edu Research Interests : Dokmanic explores machine learning applications in inverse problems , particularly distance geometry for molecular imaging and acoustics . His work includes unlabeled sensing , where distances between points are known but their arrangement is not. This has implications for powder diffraction , indoor localization , and echo modeling . Article Trends : His recent publications emphasize distance geometry in machine learning , acoustic signal processing , and inverse problem theory . Key areas include molecular imaging , audio encryption , and sensor positioning . Collaborative work spans medical imaging , cyberphysical systems , and geometric invariants . 2016 Google Faculty Award NSF Grant (1 year, $157,079) Students and Grants : Dokmanic mentors PhD students like Puoya, Shuai, and Anadi. His research is funded by the National Science Foundation , Google , VISA , and nVidia .