Prof. Tobias Müller is a Professor at the Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence at the University of Groningen. His academic journey includes previous positions at Utrecht University, CWI (Centrum Wiskunde & Informatica), Tel Aviv University, and Eindhoven University of Technology, with a doctorate from the University of Oxford under Colin McDiarmid. His research focuses on combinatorics, probability theory, random graphs, percolation, discrete and stochastic geometry, and combinatorial game theory. He has contributed extensively to understanding complex networks, hyperbolic models, and geometric random structures. Research Interests: Random Graphs and Percolation Theory Discrete and Stochastic Geometry Hyperbolic Network Models Probabilistic Combinatorics Geometric Probability Graph Algorithms and Connectivity Notable Contributions: Analysis of Voronoi and Poisson-Voronoi percolation in hyperbolic planes. Studies on Mallows random permutations and their cycle structures. Research on component games and logical limit laws in graph theory. Investigations into the geometry and properties of random geometric graphs. Grants & Collaborations: Active in organizing workshops and conferences on random graphs and geometric networks, including the BIRS Workshop on Random Geometric Graphs and the STAR Workshops series. Labs/Teams: Member of the Bernoulli Institute’s research groups, focusing on stochastic studies, combinatorics, and algorithmic methods.
Salem Lahlou is an Assistant Professor in the Machine Learning Department at the Mohamed bin Zayed University of Artificial Intelligence (MBZUAI), having joined in September 2024. He previously served as a Senior Researcher at the Technology Innovation Institute (TII) in 2024. His academic background includes a PhD from Mila and Université de Montréal (UdeM) under Yoshua Bengio (2023), with prior studies in applied mathematics at École Polytechnique and statistical learning at École Normale Supérieure Paris-Saclay. His research focuses on developing more capable and reliable AI systems through three interconnected pillars: Novel Method Development : Core contributions to Generative Flow Networks (GFlowNets), uncertainty estimation techniques (DEUP), and curriculum learning frameworks Large Language Model Advancement : Enhancing reasoning capabilities and alignment through preference optimization and trace-based learning Community Tooling : Creation of torchgfn library for GFlowNets and benchmarks including BabyAI, FinChain, and LLM-BabyBench Core research areas span Machine Learning, GFlowNets, Uncertainty Estimation, LLM Reasoning, Reinforcement Learning, and AI for Science. Recent publications (2023-2025) demonstrate strong emphasis on GFlowNet theory/improvements (8+ papers), LLM reasoning evaluation (FinChain, LLM-BabyBench), uncertainty quantification, and societal AI impacts. Key application domains include mathematical reasoning, financial systems, privacy preservation, and cognitive science. He currently advises graduate students including Junyi (privacy risks in SNNs) and Abhijith (LLM reasoning). His group collaborates with MBZUAI faculty (Nils Lukas, Alham Fikri, Mingming Gong, Martin Takac) and industry partners on projects involving Conversational AI, Personalization, and Affective AI.
Cécile Mailler is a Reader in Probability at the University of Bath, where she is a member of the probability group Prob-L@B. She has held significant research positions including an EPSRC postdoctoral fellowship (2018-2021) titled "Random trees: analysis and applications" and previously worked as a postdoc at Prob-L@B (2013-2016) as part of Peter Mörters' EPSRC project "Emergence of Condensation in Stochastic Networks". She earned her PhD under the supervision of Brigitte Chauvin and Danièle Gardy at the Laboratoire de Mathématiques de Versailles. Her research focuses on probability theory with emphasis on branching processes, random trees, reinforcement mechanisms, Pólya urns, stochastic approximation, random networks, and statistical physics. She has made significant contributions to understanding preferential attachment models, zero-range processes, and random Boolean trees. Her work bridges theoretical probability with applications in statistical physics and combinatorics. Analysis of her recent publications shows a strong focus on random tree structures, branching processes, and reinforcement learning algorithms, with applications spanning from network theory to statistical mechanics. Her research demonstrates sophisticated mathematical techniques applied to complex stochastic systems, particularly those with reinforcement mechanisms and memory effects. Associate Editor of the Applied Probability Trust (since October 2020) Associate Editor of Stochastic Processes and Their Applications (since March 2022) Author of a general introduction to Pólya urns for the LMS Newsletter (November 2020) Co-organizer of the "Random Walks: Applications and Interactions" conference at CIRM (January 2026) She actively supervises PhD students working on topics including the multi-city ants process, Pólya urns with growing initial composition, large deviations for the Monkey walk, and competing growth processes. She has secured research funding through EPSRC fellowships and has been involved in multiple collaborative projects with prominent researchers in probability theory. Mailler regularly teaches mini-courses on advanced probability topics at international summer schools and workshops, demonstrating her commitment to knowledge dissemination in the field.
Christopher Ramsey is an Associate Professor and Interim Chair of the Department of Mathematics and Statistics within the Faculty of Arts and Science at MacEwan University in Edmonton, Alberta. He holds a PhD in Pure Mathematics from the University of Waterloo (2013), an MMath from Waterloo, and a BSc Honours from the University of Regina. Dr. Ramsey's research centers on operator algebras and functional analysis, with particular emphasis on non-selfadjoint operator algebras and multivariable operator theory. His work explores connections between analysis and algebra, studying algebras of infinite matrices and their applications to group theory, dynamical systems, free probability, and quantum information theory. He also investigates aperiodic order and its mathematical structures. His recent publications (2020-2025) demonstrate a consistent focus on operator algebras, with significant contributions to C*-algebras, tensor algebras, and their applications. The research spans theoretical foundations in functional analysis while connecting to diverse fields including symbolic dynamics, aperiodic structures, and quantum information. His work often bridges abstract algebraic structures with concrete analytical problems. Dr. Ramsey has received notable recognition including an NSERC Discovery Grant (2019), a MacEwan University Project Grant (2019), and an NSERC Postdoctoral Fellowship (2013). He serves as Editor-in-Chief of the MacEwan University Student eJournal (MUSe) and Associate Editor of the Canadian Transactions of Operator Theory. As an educator, Dr. Ramsey teaches various mathematics courses and supervises senior students' independent studies. His academic service includes editorial work and active participation in the Canadian Mathematical Society. His research program continues to develop connections between operator algebras and their diverse applications across mathematical disciplines.
Aditya T Siripuram is an Associate Professor at the Indian Institute of Technology Hyderabad (IITH), holding joint appointments in the Department of Electrical Engineering and the Department of Artificial Intelligence. He completed his PhD at Stanford University and holds B.Tech and M.Tech degrees from IIT Bombay. Education: PhD in Electrical Engineering, Stanford University (2017) - GPA: 4.17/4 M.Tech in Electrical Engineering, IIT Bombay (2009) - GPA: 9.79/10 B.Tech in Electrical Engineering, IIT Bombay (2009) - GPA: 9.79/10 Research Interests: His research spans Fourier analysis, signal processing, machine learning, convex and combinatorial optimization, with applications in AI/ML and applied mathematics. His work particularly focuses on computational aspects of Fourier analysis, including fast DFT computation for structured signals, convolution idempotents, and graph-based signal processing techniques. His recent research directions involve developing efficient algorithms for computing Discrete Fourier Transforms for signals with structured frequency support, investigating relationships between additive structures in frequency domains and computational complexity, and exploring graph learning techniques under spectral constraints. Awards and Recognition: Excellence in Teaching Award, IIT Hyderabad (2019, 2022) Stanford Graduate Fellowship Qualcomm Innovation Fellowship (awarded to his PhD student Charantej Reddy P in 2021) Teaching and Service: He has taught courses including AI1110 Probability and Stochastic Processes, EE5609 Matrix Theory, EE5606 Convex Optimization, and EE5328 Introduction to Submodular Functions. He serves as Departmental Undergraduate Committee Chair for the Department of AI at IITH (2020-present) and was MTech Admissions Coordinator for the same department (2019-2022). Research Group: He currently advises three PhD students working on signal processing based graph learning techniques, DFT computation for structured signals, and coded computing problems.
Rafał Latała is a distinguished Professor at the Institute of Mathematics, Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, where he has held a full professorship since 2013. He is also a Corresponding Member of the Polish Academy of Sciences since 2016 and an AMS Fellow since 2013. His academic career spans over 25 years at the University of Warsaw, progressing from Instructor (1994-1997) to Assistant Professor (1997-2003), Associate Professor (2003-2012), and finally to his current position as Professor. Additionally, he held a part-time professorship at the Institute of Mathematics of the Polish Academy of Sciences from 2009-2012. His educational background includes a PhD in Mathematics from the University of Warsaw (1997) with a dissertation on estimation of moments of sums of independent random variables under the supervision of Professor Stanisław Kwapien, a Habilitation degree in Mathematics (2002), and the title of Professor awarded by the President of Poland (2009). He completed his MSc in Mathematics at the University of Warsaw in 1994. Latała's research focuses on the intersection of probability theory and geometric analysis, with particular expertise in convex geometry, functional analysis, asymptotic geometric analysis, and the theory of log-concave measures. His work bridges theoretical mathematics with applications in high-dimensional statistics and random matrix theory. He has made significant contributions to understanding moment inequalities, concentration phenomena, and the geometric structure of high-dimensional random objects. His recent work demonstrates increasing sophistication in handling complex relationships between different norms of random vectors and matrices. His publication record shows a consistent focus on probabilistic methods in geometric settings, with recent articles demonstrating advanced techniques for analyzing random matrices, log-concave measures, and canonical processes. The research trajectory reveals increasingly sophisticated methods for bounding norms and moments in high-dimensional spaces, with applications spanning theoretical mathematics to statistical learning theory. Kolmogorov Lecture 2024 Prize of the Foundation for Polish Science in mathematics, physics, and engineering sciences 2023 Orlicz Lecture 2023 Institute of Mathematics of the Polish Academy of Sciences Prize 2014 AMS Fellow since 2013 Foundation for Polish Science Grant Mistrz 2007-2011 Prime Minister Award for Habilitation Thesis 2003 Invited Speaker at International Congress of Mathematicians 2002 Latała has supervised five PhD students to completion (Rafal Meller, Marta Strzelecka, Jakub Wojtaszczyk, Radoslaw Adamczak, and Rafal Lochowski) and four MSc students (Maciej Bartczak, Dariusz Matlak, Tomasz Tkocz, and Marcin Lis). His editorial service includes positions at Probability Surveys (2024-26), The Annals of Probability (2015-20), and Studia Mathematica (2006-present). He has organized numerous international conferences including the High Dimensional Probability X conference in 2023 and served on various professional committees including the Central Commission for Academic Degrees and Titles.
Jossy Sayir is an Affiliated Lecturer and Senior Research Associate in the Department of Engineering at the University of Cambridge . Holding a Dipl. El.-Ing. ETH and Dr. Techn.-Wiss. from ETH Zurich, Sayir’s work bridges Information Theory and Bioinformatics , focusing on DNA-based data storage and error correction systems. They serve as Director of Studies in Engineering at Newnham College and coordinate Engineering Admissions. Interdisciplinary collaboration with the European Bioinformatics Institute Research on DNA data storage efficiency and cost reduction Expertise in channel coding, source coding, and 5G algorithms Teaching spans mathematics and information engineering modules in Part I Engineering Tripos, with Part II contributions on information theory, error control coding, and cryptography. Sayir also oversees data compression labs and serves as Wine Committee Chair, reflecting diverse interests in food, coffee, wine, music , and jazz . Best Lecturer Award, 2017-18 Research Fellowships in coding theory Key research trends include DNA storage encoding , LDPC decoders , polar code optimization , and Sudoku-inspired constraint coding . Sayir’s work addresses both theoretical and practical challenges in high-density data storage and next-generation communication protocols .
Miklos Z. Racz is an Assistant Professor at Northwestern University with a joint appointment in the Department of Computer Science and the Department of Statistics and Data Science. He is affiliated with the IDEAL Institute. Previously, he was an Assistant Professor at Princeton University (ORFE Department) and a postdoc at Microsoft Research. His research focuses on probability, statistics, computer science, and information theory, with emphasis on combinatorial statistics, discrete probability, and applied probability. Key interests include statistical inference on random discrete structures like random graphs, community detection, latent geometry inference, and DNA data storage. He has advised numerous PhD and undergraduate students. Education: PhD in Statistics (UC Berkeley, 2015), MS in Computer Science (UC Berkeley), MS in Mathematics (Budapest University of Technology and Economics). Research interests span random graph theory, network analysis, information cascades, and computational biology. He teaches courses like Mathematical Foundations of Computer Science and Probability for Statistical Inference. His work has been published in top venues like Annals of Applied Probability, NeurIPS, and IEEE journals. Notable contributions include breakthroughs in graph matching algorithms for stochastic block models, community recovery, and DNA synthesis optimization. His research has practical applications in data storage and network science.
Alireza Salehi Golsefidy is a Professor in the Department of Mathematics at the University of California, San Diego (UCSD). He received his Ph.D. from Yale University under Gregory Margulis, a Fields Medalist. His research focuses on algebraic, arithmetic, and analytic properties of linear groups, homogeneous dynamical systems, and expander graphs. He has held positions at Princeton University and the Institute for Advanced Study as a Veblen Research Instructor before joining UCSD in 2011. Education: Ph.D. in Mathematics, Yale University (2006). Research Interests: His work bridges discrete subgroups of Lie groups, homogeneous dynamics, and number theory. Recent contributions include studies on super-approximation, spectral independence, and geometric group theory. He has organized workshops on thin groups, arithmetic groups, and homogeneous dynamics at MSRI and Oberwolfach. Grants & Awards: Alfred P. Sloan Research Fellowship (2012), Clay Liftoff Award (2006), NSF grants 1602137, 1902090, and 2302519. His research explores applications of expander graphs and random walks in algebraic structures. Teaching: Currently teaching Algebra (Math 200C) in Spring 2025. Past courses include advanced algebraic topology, representation theory, and graduate-level number theory. Labs/Teams: Co-organizes UCSD's Algebra Seminar and contributed to the 2013 Lie Theory Workshop. Active in collaborative projects on group actions and automorphic forms.
Stefano Leonardi is a Full Professor in the Department of Computer, Control and Management Engineering Antonio Ruberti at Sapienza Università di Roma. His research focuses on Algorithm Theory, Algorithms and Data Science, and Economics and Computation. He leads the ERC Advanced Grant project AMDROMA, exploring algorithmic mechanisms for online markets. He has held roles as Conference Chair for STOC 2021, WWW 2015, and FUN 2018, and coordinates the Sapienza School of Advanced Studies (2016-2018). His work spans approximation algorithms, online algorithms, and mechanism design. Awards include the ERC Advanced Grant and EATCS Fellowship. His research interests emphasize foundational algorithmic problems in web-based markets, leveraging rigorous design and large-scale data analysis. Recent projects include ALGADIMAR (PRIN 2019-2022) for digital market algorithms. He chairs the Highlights of Algorithms conference series and serves on program committees for top venues like EC, ICALP, and SODA. His lab focuses on web algorithmics and data mining, addressing challenges in online labor markets and fair division. Leonardi's academic contributions include over 100 publications, with recent work on fair algorithms, prophet inequalities, and mechanism design in auctions. He has pioneered methods for submodular optimization, online learning, and multi-agent systems. Grants and awards reflect his leadership in bridging theory with real-world applications, particularly in digital economies. Grants: ERC Advanced Grant (2018-2023), PRIN ALGADIMAR (2019-2022) Leadership: Chair of ACM STOC 2021, WWW 2015, and 9th FUN Conference Labs/Teams: Laboratory on Web Algorithmics and Data Mining Key Projects: AMDROMA (algorithmic mechanisms), ALGADIMAR (digital markets)
Dan Spielman is the Sterling Professor of Computer Science and holds joint appointments as Professor of Statistics and Data Science and Mathematics at Yale University. He is affiliated with the Department of Mathematics within the Faculty of Arts and Sciences. His research focuses on spectral graph theory, algorithms, linear systems, and their applications in computer science, mathematics, and statistics. He has been recognized as an ACM Fellow for his contributions to theoretical computer science and mathematics. Dr. Spielman's work bridges theoretical and applied domains, with notable advancements in graph sparsification, Laplacian solvers, and the resolution of the Kadison-Singer problem. His research also encompasses algorithmic design, optimization, and probabilistic methods. Key grants include NSF funding for projects like 'Generalized Algebraic Graph Theory: Algorithms and Analysis' (2016). His scientific awards include the ACM Fellowship (2011), acknowledging his impactful contributions to algorithms and complexity theory. Spielman’s interdisciplinary approach integrates spectral graph theory with practical applications, addressing fundamental problems in computation and mathematics.
Igor Kortchemski is a CNRS researcher at the Department of Mathematics and Applications (DMA) at École Normale Supérieure, Paris, and a lecturer in the Department of Applied Mathematics at École Polytechnique. His primary research focuses on the continuous limits of random discrete models, particularly examining how discrete combinatorial structures converge to continuous objects under appropriate scaling. His educational background includes a PhD in Mathematics (2012) under Jean-François Le Gall at École Normale Supérieure and a Habilitation à diriger des recherches (HDR) in Mathematics (2016). Kortchemski's research spans several interconnected areas: Random trees and Galton-Watson processes with heavy-tailed distributions Random planar maps and their geometric properties Growth-fragmentation processes and their connections to Lévy processes Scaling limits of combinatorial structures and their continuous counterparts His publication record shows a consistent focus on the geometric properties of random discrete structures, with recent work (2023-2025) exploring uniform attachment processes with freezing, critical tree phenomena, and the mesoscopic geometry of sparse random maps. His research often involves sophisticated probabilistic analysis combined with combinatorial insights. Scientific recognition includes: prix de thèse solennel Perrissin-Pirasset / Schneider de la chancellerie des Universités de Paris (2012) Kortchemski actively contributes to academic service: Examiner for the minor math exam at École Polytechnique (FUF) since 2023 Member of the mathematics jury for ENS International Selection (2023) Member of the jury for the external mathematics competitive examination (Agrégation) since 2021 Member of the jury for the Arts and Economic and Social Sciences Bank (B/L) mathematics exams (2015-2018) He mentors the next generation of researchers as co-director of Antoine Aurillard's and Vanessa Dan's theses (both since 2023), and previously directed Etienne Bellin's (2020-2023) and Paul Thevenin's (2017-2020) theses.
Tatiana Smirnova-Nagnibeda is an Associate Professor in the Mathematics Section at the University of Geneva, where she obtained her PhD before holding positions at ETH Zurich and KTH Stockholm. She returned to UNIGE where she has established herself as a leading researcher in geometric and combinatorial group theory. Her research focuses on combinatorial, asymptotic and geometric group theory, as well as probabilities on groups and graphs. She has made significant contributions to the understanding of branch groups, self-similar groups, Schreier graphs, and spectral properties of group actions. Her work often bridges algebra, probability, and geometry, revealing deep connections between these areas through the study of Thompson's groups, Grigorchuk's group, and other important group constructions. Her recent publications demonstrate a consistent focus on subgroup structure in various classes of groups, spectral properties of Schreier and Cayley graphs, and connections to dynamical systems. She frequently collaborates with researchers from around the world, particularly with Rostislav Grigorchuk, and has mentored numerous doctoral students who have gone on to successful academic careers. Managing Editor for Groups, Geometry, and Dynamics Editor for L'Enseignement Mathématique Organizer of GAGTA conferences (2022, 2024) Organizer of specialized workshops on high-dimensional expanders (2015, 2016) She leads an active research group comprising postdoctoral fellows and doctoral students working on various aspects of group theory and its applications. Her teaching includes advanced courses on graph theory, random walks on groups, spectral theory of graphs, and amenability at the University of Geneva.
Daniel Dadush is a part-time Professor at Utrecht University and a senior researcher at Centrum Wiskunde & Informatica (CWI) , where he leads the Networks & Optimization group. His research spans lattice algorithms, integer programming, convex optimization, and discrepancy theory, with a focus on theoretical and algorithmic advancements. PhD in Algorithms, Combinatorics, and Optimization (ACO) from Georgia Tech (2012) Simons Postdoctoral Fellow at Courant Institute, NYU (2012-2014) His work bridges discrete and continuous optimization, exemplified by breakthroughs like Strongly Polynomial Algorithms for Linear Programming (STOC 2024) and Interior Point Methods Are Not Worse Than Simplex (FOCS 2022). Recent publications emphasize randomized algorithms, integrality gaps, and high-dimensional geometry. Scientific Awards : ERC Starting Grant (2019-2024) NWO Veni Grant (2015-2018) Van Dantzig Prize (2020) A.W. Tucker Prize for Best Thesis (2015) INFORMS Optimization Society Student Paper Prize (2011) He mentors PhD students and postdocs, including Ben Bals , Samarth Tiwari , and Sophie Huiberts , and co-organizes major conferences like ISMP 2027 and Dutch Day on Optimization . His teaching includes courses on Interior Point Methods and Learning-Augmented Algorithms.
Dr Jon Warren is a Reader in Statistics at the University of Warwick, specializing in probability theory. His research spans stochastic flows, random matrices, and properties of Brownian motion, with significant contributions to understanding complex stochastic systems. Research Interests: Dr Warren's work is centered on probability theory, particularly in the areas of stochastic flows, random matrices, and Brownian motion. His research delves into the intricate behaviors of these systems, exploring their properties and applications in various mathematical contexts. Publications: His recent publications cover a wide range of topics within probability theory, including stochastic heat equations, Dyson Brownian motion, and random matrix theory. These works highlight his expertise in both theoretical developments and practical applications of stochastic processes. Teaching: He teaches ST910 Introduction to graduate probability, demonstrating his commitment to educating the next generation of statisticians and probabilists. Contact: Dr Warren can be reached at J.Warren@warwick.ac.uk for academic inquiries or collaboration opportunities.
