Ghaith Hiary is a Professor and Vice Chair for Graduate Recruitment in the Department of Mathematics at The Ohio State University. He holds a PhD from the University of Minnesota (2008). His research focuses on computational and analytic number theory, with emphasis on the Riemann zeta function, L-functions, random matrix theory, and asymptotic analysis. Hiary's work bridges theoretical mathematics and high-performance computation. He develops efficient algorithms (e.g., amortized-complexity methods) to evaluate zeta functions at extreme heights (e.g., near t=10 28 ), implemented in C++/Mathematica. His research uses random matrix models to study zeta-function moments and employs techniques like van der Corput estimates and hybrid methods for explicit bounds. His publications demonstrate consistent focus on zeta-function computations, factorization algorithms, and arithmetic biases. Recent work (2022-2025) explores invariant measures, Lehman's method generalizations, and sign changes in random multiplicative functions, maintaining strong ties to analytic and probabilistic number theory. Hiary shares code and datasets via GitHub, including implementations of T 1/3 algorithms for zeta computations. He collaborates with institutions like the University of Waterloo and maintains numerical databases of zeta zeros.
Alexander R. Pruss is a tenured Professor in the Department of Philosophy at Baylor University , within the College of Arts and Sciences . He holds a dual PhD in Philosophy (University of Pittsburgh, 2001) and Mathematics (University of British Columbia, 1996), and has held previous academic positions at Georgetown University. His work is deeply interdisciplinary, bridging metaphysics, philosophy of religion, formal epistemology, and ethics. Education: Ph.D. in Philosophy, University of Pittsburgh (2001) Ph.D. in Mathematics, University of British Columbia (1996) B.Sc. (Hon.) in Mathematics and Physics, University of Western Ontario (1991) Pruss’s research interests include metaphysics—particularly the Principle of Sufficient Reason , modality , and infinity —philosophy of religion, divine attributes , cosmological arguments , and sexual ethics . He is known for integrating rigorous formal methods with classical theistic metaphysics. His recent publications explore the intersection of probability theory, paradox, and theology, particularly in infinite domains. He has authored influential books such as The Principle of Sufficient Reason: A Reassessment (2006), Infinity, Causation and Paradox (2018), and One Body: An Essay in Christian Sexual Ethics (2012). The trends in his recent articles show a sustained focus on the philosophical implications of infinity, symmetry, and probability. He frequently investigates paradoxes in probability (e.g., infinite lotteries), challenges to modal realism, and the metaphysical coherence of divine attributes. His work combines analytic rigor with theological depth, often aiming to defend classical theism through logical and mathematical reasoning. Scientific awards and honors: Aquinas Medal, American Catholic Philosophical Association (2025) Wilde Lecturer, Oriel College, University of Oxford (2019) Outstanding Tenured Faculty Research Award, College of Arts and Sciences (2013) National Endowment for the Humanities Summer Stipend (2002) Social Sciences and Humanities Research Council of Canada Fellowship (1997–2000) Pruss has been actively involved in academic service, including serving on the Executive Council of the American Catholic Philosophical Association (2021–2024) and the Society of Christian Philosophers (2011–2013) . He has held editorial roles for journals such as American Philosophical Quarterly and Analysis and Existence . He has delivered numerous invited lectures globally, including at Oxford, Notre Dame, and MIT. There is no mention of formal PhD or Master’s students in the provided text, but he advises through graduate seminars and research supervision. He has not received specific grant mentions beyond fellowships and stipends. He is affiliated with research groups such as the Baylor Institute for Faith and Learning and the Thomistic Institute , and contributes to philosophy of science and theology dialogues. His work continues to shape contemporary debates in analytic philosophy of religion and metaphysics.
Shantanu Dutt is a full Professor in the Department of Electrical and Computer Engineering at the University of Illinois at Chicago , located in Chicago, IL. His office is in 930 SEO at 851 S. Morgan St, and he can be reached at dutt@uic.edu . Education Ph.D. in Computer Science and Engineering, University of Michigan, Ann Arbor (1990) M.Tech. in Computer Engineering, Indian Institute of Technology Kharagpur (1984) B.E. in Electronics and Communication Engineering, Maharaja Sayajirao University of Baroda (1983) Research Interests Professor Dutt’s research agenda centers on VLSI Computer-Aided Design (CAD) , with particular emphasis on physical design and incremental synthesis targeting both ASICs and FPGAs. He explores discrete optimization techniques to solve placement, routing, and partitioning problems. Another major thrust is FPGA built-in self-test (BIST) and trusted design , ensuring provable diagnosability and security against hardware Trojans. He also investigates fault-tolerant computing at both chip and system levels, and develops parallel and distributed computing algorithms for scalable performance. Scientific Awards 1996 Best Paper Award , ACM/IEEE Design Automation Conference, for “A probability-based approach to VLSI circuit partitioning” 1995 Most Influential Paper Award , Fault-Tolerant Computing Symposium, for “Design and reconfiguration strategies for near-optimal k-fault-tolerant tree architectures” Research Impact and Funding Professor Dutt has published extensively in top-tier journals (IEEE TVLSI, ACM TRETS, IEEE TCAD) and premier conferences (ICCAD, DAC, DATE, FTCS). His work has shaped incremental placement, timing-driven routing, FPGA security, and fault-tolerant multiprocessor architectures. While specific grant numbers are not listed, the breadth and longevity of his publication record indicate sustained funding from NSF, industry, and other agencies. Laboratory and Collaborations Although no formal laboratory name is provided, Professor Dutt’s research is conducted within the ECE department’s VLSI CAD and Fault-Tolerance groups, collaborating with graduate students and colleagues across the US and internationally.
Nathan (Nati) Linial is a Professor at the School of Computer Science and Engineering at the Hebrew University of Jerusalem, where he has been a faculty member since completing his postdoctoral period at UCLA. He earned his undergraduate degree in mathematics from the Technion and his PhD in graph theory from the Hebrew University. His research spans multiple areas of theoretical computer science and mathematics, with primary focus on combinatorics, theoretical computer science, and bioinformatics. Linial's work has made significant contributions to high-dimensional combinatorics, expander graphs, metric embeddings, and computational molecular biology. His research often bridges geometry, analysis, and combinatorial structures, demonstrating deep connections between seemingly disparate mathematical fields. Linial's recent publications reveal a strong trend toward high-dimensional combinatorial structures, including simplicial complexes, hypertrees, and high-dimensional permutations. His work frequently employs probabilistic methods, linear programming techniques, and geometric approaches to solve fundamental combinatorial problems. The breadth of his research is evident in both pure mathematical contributions and applications to computational biology. Fellow of the American Mathematical Society ISI Highly Cited Researcher Conant Prize (2008) for the influential survey paper "Expander graphs and their applications" Linial has served on the editorial boards of several prestigious journals including the Israel Journal of Mathematics (as Chief Editor 2013-2017), Random Structures and Algorithms, and Combinatorica. His academic leadership extends to organizing conferences and workshops in combinatorics and theoretical computer science. He has mentored numerous students whose work spans theoretical computer science, combinatorics, and computational biology. Linial is associated with research projects including ProtoNet (for protein sequence classification) and EVEREST (for evolutionary conserved protein domains), demonstrating his commitment to interdisciplinary research that bridges computer science with molecular biology.
Professor Alexander Scott is a faculty member at the University of Oxford, holding positions as Professor of Mathematics and Dominic Welsh Tutor in Mathematics at Merton College. His research focuses on combinatorics, probability, algorithms, and graph theory, with a particular interest in the interplay between local and global structures in networks. He has organized the Oxford Combinatorics Seminar and co-founded the online Oxford Discrete Mathematics and Probability Seminar, fostering collaboration in these fields. Professor Scott’s work bridges theoretical foundations with applications in statistical physics and algorithmic design. He has supervised numerous graduate students in combinatorics and regularly teaches undergraduate courses in analysis and discrete mathematics. His contributions include advancements in extremal graph theory, probabilistic methods, and structural combinatorics, with over 150 publications in prestigious journals. He actively organizes academic events such as the annual One-Day Meeting in Combinatorics, hosting speakers from around the world. Despite the absence of explicit awards noted, his prolific research output and academic leadership reflect significant contributions to the field. His current interests continue to explore the Erdős-Hajnal conjecture, induced subgraph densities, and algorithmic challenges in combinatorial structures.
Ben Green is the Waynflete Professor of Pure Mathematics at the University of Oxford and a Fellow of Magdalen College. His work spans additive combinatorics, analytic number theory, harmonic analysis, ergodic theory, discrete geometry, and group theory, with a focus on interdisciplinary approaches. Research Interests: Additive combinatorics and its applications to primes Analytic number theory (prime distribution, L-functions) Harmonic analysis (Fourier methods, spectral theory) Ergodic theory and its combinatorial applications Discrete geometry (ordinary lines, convex structures) Group theory (approximate groups, expansion) Article Trends: His recent work emphasizes multiplicative functions, Ramsey-type problems in number theory, expansion in finite groups, and extremal set theory. Themes include prime gaps, arithmetic progressions, and interactions between analysis and algebra. Scientific Awards: Clay Research Award (2004) Ostrowski Prize (2005) Whitehead Prize (2005) Leverhulme Prize (2007) European Mathematical Society Prize (2008) Royal Society Fellow (2010) Sylvester Medal (2014) Senior Whitehead Prize (2019) Advising: Ben has supervised numerous D.Phil students across additive combinatorics, analytic number theory, and related fields. Past students hold postdoctoral and academic positions globally.
Béla Bollobás is a renowned mathematician affiliated with the University of Memphis as the Jabie Hardin Chair of Excellence in Combinatorics and the University of Cambridge as a Fellow of Trinity College and Honorary Professor at the Centre for Mathematical Sciences. His work spans combinatorics, probability theory, and graph theory, with significant contributions to percolation and random graphs. Dr. Rer. Nat. (Budapest, 1967) Ph.D. (Cambridge, 1972) Sc.D. (Cambridge, 1984) Bollobás pioneered extremal graph theory, random graphs, and probabilistic combinatorics. He introduced novel graph polynomials and advanced bootstrap percolation models, impacting both theoretical mathematics and statistical physics. His research includes inhomogeneous random graphs and cellular automata in random environments. His selected publications reveal a focus on percolation thresholds, graph invariants, and stochastic processes. Notably, he derived sharp thresholds for bootstrap percolation and defined critical probabilities for Voronoi percolation. Senior Whitehead Prize (2007) Fellow of the Royal Society (2011) Foreign Member, Hungarian Academy of Sciences (1990) Foreign Member, Polish Academy of Sciences (2013) Honorary Doctorate, Adam Mickiewicz University (2013) Szechenyi Prize (2017) Bollobás has supervised over 50 Ph.D. students and authored over 450 publications, including 10 books. He co-founded the journal Combinatorics, Probability and Computing and served on eight editorial boards. He organized numerous conferences, including Bill Tutte and Paul Erdős events.
Patrick Willems is a full Professor at KU Leuven's Faculty of Engineering Sciences, Department of Civil Engineering. He serves as the head of the Hydraulics Subdivision within the Hydraulics and Geotechnics unit. Professor Willems holds multiple significant roles including chairman of the ADS Bureau, member of the Faculty Council of Engineering Sciences, and participant in the Leuven One Health Institute and KU Leuven Institute for Urban Studies (LUSI). His work addresses critical global water management challenges through advanced hydrological modeling and climate change adaptation strategies. Professor Willems' research spans several critical areas in water resources engineering. His primary expertise includes urban hydrology and river engineering, statistical hydrology with focus on flood prediction and risk analysis, integrated river basin management, precipitation analysis, and climate change impacts on hydrological extremes. He employs both traditional hydrological modeling approaches and innovative machine learning techniques to develop practical solutions for flood warning systems, urban water management, and climate adaptation planning. His research integrates statistical methods, numerical modeling, and data science to address complex water management problems across multiple geographical contexts. Professor Willems leads multiple major international research projects examining hydrological extremes in transboundary river basins, natural climate adaptation measures, hydrological modeling of peatland areas, and deep learning-based prediction of hydrological extremes. His work spans various geographical contexts including Belgium, Vietnam, Bolivia, Tanzania, and the Congo Basin, demonstrating both local relevance and global applicability of his research. Within KU Leuven, Professor Willems teaches diverse courses including Environmental Problems and Techniques, Statistics and Data Science, Stochastic Hydrology, Urban and River Hydrology and Hydraulics, River Modeling, and Probability and Statistics. He also leads the Hydraulic Engineering Project course and an Artificial Intelligence Project course, reflecting his commitment to integrating traditional engineering knowledge with modern computational approaches. As head of the Hydraulics Subdivision, he oversees research activities focused on developing advanced water engineering tools and methodologies that bridge theoretical advancements with practical applications for water management authorities.
Sean Carroll serves as the Homewood Professor of Natural Philosophy at Johns Hopkins University and holds External Faculty status at the Santa Fe Institute. His research bridges cosmology, quantum mechanics, and philosophy, focusing on foundational questions about spacetime emergence, quantum interpretation, and complexity across cosmic scales. Carroll earned his Ph.D. from Harvard University in 1993. His academic trajectory reflects deep engagement with theoretical physics and philosophical inquiry, culminating in his current named professorship at Johns Hopkins. Carroll's research centers on the intersection of physics and philosophy, with significant contributions to quantum foundations, cosmology, and the nature of emergence. He is a leading proponent of the many-worlds interpretation of quantum mechanics and has pioneered work on the thermodynamic arrow of time, quantum decoherence, and the fine-tuning of initial cosmic conditions. His recent investigations explore discretized quantum systems, holographic principles in gravity, and the philosophical implications of quantum gravity. Analysis of his 2022-2025 publications reveals a pronounced shift toward computational approaches in quantum gravity, with increasing emphasis on finite-dimensional Hilbert spaces and GPU-accelerated modeling. His work consistently integrates quantum information theory with cosmological questions, particularly examining how spacetime geometry emerges from quantum entanglement and how complexity evolves in closed systems. Carroll's scientific recognition includes: National Science Foundation Fellowship NASA Fellowship Sloan Research Fellowship Packard Fellowship Fellow of the American Physical Society American Institute of Physics Award Fellow of the Royal Society Guggenheim Fellowship Fellow of the American Association for the Advancement of Science His research has been sustained through major fellowships from NSF, NASA, Sloan, and Packard foundations, enabling interdisciplinary collaborations across physics and philosophy. Carroll actively mentors graduate students at Johns Hopkins and contributes to public discourse through his popular science books (including the Biggest Ideas in the Universe series) and the weekly Mindscape podcast. As Fractal Faculty at the Santa Fe Institute, Carroll participates in cross-disciplinary research on complex systems, exploring how emergent phenomena arise from fundamental physical laws. His work bridges theoretical physics with broader questions about complexity in biological, cognitive, and social systems.
Jean-Pierre Fouque is a Professor in the Department of Statistics and Applied Probability (PSTAT) at the University of California, Santa Barbara. His research focuses on stochastic processes, financial mathematics, systemic risk, and reinforcement learning, with a particular emphasis on mean field games and multi-scale stochastic models. He explores applications in portfolio optimization, risk management, and algorithmic finance. His work combines theoretical advancements in stochastic analysis with practical applications in economics and finance. Notable contributions include developing models for systemic risk in financial networks, analyzing reinforcement learning algorithms in mean-field frameworks, and studying stochastic volatility effects in derivatives pricing. Recent research trends include integrating deep learning techniques for systemic risk quantification, advancing multi-scale asymptotic methods for portfolio optimization, and investigating strategic interactions in financial systems using game-theoretic approaches. His publications frequently address topics such as stochastic volatility calibration, optimal investment strategies under uncertainty, and the dynamics of financial markets under stress scenarios. Dr. Fouque has contributed to foundational textbooks and edited volumes on systemic risk and mean field games. His interdisciplinary work bridges probability theory, mathematical finance, and computational methods, impacting both academic research and practical risk management practices.
George Yin is a Professor in the Department of Mathematics at the University of Connecticut (since 2020). Previously, he held the position of Distinguished Professor at Wayne State University (2017–2020) and has been a faculty member there since 1988. He earned his Ph.D. in Applied Mathematics from Brown University in 1987, along with M.S. degrees in Applied Mathematics and Electrical Engineering, and a B.S. in Mathematics from the University of Delaware (1983). His research focuses on stochastic optimization, control theory, stochastic systems, and numerical methods, with applications to biology, finance, and engineering. He has held editorial roles at journals such as SIAM Journal on Control and Optimization and has received prestigious awards including SIAM Fellow (2015), IEEE Fellow (2002), and IFAC Fellow (2014–2017). Key funding includes continuous NSF support since 1989, grants from the Air Force Office of Scientific Research, and others. His work spans theoretical advancements in stochastic systems and practical applications in energy systems, control engineering, and data science. He has advised numerous students and maintains active collaborations internationally. Labs/Teams: Goldenson Center for Actuarial Research, Quantitative Learning Center. Grants: NSF, AFOSR, ARO, NSA, and multiple institutional grants.
Rayan Saab is an Assistant Professor in the Department of Mathematics at the University of California, San Diego. His research focuses on the mathematics of information, data science, and signal processing, with an emphasis on quantization, compressed sensing, and machine learning algorithms. Education: Ph.D. in Electrical and Computer Engineering from the University of British Columbia (2010). His work bridges theoretical mathematics and practical applications in data acquisition, digitization, and processing. Recent publications analyze quantization methods for neural networks and compressed sensing systems. He has taught graduate and undergraduate courses in numerical analysis, optimization, and mathematical methods in data science. Research trends include: Developing quantization algorithms with provable guarantees. Applications in high-dimensional data and machine learning. Stochastic frameworks for neural network compression. Scientific awards: Banting Postdoctoral Fellowship (2011-2013). Hellman Fellowship. Advising and grants: Advised students in thesis projects related to signal processing and data science. Received funding for research in mathematical data acquisition. Contact: rsaab@ucsd.edu | Office: AP&M 5157.
Yuxin Chen is a Professor at the University of Pennsylvania , holding joint appointments in the Department of Statistics and Data Science and the Department of Electrical and Systems Engineering . Prior to UPenn, he was an Assistant Professor at Princeton University (2017-2021) and a Postdoctoral Researcher at Stanford University (2015-2017). His research spans statistics, optimization, reinforcement learning theory, diffusion models, and information theory , with a focus on theoretical foundations and practical algorithms for machine learning. Education : Ph.D. in Electrical Engineering (Stanford, 2015), M.S. in Statistics (Stanford, 2013), M.S. in Electrical and Computer Engineering (UT Austin, 2010), B.E. in Electrical/Microelectronics (Tsinghua, 2008). Research Interests encompass theoretical and applied aspects of machine learning, including nonconvex optimization , sample complexity analysis , low-dimensional adaptation , and generative modeling . His work bridges mathematical rigor with real-world applications, particularly in scientific imaging and high-dimensional data analysis. Scientific Awards include the SIAM Activity Group on Imaging Science Best Paper Prize (2024) Alfred P. Sloan Fellowship (2022) NSF Career Award (2022) Google Research Scholar Award (2022) IEEE Transactions on Power Electronics Prize Paper Award (2024) Advising and Grants : He has mentored numerous students who have transitioned to academic roles at institutions like UIUC and UW-Madison. His research is supported by grants from the NSF , Amazon , and Google , with recent projects focusing on controllable diffusion models and efficient reinforcement learning algorithms .
Roles & Affiliations: Professor of Mathematics at Cornell University, Department of Mathematics. Member of graduate programs in Mathematics, Applied Mathematics, Operations Research and Information Engineering, Theoretical & Applied Mechanics, and Computational Science & Engineering. Co-organizer of the Scientific Computing and Numerics (SCAN) Seminar and founder of the Cornell Mathematical Contest in Modeling. Education: Ph.D. in Applied Mathematics from University of California, Berkeley (2001); B.A. in Applied Mathematics (with high honors) from University of California, Berkeley (1995). Research Interests: Focuses on numerical analysis, nonlinear PDEs, control theory, and dynamical systems. Explores applications in optimal control, front propagation, anisotropy, bifurcation theory, and mathematical biology. Develops methods for invariant manifold approximation, Eikonal equations, and stochastic systems. Recent work includes studies on cancer therapy optimization, surveillance evasion, and pedestrian flow modeling. Teaching: Teaches courses like Introduction to Partial Differential Equations, Differential Games, Numerical Analysis, and Mathematical Modeling. Recent courses include Math 4280 (Spring 2025) and Math 3610 (Fall 2024). Labs/Teams: Active in interdisciplinary collaborations, including work on computational biology, robotics path planning, and mathematical contest problem-solving initiatives.
Prof. Mathias Drton holds the Chair of Mathematical Statistics at the Technical University of Munich (TUM), within the Department of Mathematics and School of Computation, Information and Technology. His research focuses on graphical models, algebraic statistics, causal inference, and multivariate data analysis. He has authored numerous publications in top-tier journals and conferences, including work on conditional independence, sparse factor analysis, and causal discovery in linear models. Drton has supervised a large number of theses, mentoring students in areas like high-dimensional statistics, graphical models, and causal inference. He is actively involved in teaching advanced courses such as 'Graphical Models in Statistics' and 'Fundamentals of Mathematical Statistics.' His academic contributions span theoretical developments in statistical methodology and computational tools, including R packages like SEMID and symRC . Drton collaborates internationally, contributing to projects like the TUM-ICL Mathematical Sciences Hub and Exzellenzcluster MCQST. His work bridges algebraic methods with statistical challenges, addressing identifiability in latent variable models and robust graphical modeling under non-Gaussian assumptions. Recent research emphasizes causal structure learning under partial homoscedasticity, distribution-free independence tests, and multi-domain causal representation learning. Drton’s lab actively explores applications in genomics, epidemiology, and machine learning, leveraging both theoretical rigor and practical computational methods.
