Paata Ivanisvili is an Associate Professor at the University of California, Irvine (UCI), Department of Mathematics, School of Physical Sciences. His research focuses on Analysis, Probability, Harmonic Analysis, and Functional Analysis, with a particular emphasis on isoperimetric inequalities, functional inequalities, and discrete structures such as the Hamming cube. He has held visiting positions at institutions including the Hausdorff Research Institute for Mathematics and Princeton University. Ivanisvili has organized conferences such as the Dual Trimester Program at the Hausdorff Institute on Boolean Analysis in Computer Science (2024) and annual Summer/Fall Schools since 2021. He earned his PhD in Mathematics from Michigan State University (2015) and a BS from Saint Petersburg State University (2011). His research interests include sharp inequalities in analysis (e.g., Poincaré, Beckner, Ehrhard), hypercontractivity, and applications to discrete mathematics and probability. He has collaborated with prominent mathematicians such as Fedor Nazarov, Alexander Volberg, and Roman Vershynin. Notable awards include the NSF CAREER Award (2021–2025) and Simons Fellowship in Mathematics (2025–2026). Ivanisvili’s recent work explores the interface between harmonic analysis and discrete mathematics, including studies on additive energies, convex hulls of space curves, and learning theory. His articles frequently address foundational questions in geometric functional analysis, often using tools like Bellman functions and optimal control theory. He actively advises PhD students and has mentored visiting researchers at UCI.
Vadim Lozin is a Professor of Mathematics at the University of Warwick, affiliated with the Department of Mathematics within the School of Mathematics. His research interests span graph theory, combinatorics, and discrete mathematics, focusing on areas such as clique-width, Ramsey numbers, and structural graph theory. He has held visiting positions at institutions including the Université Paris-Dauphine, EPFL, and KAUST. Lozin has received several accolades, including the Best Paper Award for 'Linear Ramsey numbers' in 2018 and a 2024 award at the International Symposium on Algorithms and Computation. His work involves collaborations with global researchers and contributions to conferences like IWOCA and WG. Lozin serves on editorial boards for journals such as Discrete Applied Mathematics and Electronic Notes in Discrete Mathematics . His research explores foundational problems in graph theory, with applications in algorithm design and complexity analysis. Lozin’s publications include studies on union-closed sets, functional graph properties, and algorithmic approaches to graph parameters. He has also contributed to books like Words and Graphs , bridging formal language theory with graph structures. His grants focus on clique-width and stability in graphs, reflecting his commitment to advancing theoretical and applied discrete mathematics.
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.
Aaron Smith is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa, affiliated with the Faculty of Science. He holds a PhD from Stanford University. His research focuses on applied probability, computational statistics, Monte Carlo methods, and Markov chains, with an emphasis on advancing theoretical understanding and practical applications of these methodologies. Dr. Smith's work includes contributions to community detection algorithms, Markov chain mixing times, and synthetic health data generation. His recent publications explore topics such as nonstandard Dirichlet form representations, perturbation analysis of MCMC algorithms, and sparse Bayesian multidimensional scaling. He advises students in applied probability and has supervised postdoctoral researchers in related fields. His research interests span a wide range of topics, including stochastic processes, statistical inference, and algorithm design. He is particularly known for his analysis of convergence rates in Markov chains and the development of efficient sampling techniques for complex models. His interdisciplinary work bridges theoretical mathematics and practical computational challenges in data science and healthcare. Dr. Smith collaborates on projects involving synthetic data frameworks for privacy-preserving applications and has contributed to foundational work on mixing times and perturbation effects in stochastic systems.
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.
Prof. Dr. Gerold Alsmeyer is a faculty member at the Institute of Mathematical Stochastics, Department of Mathematics and Computer Science, University of Münster. He is an active researcher with a focus on stochastic processes, particularly stochastic fixed-point equations and iterated function systems. His work is supported by his role as an Investigator in Mathematics Münster in the project EXC 2044 - C1: Evolution and asymptotics. His primary research interests include the theory of stochastic processes, branching processes, Markov random walks, renewal theory, and the asymptotic analysis of random structures such as random trees and polytopes. He has made significant contributions to the understanding of fluctuation theory, perpetuities, and the smoothing transform. His recent publications (2017–2023) reveal a sustained focus on theoretical probability, with recurring themes in random difference equations, iterated function systems, and limit theorems for stochastic processes. The work spans pure mathematical theory and applications in mathematical biology and combinatorics, indicating a broad yet deep research profile. Prof. Alsmeyer has supervised numerous doctoral and master’s students, including Viet Hung Hoang, Christopher Eick, Philipp Godland, and Fabian Buckmann, whose dissertations cover topics in branching processes, random walks, and stochastic fixed-point equations. He has no listed scientific awards in the provided texts. He teaches courses in probability theory, mathematical statistics, branching processes, and stochastic recursion equations, demonstrating a strong commitment to academic mentoring and education.
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.
Max Planck Institute for Mathematics in the SciencesGermany
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 .
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.
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 .
