Ewain Gwynne is a Professor of Mathematics at the University of Chicago, affiliated with the Committee on Computational and Applied Mathematics (CCAM) and the Statistics Department. He previously held postdoctoral positions at the University of Cambridge and earned his Ph.D. from MIT in 2018 under Scott Sheffield. His research focuses on probability theory, particularly random geometric structures in statistical mechanics, including Schramm-Loewner evolution (SLE), Liouville quantum gravity (LQG), and random planar maps. Education: Ph.D. in Mathematics, MIT (2018); M.Sc., MIT (2015); B.Sc., Northwestern University (2013). Research Interests: Random geometric objects in statistical mechanics Liouville quantum gravity and its metric properties Random planar maps and their scaling limits SLE and its relationship with LQG Random walks on random planar maps Percolation and permutons His recent articles explore topics such as supercritical LQG, Gaussian curvature on random maps, and harmonic balls in LQG. He has advised multiple Ph.D. students and serves as an associate editor for Probability and Mathematical Physics . His work bridges probability theory, geometry, and mathematical physics, with applications to understanding critical phenomena in random systems.
Swiss Federal Institute of Technology in LausanneSwitzerland
Pierre Vandergheynst is a Full Professor at the Swiss Federal Institute of Technology Lausanne (EPFL) in the Department of Electrical Engineering, with a courtesy appointment in Computer and Communication Sciences. He serves as EPFL’s Vice-Provost for Education since 2015 and leads the Signal Processing Laboratory 2 (LTS2). His research spans harmonic analysis, sparse approximations, mathematical data processing, and applications in signal/image processing, computer vision, machine learning, and graph-based data analysis. PhD in Mathematical Physics (1998), Université catholique de Louvain Postdoctoral Researcher at EPFL (1998-2001) Assistant Professor at EPFL (2002-2007) His research explores geometry/symmetry in high-dimensional data, redundant dictionaries for dimensionality reduction, and computational harmonic analysis on manifolds. Recent work focuses on protein structure modeling, geometric deep learning, and graph-based signal processing. Key article trends include graph neural networks for protein analysis, geometric deep learning in neuroscience, and structured knowledge priors in neural models. His 2023-2025 publications emphasize interpretable AI, long-range dependencies in graphs, and molecular representation learning. Scientific Awards: IEEE Signal Processing Magazine Best Paper Award (2023) Signal Processing Society Best Paper Award (2022) Apple ARTS Award (2007) De Boelpaepe Prize, Royal Academy of Sciences of Belgium (2009-2010) He has supervised over 30 PhD theses and contributed to foundational work in graph signal processing, compressive sensing, and geometric deep learning. His lab develops tools for data science on non-Euclidean structures, with applications in medicine, astronomy, and wireless systems.
Gerhard Huisken is a Professor at the University of Tübingen and Director of the Mathematisches Forschungsinstitut Oberwolfach . His work spans Differential Geometry , Geometric Flows , and Mathematical Relativity . Education : Diploma (1982), PhD (1983), and Habilitation (1986) in Mathematics from Heidelberg University. His research focuses on geometric evolution equations, particularly mean curvature flow and inverse mean curvature flow , with applications to mathematical relativity and geometric inequalities . He has contributed to the understanding of singularities in curvature flows and developed surgical techniques for their analysis. His work on the Riemannian Penrose inequality and center of mass in isolated systems bridges geometry and physics. Selected publications highlight trends in geometric flows (mean curvature flow, Ricci flow), mathematical relativity (Penrose inequality, center of mass), and singularities in geometric PDEs. His collaborations with leading mathematicians like Simon Brendle and Tom Ilmanen reflect interdisciplinary impact. Scientific Awards and Honors : Fellow of the American Mathematical Society (2013) Clay Foundation Senior Fellowship (2013, 2007) Leibniz Preis from German Research Foundation (2003) Medal of the Australian Mathematical Society (1991) Member of the German Academy of Sciences Leopoldina (2004) He has held leadership roles including Dean of the Faculty of Mathematics at Tübingen University and directed major institutes like the Max Planck Institute for Gravitational Physics (2002-2013).
Professor Imre Leader is a distinguished mathematician at the University of Cambridge, where he serves as Professor of Pure Mathematics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS), which is part of the Faculty of Mathematics. His office is located in room C2.02 at the DPMMS building. Professor Leader's research primarily focuses on Extremal Combinatorics and Ramsey Theory , two fundamental areas of discrete mathematics. His work explores deep connections between combinatorial structures, set theory, and algebraic properties. He has made significant contributions to understanding partition regularity, monochromatic structures, extremal set theory, and combinatorial geometry. His research often bridges the gap between pure combinatorics and applications in computer science and theoretical mathematics. Over his prolific career, Professor Leader has published numerous influential papers in top mathematical journals, collaborating with leading mathematicians worldwide. His work spans various aspects of combinatorics including hypergraph theory, geometric combinatorics, additive number theory, and combinatorial game theory. He has been particularly active in advancing our understanding of Ramsey-type phenomena in infinite structures and developing new techniques in extremal combinatorics. Research Group: Combinatorics Email: I.Leader@dpmms.cam.ac.uk Telephone: 01223 765902 Personal homepage: https://www.dpmms.cam.ac.uk/~ibl10
Itsik Pe'er is a Full Professor and Vice-Chair in the Department of Computer Science at Columbia University's Fu Foundation School of Engineering & Applied Science, and holds a joint appointment as Professor of Systems Biology at the Vagelos College of Physicians and Surgeons. His research focuses on computational methods in human genetics, including genetic variation analysis, disease association studies, and algorithm development for genomic data. He leads the Itsik Pe'er Lab of Computational Genomics, which develops tools like Xplorigin, Germline, and SEACells to address challenges in genomics and medical research. His work spans machine learning applications in healthcare, microbiome analysis, and cancer genomics. Notable contributions include studies on hypertensive disorders in pregnancy, bias correction in predictive models, and the development of non-Euclidean learning libraries like Manify. Pe'er has advised students including Vladimir Vacic, Anat Kreimer, and Arthi Ramachandran, and collaborates on grants addressing genetic epidemiology and computational biology. His lab's location is in the Computer Science Building at Columbia's Morningside Campus.
Megan Kerr serves as the Katharine and Claudine Malone '63 Professor of Mathematics at Wellesley College, where she teaches across the mathematics curriculum from calculus to advanced topics in geometry. Her academic home is within the Mathematics & Statistics Department at this prestigious women's liberal arts college. Her educational journey began as an undergraduate at Wellesley College, where she later returned as faculty, completing a full circle in her academic career. She earned her Ph.D. from the University of Pennsylvania under the supervision of Wolfgang Ziller, with research focused on Homogeneous Einstein Metrics. Professor Kerr's research centers on global differential geometry, particularly exploring the interplay between curvature constraints and large symmetry groups. She specializes in homogeneous and low-cohomogeneity spaces, investigating fundamental questions about the existence of geometric structures, their rarity or commonality, and potential obstructions. Her work bridges the analytic concept of curvature with the algebraic framework of Lie groups, and she has recently expanded into geometric analysis where topology plays a significant role. Analysis of her publication record reveals a consistent focus on homogeneous Einstein metrics across three decades, with particular attention to curvature properties, symmetry constraints, and classification problems in both positive and negative curvature settings. Her research has evolved from foundational work on symmetric spaces to more complex non-symmetric examples and specialized curvature conditions, demonstrating both depth and breadth in differential geometry. Katharine and Claudine Malone '63 Professor of Mathematics Radcliffe Institute Fellowship As an alumna of Wellesley College, Professor Kerr maintains a strong commitment to encouraging women in mathematics. She teaches a diverse range of courses including calculus, linear algebra, combinatorics, real analysis, non-Euclidean geometry, differential geometry, topology, knot theory, and matrix groups as an introduction to Lie groups. Her teaching philosophy emphasizes developing mathematical understanding and confidence that benefits students regardless of their major. Her research has taken her to international destinations including Australia, Germany, and Mexico, reflecting the global nature of her scholarly collaborations.
Dr. Primoz Skraba is a Professor in Applied and Computational Topology at the School of Mathematical Sciences, Queen Mary University of London. As Deputy Head of the Centre for Probability, Statistics and Data Science, he bridges theoretical topology with practical applications in data analysis, machine learning, and optimization. Education : PhD in Electrical Engineering from Stanford University (2009) Prior Roles : Positions at INRIA, France; Jozef Stefan Institute, Slovenia; University of Primorska; University of Nova Gorica His research focuses on applying topological methods to analyze complex data. Key areas include: Stability of persistence diagrams for quantitative control in finite sampling Variants of persistence (zig-zag, robustness, multiparameter) Algorithmic Complexity in computational topology Stochastic Topology for random geometric models (Poisson, Boolean) Recent publications emphasize persistent homology in random geometric complexes, universality theorems, and integrating topological methods into machine learning. He received grants from the Leverhulme Trust, EPSRC, and Alan Turing Institute for projects on topological universality and AI foundations. His advisee Gabryel Mason-Williams explores wireless sensor network applications of homology.
Rex Ying is an Assistant Professor in the Department of Computer Science at Yale University's School of Engineering & Applied Science. He leads research in graph neural networks, geometric representation learning, and explainable AI, with applications spanning physical simulations, biology, knowledge graphs, and recommender systems. His lab actively recruits PhD students interested in geometric deep learning, graph neural networks, and trustworthy AI. Dr. Ying received his PhD in Computer Science from Stanford University under Jure Leskovec, with a thesis titled "Towards Expressive and Scalable Deep Representation Learning for Graphs." Prior to that, he graduated from Duke University in 2016 with highest distinction, majoring in Computer Science and Mathematics. His research focuses on three interconnected areas: advancing graph neural network architectures for improved expressiveness, scalability, and interpretability; innovating in geometric representation learning for data with diverse characteristics; and developing real-world applications across scientific domains. He has pioneered influential algorithms including GraphSAGE, PinSAGE, and GNNExplainer, and developed the first billion-scale graph embedding services at Pinterest as well as graph-based anomaly detection algorithms at Amazon. His recent publication trends show a strong focus on hyperbolic geometry for foundation models, non-Euclidean representation learning, and multimodal applications in computational biology. The research demonstrates increasing integration of geometric deep learning with large language models and foundation model architectures. KDD 2022 Dissertation Award 2019 Baidu Scholarship in Artificial Intelligence Dr. Ying actively serves the research community as a committee member for major conferences including AAAI, ICML, NeurIPS, ICLR, KDD, and WebConf for over seven years, and as area chair for LoG 2022. He co-leads the open-source PyTorch Geometric project and has organized numerous workshops on graph learning. His industry collaborations include Pinterest, Amazon, Facebook AI Research, DeepMind, Siemens, SLAC National Accelerator Laboratory, and Saudi Aramco. He teaches "Deep Learning for Graph-Structured Data" at Yale and mentors students in developing cutting-edge graph learning algorithms. His research lab collaborates with both academic institutions and industry partners to advance the state-of-the-art in graph representation learning, with particular emphasis on geometric deep learning and its applications to scientific discovery and real-world systems.
Weierstrass Institute for Applied Analysis and StochasticsGermany
Vladimir Spokoiny is a Professor at the Departments of Mathematics and Economics of the Humboldt University of Berlin and Head of the Research Group "Stochastic Algorithms and Nonparametric Statistics" at the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) in Berlin, Germany. His research spans multiple areas of statistics, machine learning, and financial mathematics, with significant contributions to nonparametric statistics, high-dimensional data analysis, and statistical methods in finance. Spokoiny received his M.Sc. in applied mathematics from the Moscow Institute of Railway Engineering in 1981 and his Ph.D. in mathematics from Lomonosov Moscow State University in 1988. He completed his Habilitation at Humboldt University in 1996. His academic career includes positions at the All-Union Institute of Railway Transport in Moscow, the Institute for Information Transmission Problems in Moscow, and the Institute for Applied Analysis and Statistics in Berlin before joining the Weierstrass Institute and Humboldt University where he has been a professor since 2002. Spokoiny's research focuses on adaptive nonparametric smoothing and hypothesis testing, high dimensional data analysis, statistical methods in finance, image analysis with applications to medicine, classification, and nonlinear time series. His work often addresses the challenges of nonstationarity in time series data and develops innovative methods for volatility estimation and risk management. He has made significant contributions to the development of adaptive weights smoothing procedures, which have applications in image processing, community detection, and manifold learning. His recent work has expanded into high-dimensional statistics, Bayesian inference, and optimization methods for machine learning, with publications demonstrating novel approaches to Gaussian approximation, Laplace methods, and statistical inference in non-Euclidean spaces. Spokoiny has supervised numerous PhD students including Oliver Reiss, Danilo Mercurio, Ying Chen, Elmar Diederichs, and Mstislav Elagin, whose research has focused on mathematical finance, time series analysis, and statistical methods. He serves as an Associate Editor for The Annals of Statistics (since 2004) and Statistics and Decisions (since 2002), and has previously served on the editorial board of the Journal of Statistical Planning and Inference. His professional activities include reviewing for major statistical journals including Annals of Statistics, Bernoulli, Econometrica, and Journal of American Statistical Association, as well as reviewing grant proposals for the National Science Foundation (USA), German Research Foundation, and Netherlands Organisation for Scientific Research. Spokoiny is a member of several professional societies including the International Statistical Institute, American Statistical Association, Institute of Mathematical Statistics, and Bernoulli Society. He is fluent in Russian (mother tongue), English, and German, and has good knowledge of French. His research group at WIAS focuses on developing novel statistical methodologies with applications across various scientific domains, particularly emphasizing adaptivity and robustness in complex data environments. The group's work has significant implications for financial risk management, medical imaging, and machine learning applications, with recent publications addressing fundamental questions in high-dimensional statistics and nonparametric inference.
University of Illinois Urbana-ChampaignUnited States
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 .
Dr. Sugata Mondal is a Lecturer in Pure Mathematics at the University of Reading's Department of Mathematics and Statistics, part of the School of Mathematical, Physical and Computational Sciences. He serves as the School Director of Postgraduate Research Studies. His research focuses on spectral geometry, analysis of partial differential equations (PDEs), geometric analysis, and hyperbolic geometry. He obtained his PhD from Université Paul Sabatier in Toulouse, followed by postdoctoral positions at the Max-Planck Institute in Bonn and Indiana University. Previously, he held a Reader position at TIFR, Mumbai until 2022. His academic qualifications include a BSc (Honors) in Mathematics from Ramakrishna Mission Vidyamandira (University of Calcutta) and an M.Math from ISI, Kolkata. His research explores geometric properties of Laplace eigenfunctions on domains and manifolds, with recent work addressing spectral instability, Schiffer's conjecture, and critical points on polygons. His publications span topics in spectral geometry, hyperbolic surfaces, and eigenvalue analysis. Dr. Mondal’s work bridges pure mathematics with geometric analysis, emphasizing the interplay between spectral theory and geometric structures. He teaches Real Analysis I (MA1RA1) and contributes to the Pure Mathematics and Analysis research groups at Reading.
Ola Svensson is an Associate Professor at the School of Computer and Communication Sciences , EPFL. His research spans approximation algorithms, combinatorial optimization, computational complexity, and scheduling. He holds an ERC Consolidator Grant (2023–) and previously received an ERC Starting Grant (2014–2019) and SNF grant (2019–2023). Education: PhD in Computer Science from IDSIA, Università della Svizzera italiana (2009) M.Sc. from Uppsala University (2005) Research Focus: Svensson develops novel techniques for NP-hard problems, with emphasis on primal-dual methods, LP/SDP hierarchies, and hardness proofs. His work applies to clustering, scheduling, network design, and submodular optimization. Publications: His 15 most recent works (2018–2021) focus on learning-augmented algorithms, robust optimization, and improved approximations for clustering/TSP. Key trends include integration of ML with classical algorithms and quasi-polynomial methods for combinatorial problems. Awards: Best Paper Awards at FOCS (2011, 2017) and STOC (2018) I&C Teaching Award at EPFL Advising & Grants: He advises 6 current PhD students and graduated 8 others. Major grants include ERC Starting Grant 'OptApprox' (€1.4M) and ERC Consolidator Grant 'POTCO' (€2M). Teaching: Leads courses in Advanced Algorithms, Computational Complexity, and Approximation Algorithms. He developed pedagogical frameworks for scribe notes and project-based learning in theoretical computer science.
Erik Waingarten is an assistant professor at the University of Pennsylvania in the Computer and Information Science department. His research focuses on algorithms for massive datasets, including similarity search, streaming/sketching, property testing, and distribution testing. Former postdoctoral researcher at Stanford's CS Department under Moses Charikar PhD from Columbia University advised by Xi Chen and Rocco Servedio Key research areas: High-dimensional geometry Streaming algorithms Property testing Sketching techniques Clustering and metric optimization Recent article trends show expertise in: 2025 publications on monotonicity testing and metric property analysis 2024 work on Earth Mover's Distance and kernel evaluations 2023 papers on clustering, optimal transport, and MST algorithms 2022-2020 foundations in sublinear algorithms and entropy estimation Scientific recognition: NSF CAREER Award (2023) CCC Best Paper Award (2017) Invited to Journal of the ACM (2017) Academic advising includes PhD students: Ashwin Padaki Tian Zhang Nicolas Menand Krish Singal Junkai Song
Swiss Federal Institute of Technology in LausanneSwitzerland
Varun Jog is Professor of Information Theory and Statistics in the Department of Pure Mathematics and Mathematical Statistics (DPMMS) at the University of Cambridge, Faculty of Mathematics. Previously, he served as Assistant Professor at the University of Wisconsin-Madison (2016-2020) and at the University of Cambridge (2021-2024). His academic background includes a B.Tech. in Electrical Engineering from IIT Bombay (2010) and a Ph.D. in Electrical Engineering and Computer Sciences from UC Berkeley (2015). Professor Jog's research centers on fundamental questions at the intersection of information theory, statistics, and machine learning. He develops theoretical frameworks for statistical inference under constraints such as limited communication and privacy requirements, with significant contributions to hypothesis testing, differential privacy, adversarial risk analysis, and information-theoretic inequalities. His work bridges abstract mathematical principles with practical applications in data science and robust machine learning. Recent publications demonstrate a concentrated focus on distributed inference systems, particularly examining sample complexity limits in hypothesis testing under information constraints and privacy-preserving mechanisms. His research consistently reveals deep connections between information theory and statistical learning, with increasing emphasis on adversarial robustness and foundational inequalities. His scientific contributions have earned recognition through prestigious awards: NSF-CAREER Award (2020) R. Narasimhan Memorial Lecture Award (2020) Eli Jury Award from UC Berkeley EECS Department (2015) Jack Keil Wolf student paper award at ISIT (2015) Professor Jog maintains an active research group, currently supervising one PhD student while having graduated four PhD students and four Master's students. His mentorship extends to postdoctoral researchers including Amir Asadi, Deepanshu Vasal, and Andre Wibisono. Research funding includes the competitive NSF-CAREER grant. He co-organizes the Cambridge Information Theory Seminar, fostering academic exchange and collaboration within the theoretical research community.
David Eppstein is a Distinguished Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information & Computer Sciences. He holds academic leadership roles as director of the Center for Algorithms and Theory of Computation and associate director of the Center for Algorithms, Combinatorics, and Optimization. His research focuses on graph algorithms, computational geometry, discrete mathematics, and geometric graph theory. Eppstein earned a B.S. in Mathematics from Stanford University (1984) and a Ph.D. in Computer Science from Columbia University (1989). Research Interests: Graph drawing, information visualization, dynamic graph algorithms, mesh generation, optimal triangulation, K-shortest paths, subgraph isomorphism, data depth, exponential-time algorithms for NP-hard problems. Awards: ACM Fellow (2012), AAAS Fellow (2017), Distinguished Professor (2020), Best Paper Awards (2023, 2022), and SIAM recognition. Grants: Co-PI on a $1.2M NSF grant (2022) for geometric graph research, and previous NSF grants for algorithm studies (2016). His work bridges theoretical computer science and practical applications, including contributions to graph visualization, geometric algorithms, and combinatorial optimization. Notable recent achievements include resolving open questions in graph biplanarity and authoring the book Forbidden Configurations in Discrete Geometry (2018).
