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.
Christophe VIGNAT is a Professor at CentraleSupélec, affiliated with the Laboratoire des Signaux et Systèmes (L2S). His research focuses on number theory, special functions, probability, and their applications in signal processing and control systems. He has held visiting professorships at École Polytechnique Fédérale de Lausanne (EPFL) and Tulane University. VIGNAT's work bridges pure mathematics and applied fields, with notable contributions to Bernoulli/Euler polynomials, multiple zeta values, and probabilistic methods in number theory. His recent publications explore topics like partition functions, theta functions, and Ramanujan-type identities. He has delivered talks at international conferences and collaborates widely with researchers in mathematics and physics. Research Interests: Number theory, special functions (Bessel, orthogonal polynomials), probability theory, signal processing, control systems, analytic combinatorics, and their interconnections. His work often employs symbolic computation and probabilistic approaches to uncover identities and structures in mathematical analysis. Publications Trends: Recent articles emphasize partition theory, zeta functions, and integrals related to classical polynomials. His collaborations highlight interdisciplinary efforts between pure mathematics and applied sciences. Over 150 refereed papers and conference contributions demonstrate his prolific output across diverse mathematical domains. Education: While specific academic history isn’t detailed, his roles and publications suggest advanced training in mathematics and engineering, typical for a full professor in systems and control.
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.
Noga Alon is a Professor at Princeton University (previously at Tel Aviv University since 1985), renowned for transformative contributions to Combinatorics and Theoretical Computer Science. His work bridges deep mathematical theory with computational applications, earning him the 2024 Wolf Prize and 2022 Shaw Prize in Mathematical Sciences. Education Ph.D. in Mathematics, Hebrew University of Jerusalem, Israel (1983) Research Interests Alon pioneers combinatorial methods with profound impacts across mathematics and computer science. His expertise spans Graph Theory, Combinatorial Algorithms (including Streaming Algorithms), Circuit Complexity, and Combinatorial Geometry/Number Theory. He innovatively applies Algebraic and Probabilistic Methods to solve fundamental problems, such as necklace splitting and signrank applications, driving advancements in both pure and applied domains. Scientific Awards 1989 Erdos Prize, Israel 1991 Feher Prize, Israel 1997 Member of the Israel National Academy of Sciences 2000 Polya Prize, SIAM, USA 2001 Bruno Memorial Award, Israel 2005 Landau Prize, Israel 2005 EATCS-ACM Goedel Prize 2008 Israel Prize in Mathematics 2008 Member of the Academia Europaea 2011 EMET Prize 2015 Fellow of the American Mathematical Society 2015 Łojasiewicz Lecture at Jagiellonian University 2017 Fellow of the Association for Computing Machinery 2021 Leroy P. Steele Prize for Mathematical Exposition (with Joel Spencer) 2022 Shaw Prize in Mathematical Sciences 2024 Wolf Prize in Mathematics Advising and Grants While Alon has undoubtedly mentored numerous students during his tenure at Tel Aviv University and MIT, specific advisee names are not documented in the source material. Similarly, grant funding details remain unspecified despite his extensive research output.
Alexey Bufetov is a Professor at Leipzig University, holding an ERC Starting Grant for his research in Integrable Probability (2022-2027). Previously, he served as a W2-Professor ("Bonn Junior Fellow") at the Hausdorff Center for Mathematics (2018-2021) and as a CLE Moore Instructor at Massachusetts Institute of Technology (2015-2018). His research centers on Probability Theory , with deep connections to Mathematical Physics and Combinatorics . Key areas include integrable probability, stochastic particle systems (ASEP/TASEP), random tilings, Schur generating functions, and representation-theoretic aspects of probability. His work often bridges abstract mathematical structures with physical models from statistical mechanics. Bufetov's recent publications reveal a strong focus on integrable systems and asymptotic analysis , particularly exploring connections between Mallows measures, vertex models, and random matrix theory. His 2025 work on Aztec diamond domino tilings exemplifies his signature approach combining combinatorial structures with probabilistic methods. His primary recognition is the ERC Starting Grant "Integrable Probability" (2022-2027), supporting his cutting-edge research program. Bufetov has maintained a prolific collaborative network, frequently publishing with leading researchers including Alexei Borodin, Vadim Gorin, Leonid Petrov, and Kailun Chen. His work appears in top journals such as Advances in Mathematics , Duke Mathematical Journal , and Communications in Mathematical Physics .
Michael Farber is a Professor of Mathematics at Queen Mary University of London's School of Mathematical Sciences. Previously, he held professorships at the Universities of Warwick, Durham, and Tel Aviv. His research focuses on applied and computational topology, topological robotics, stochastic topology, and their applications in distributed computing, genomics, and brain connectivity modeling. He has authored influential monographs such as Invitation to Topological Robotics and Topology of Closed One-Forms . Farber's current research includes projects funded by the Leverhulme Trust and EPSRC, addressing probabilistic and deterministic topology, automated motion planning, and topological robotics. He advises PhD students including Lewin Strauss, Gabriele Beltramo, and Lewis Mead. His work has been recognized with the Royal Society Wolfson Research Merit Award. Key research interests include parametrized topological complexity, sequential motion planning algorithms, and the intersection of topology with AI and robotics. His collaborations span interdisciplinary fields, such as using topological methods in cancer research and genomic analysis. Grants and funding include the Leverhulme Trust's 'Probabilistic and Deterministic Topology' and EPSRC's 'Topology of Automated Motion Planning.' Farber is affiliated with Queen Mary's Centre for Geometry, Analysis, and Gravitation, contributing to advancing topological methodologies in algorithmic and stochastic systems.
Paul G Dupuis is the IBM Professor of Applied Mathematics at Brown University. His research focuses on applications of probability theory, stochastic processes, control theory, and numerical methods. He holds affiliations with the American Mathematical Society, Society for Industrial and Applied Mathematics (SIAM), and the Institute for Mathematical Statistics (IMS). His work emphasizes large deviation theory, Markov chain approximations, Monte Carlo simulation, and partial differential equations. Education: Ph.D. in Applied Mathematics from Brown University (1985), M.S. from Northwestern University (1982), and B.S. from Brown University (1981). Research Interests: Control of deterministic and stochastic processes, differential games, numerical methods, operations research, and stochastic processes. His contributions include foundational work on large deviation theory, risk-sensitive control, and queueing networks. Awards: Elected SIAM Fellow (2010), Fellow of the Institute for Mathematical Statistics (2011), IBM Professor of Applied Mathematics (2012), and AMS Fellow (2014). Previously held an NSF Postdoctoral Fellowship (1985-1988). Grants: Current funding from the Army Research Office and National Science Foundation. Key collaborations include work on stochastic approximation, constrained diffusions, and reflected Brownian motion. Teaching: Courses include Operations Research: Probabilistic Models, Information Theory, and Advanced topics in Probability and Stochastic Control.
Venkatesan Guruswami is a Chancellor's Professor in the Department of EECS and a Senior Scientist at the Simons Institute for the Theory of Computing at UC Berkeley . He also holds a Professor position in the Department of Mathematics . His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras (1997) , followed by a Ph.D. in Computer Science from the Massachusetts Institute of Technology (2001) . After a Miller Research Fellowship at UC Berkeley (2001–02), he held faculty roles at the University of Washington and Carnegie Mellon University before returning to UC Berkeley in January 2022. Education : B.Tech, IIT Madras (1997) Ph.D., MIT (2001) Professional Affiliations : Chancellor's Professor, UC Berkeley (EECS) Senior Scientist & Interim Director, Simons Institute Professor, UC Berkeley (Mathematics) Guruswami's research spans multiple domains within Theoretical Computer Science , focusing on Error-Correcting Codes , Approximation Algorithms , Randomness in Computing , Probabilistically Checkable Proofs , and Computational Complexity . His groundbreaking work in List Decoding has enabled codes with minimal redundancy for correcting worst-case errors, while recent advancements include Polar Codes , Deletion-Correcting Codes , and Constraint Satisfaction Problems . He has also contributed to Quantum Coding Theory , Locally Recoverable Codes , and Approximation Hardness in various computational contexts. His publications reflect a deep engagement with interdisciplinary topics. Key trends include: Quantum Information Theory : Quantum LDPC codes, transversal gates, and quantum storage. Algebraic Coding : Reed-Solomon codes, AG codes, and polynomial-based constructions. Computational Complexity : Hardness of approximation, CSPs, and parameterized intractability. Data Transmission : Polar codes, deletion channels, and feedback mechanisms. Algorithmic Techniques : Spectral methods, semirandom models, and Lasserre hierarchy applications. Guruswami has received numerous accolades, including the Simons Investigator Award , Presburger Award , Packard Fellowship , Sloan Research Fellowship , ACM Doctoral Dissertation Award , and the IEEE Information Theory Society Paper Award . He is an ACM Fellow (2017) and IEEE Fellow (2019) , with recent honors like the Guggenheim Fellowship (2023) and AMS Fellow (2023) . As an advisor, he has mentored over 25 PhD and postdoctoral researchers , including Atri Rudra , Prasad Raghavendra , and Peter Manohar , whose work has won awards like the Edmund M. Clarke Doctoral Dissertation Award and CRA Outstanding Undergraduate Researcher Award . His research is supported by grants from the National Science Foundation , Packard Foundation , and Sloan Foundation . He also serves as Editor-in-Chief of the Journal of the ACM and holds leadership roles in IEEE and arXiv moderation. Guruswami is actively involved in Simons Institute programs and co-organized workshops on Coded Computation and Information Theory . His work bridges theoretical advancements with practical applications in Cloud Storage , Quantum Computing , and Group Testing , including pandemic-era contributions like AC-DC: Amplification Curve Diagnostics for SARS-CoV-2 .
Hugo Duminil-Copin is a Full Professor at the University of Geneva and a permanent professor at the Institut des Hautes Études Scientifiques (IHES) since 2016. His research focuses on Mathematical Physics , Combinatorics , and Probability Theory . Education : École Normale Supérieure (ENS) Paris, University of Paris-Saclay Awards : 2022 Fields Medal for work in statistical physics Research Trends : Probabilistic aspects of lattice models Phase transitions and critical phenomena Conformal invariance and percolation theory Collaborations : Active collaborations with researchers such as R. Panis, S. Goswami, I. Manolescu, and others. Teaching : Offers courses in mathematical physics and probability at the University of Geneva. His recent publications emphasize critical models, random-cluster models, and Gaussian free fields, with applications in planar and high-dimensional systems. He supervises doctoral students including Emile Averous , Aman Markar , and Tiancheng He .
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.
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.
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.
Yang P. Liu is an Assistant Professor in the Computer Science Department at Carnegie Mellon University's School of Computer Science. Previously, he was a Postdoctoral Member at the Institute for Advanced Study and earned his PhD from Stanford University under the supervision of Aaron Sidford. He completed his undergraduate studies at MIT, graduating in May 2018. His educational background includes: PhD in Computer Science, Stanford University (Advisor: Aaron Sidford) Bachelor's degree, Massachusetts Institute of Technology (graduated May 2018) Dr. Liu's research spans the intersection of mathematics and computer science, with particular focus on graph algorithms , optimization , high-dimensional geometry , and additive combinatorics . His work often develops novel algorithmic techniques that bridge theoretical insights with practical applications. He has made significant contributions to areas such as convex optimization, linear programming, and combinatorial problems. His teaching includes courses like "A Principled Approach to Optimization" (CS 15-759), which covers rigorous treatments of convex optimization topics including gradient descent, interior point methods, linear regression, linear programming, and sparsification. His extensive publication record in top-tier conferences (FOCS, STOC, SODA) demonstrates a consistent focus on developing almost-linear time algorithms for fundamental graph problems, optimization techniques, and combinatorial theorems. Recent work shows increasing emphasis on combinatorial lines, corners theorem, and k-CSP approximability, while maintaining strong connections to optimization theory and graph algorithms. Dr. Liu has received notable recognition for his work: National Defense Science and Engineering Graduate (NDSEG) Fellowship (2018-2021) Google PhD Fellowship (2022-2023) Best Paper award at FOCS 2022 for "Maximum Flow and Minimum-Cost Flow in Almost Linear Time" Best Student Paper at STOC 2021 for "Discrepancy Minimization via a Self-Balancing Walk" His research has been supported by prestigious fellowships including the NDSEG Fellowship and Google PhD Fellowship. His work on graph algorithms, optimization, and combinatorics involves collaborations with researchers across theoretical computer science and mathematics. His publications often involve co-authors from multiple institutions, suggesting active research collaborations across the field. Dr. Liu maintains an active research program with a focus on developing efficient algorithms for fundamental computational problems. His recent work continues to push the boundaries of what's computationally feasible in graph algorithms, optimization, and combinatorial mathematics, with particular emphasis on achieving almost-linear time complexity for challenging problems.
