جست‌وجوی استاد و پژوهشگر

Gregory Miermontمشاهده پروفایل

استاد

• Probability Theory
• Random Trees
• Random Maps
• +۳ مورد دیگر

Gregory Miermont is a Professor of Mathematics at École Normale Supérieure de Lyon (ENS de Lyon), affiliated with the Unité de Mathématiques Pures et Appliquées (UMPA). He earned his doctorate in 2003 from Sorbonne University under Jean Bertoin, following studies at École Normale Supérieure Paris and UC Berkeley. His research centers on probability theory, including random trees, large random maps, coalescence/fragmentation processes, and stochastic calculus. He has advised 10+ PhD students, including Jérémie Bettinelli, Robin Stephenson, and Daphné Dieuleveut. His recent articles explore Brownian geometry, random maps, and scaling limits, with publications in journals like Annals of Probability and Combinatorial Theory . Awards: CNRS Silver Medal (2018) IUF Senior Member (2023–2028) Jaffé Prize (2016) Wolfgang Doeblin Prize (2014) EMS Prize (2012) He leads research projects on random maps and stochastic processes, supported by grants from ANR (MAC2, A3) and Labex Milyon.

Klaas Slootenمشاهده پروفایل

استاد

• Forensic Genetics
• Probability and Statistics
• DNA Analysis
• +۳ مورد دیگر

Klaas Slooten is a Professor of Mathematics for Forensic Genetics at Vrije Universiteit Amsterdam (VU) and works at the Netherlands Forensic Institute (NFI). He holds a dual affiliation combining academic and applied forensic expertise. His research focuses on statistical methods in forensic genetics, particularly DNA mixture analysis, likelihood ratio modeling, and familial searching strategies. Education: PhD in Mathematics from the University of Amsterdam (2003), specializing in algebraic structures related to Hecke algebras. Earlier academic work included studies on representation theory and combinatorial generalizations of Springer correspondence. Research interests include probabilistic evaluation of DNA evidence, computational tools for forensic analysis (e.g., MixKin software), and Bayesian network applications in victim identification (e.g., Bonaparte software). He teaches advanced courses on forensic probability and statistical evidence evaluation at VU and collaborates internationally on forensic genetics projects. Notable contributions include methodologies for interpreting complex DNA mixtures and improving familial database search strategies. Key achievements include developing the MixKin software for DNA mixture analysis and presenting at major conferences like the ISFG World Congress. His work bridges theoretical mathematics with practical forensic applications, emphasizing rigorous statistical frameworks for legal evidence interpretation.

Yotam Smilanskyمشاهده پروفایل

مدرس

• Dynamical Systems
• Aperiodic Order
• Mathematical Quasicrystals
• +۲ مورد دیگر

Dr. Yotam Smilansky is Lecturer in Dynamical Systems & Analysis within the Department of Pure Mathematics at the University of Manchester. His office is located in the Alan Turing Building (Room 2.217). Previously, he held positions as Hill Assistant Professor at Rutgers University and Orzen Postdoctoral Fellow at Hebrew University of Jerusalem. Smilansky's research centers on aperiodic order, examining mathematical structures that exhibit order without periodicity. Key focus areas include distribution properties of point sets, mathematical quasicrystals, tiling theory, and the manifestation of order-disorder relationships. His work connects dynamical systems with number theory, metric geometry, and combinatorics, with applications in mathematical physics. Recent publications (2020-2023) demonstrate progressive development in understanding Delone sets, substitution tilings, and cut-and-project systems. Articles consistently feature rigorous analysis of statistical properties, equivalence relations, and geometric invariants in aperiodic structures. Smilansky completed his PhD at Tel Aviv University under Barak Weiss, specializing in geometric aspects of dynamical systems. He welcomes PhD students interested in dynamical systems and aperiodic order.

Virginia Vassilevska Williamsمشاهده پروفایل

استاد

• Theoretical Computer Science
• Algorithms
• Computational Complexity
• +۲ مورد دیگر

Virginia Vassilevska Williams is Professor of Computer Science and Artificial Intelligence + Decision-making at MIT EECS. Her research focuses on theoretical computer science with emphasis on algorithms, computational complexity, and graph theory. She has made significant contributions to matrix multiplication complexity and fine-grained hardness results. Recent publications explore fundamental problems in graph algorithms including cycle detection, shortest paths, and clique enumeration. Her work demonstrates consistent advancement in understanding computational limits for graph problems and matrix operations. Key research themes include: Breaking barriers in matrix multiplication exponents Establishing hardness thresholds for approximation algorithms Developing efficient graph traversal methods for sparse structures Her 2024 publications continue this trajectory with refinements to the laser method for matrix multiplication and improved clique listing techniques. The research consistently pushes boundaries in algorithm optimality proofs and computational complexity theory.

Oren Beckerمشاهده پروفایل

پژوهشگر

• Group Theory
• Combinatorics
• Algebra
• +۳ مورد دیگر

Oren Becker is a Researcher in the Department of Pure Mathematics and Mathematical Statistics (DPMMS) at the University of Cambridge's Faculty of Mathematics. His work focuses on group theory, combinatorics, algebra, and their intersections with theoretical computer science and probability. He holds an office at C1.12 and can be contacted via ob348@dpmms.cam.ac.uk. Research interests include stability of group actions, testability in algebraic structures, permutation groups, and applications to coding theory. His recent work explores connections between probabilistic methods and stability properties in group theory, with contributions to expander graphs and LDPC codes. Publications span foundational questions in group stability, property (T), and invariant random subgroups. No scientific awards or grants are explicitly listed in the provided information. He is affiliated with DPMMS and participates in the broader research community through seminars and collaborations in pure mathematics.

Simon Tavaréمشاهده پروفایل

استاد

• Cancer Genomics
• Evolutionary Cancer Biology
• Statistical Bioinformatics
• +۸ مورد دیگر

Simon Tavaré is a Professor of Cancer Research (Bioinformatics) at the University of Cambridge’s Department of Oncology and a Professor in the Department of Applied Mathematics and Theoretical Physics (DAMTP). He is also the former Director of the Cancer Research UK Cambridge Institute (2013–2018), a Senior Group Leader there, and a Professorial Fellow at Christ’s College, Cambridge. His research focuses on cancer genomics, evolutionary approaches to cancer, and statistical bioinformatics for sequencing data. He integrates methods from computational biology, population genetics, and stochastic computation to address molecular biology questions. His career includes roles at the University of Southern California (1999–2006) and the University of Utah (1984–1989). He has been recognized with prestigious awards, including Fellowship of the Royal Society (2011) and election to the U.S. National Academy of Sciences as a Foreign Associate (2018). His work spans diverse areas such as evolutionary biology, palaeontology, and probabilistic combinatorics. Education: Early career details not explicitly listed, but academic roles began in 1978 as an instructor at the University of Utah. Research interests include applying statistical methods to cancer heterogeneity, mutational signatures analysis, and evolutionary dynamics in tumors. His publications highlight contributions to genomic data analysis tools like BayesPeak and foundational work in combinatorial probability. Awards: FMedSci (2009), FRS (2011), EMBO Membership (2015), NAS Foreign Associate (2018). He has led initiatives at the Cancer Research UK Cambridge Institute and contributed to international collaborations, including the OCCAMS Consortium for esophageal cancer research. His advisory roles include serving as President of the London Mathematical Society (2015–2017).

Ciara Pike-Burkeمشاهده پروفایل

مدرس

• Statistical Machine Learning
• Sequential Decision Making
• Reinforcement Learning
• +۴ مورد دیگر

Ciara Pike-Burke is a Lecturer in Statistics at the Department of Mathematics, Imperial College London, within the Faculty of Natural Sciences. Her research focuses on statistical machine learning, particularly sequential decision making under uncertainty, including multi-armed bandits, reinforcement learning, and online learning. She holds a PhD from Lancaster University (STOR-i program) and was a postdoc at Universitat Pompeu Fabra in Barcelona. Education: PhD in Statistics (Lancaster University, 2019) Postdoctoral Researcher (Universitat Pompeu Fabra, 2019-2022) Research Interests: She explores theoretical aspects of sequential decision problems in areas like education and healthcare, emphasizing algorithmic efficiency and regret minimization. Her work addresses challenges such as delayed feedback, sparse rewards, and privacy constraints in bandit and reinforcement learning frameworks. Publications: Her recent work includes advancements in hierarchical reinforcement learning, bandit algorithms with delayed feedback, and privacy-preserving techniques. Notable contributions include the QuACK algorithm for cooperative bandits and theoretical analyses of optimistic exploration strategies. Outreach: She develops educational tools like the TryBandits web-based game to introduce students to statistical concepts. She actively recruits PhD students in reinforcement learning theory, bandits, and online learning.

Louigi Addario-Berryمشاهده پروفایل

استاد

• Applied Mathematics
• Discrete Mathematics
• Probability
• +۳ مورد دیگر

Louigi Addario-Berry is a Professor in the Department of Mathematics and Statistics at McGill University. He holds the Canada Research Chair Tier 1 and was awarded the Coxeter-James Prize in 2016. His research focuses on probability theory, discrete mathematics, and their applications. Key areas include random graphs, tree structures, stochastic processes, and combinatorial optimization. He has contributed to foundational work on the scaling limits of random graphs, properties of branching random walks, and algorithmic aspects of random discrete structures. His academic career includes notable collaborations on topics such as the minimum spanning tree of random graphs, critical phenomena in percolation models, and probabilistic methods in combinatorics. Addario-Berry’s work bridges theoretical probability with applications in computer science and statistical physics. He oversees research projects funded by NSERC and the Canada Research Chairs program, and his international collaborations span institutions in Europe and North America. Notable awards include recognition for his innovative contributions to probability theory and combinatorics. His research group explores cutting-edge questions in random discrete structures, with a focus on rigorous mathematical analysis of complex stochastic systems. He has supervised numerous graduate students and postdoctoral researchers, advancing the field through both theoretical insights and interdisciplinary applications.

Alexander A. Razborovمشاهده پروفایل

استاد

• Complexity Theory
• Circuit Complexity
• Proof Complexity
• +۵ مورد دیگر

Alexander A. Razborov is the Andrew MacLeish Distinguished Service Professor of Computer Science and Mathematics at the University of Chicago and Adjoint Professor at the Toyota Technological Institute. His primary research focuses on complexity theory, including circuit complexity, proof complexity, quantum computations, and communication complexity. Previously he worked in combinatorial group theory and is actively exploring extremal combinatorics. He leads the Theoretical Computer Science Group, which connects computer science with physics, statistics, and mathematical sciences. His educational contributions include teaching Honors Discrete Mathematics, Mathematics of Quantum Computing, Complexity Theory, and other advanced topics. Razborov has received numerous prestigious awards including the Rolf Nevanlinna Prize (1990), Gödel Prize (2007), and election to the American Academy of Arts & Sciences (2020). He has supervised over 12 PhD and Master's students, with research spanning combinatorial open problems in proof complexity, continuous combinatorics, and communication complexity.

Zeev Dvirمشاهده پروفایل

استاد

• Theoretical Computer Science
• Discrete Mathematics
• Computational Complexity
• +۳ مورد دیگر

Zeev Dvir is a Professor jointly appointed in the Department of Computer Science and the Department of Mathematics at Princeton University. His research interests span theoretical computer science, discrete mathematics, and their intersections with algebra and combinatorics. He focuses on computational complexity, pseudo-randomness, coding theory, and combinatorial geometry. Notable contributions include work on the Kakeya conjecture in finite fields, incidence theorems, and applications to coding theory. He has published extensively in top venues such as computational complexity conferences and journals. His work has been highlighted in Quanta Magazine for its impact on geometric problems. Zeev Dvir holds grants from the National Science Foundation (NSF), including awards for research on dimension expanders and line-point incidence problems. His research also intersects with areas like matrix rigidity and data structure lower bounds. He maintains an active research program and collaborates on foundational questions in theoretical computer science and mathematics. His homepage hosts surveys on incidence theorems and their applications, reflecting his commitment to bridging algebraic methods with discrete geometry. He is a prominent figure in the Princeton academic community, contributing to both departments through teaching and interdisciplinary research.

Allan Slyمشاهده پروفایل

استاد

• Probability
• Statistical Mechanics
• Stochastic Processes
• +۳ مورد دیگر

Allan Sly is the Anthony H.P. Lee '79 P11 P14 Professor of Mathematics at Princeton University, affiliated with the Department of Mathematics at Fine Hall. His research focuses on probability theory, including statistical mechanics, stochastic processes, and random graphs. He is recognized for contributions to phase transitions, percolation, and interacting particle systems. Notable awards include the Wolfgang Doeblin Prize (2016). His work often addresses foundational questions in probability, such as mixing times of Markov chains, critical phenomena in statistical physics, and reconstruction problems on trees. Recent research explores epidemic models, TASEP dynamics, and constraint satisfaction problems. Sly has contributed to the theoretical foundations of algorithms for community detection in networks and the study of random constraint satisfaction thresholds. His research spans interdisciplinary topics, including applications of probability to computer science and biology. Grants include NSF CAREER awards for stochastic processes on networks. Collaborations often involve analyzing complex systems through rigorous probabilistic methods.

Mark Yarrowمشاهده پروفایل

مدرس

• Growing Random Networks
• Algebraic Graph Theory
• Combinatorial Graph Theory
• +۳ مورد دیگر

Dr Mark Yarrow is an academic staff member at the University of Sheffield, serving as Executive Editor of the Applied Probability Trust and Executive Manager of the Biometrika Trust since 2019 and 2022 respectively. He holds a PhD in Applied Probability (2019) from the University of Sheffield, focusing on random graph theory. His research interests include growing random networks, algebraic graph theory, and combinatorial graph analysis. He lectures courses such as Probability and Probability Distributions (MAS5051) and Mathematical Methods for Chemical and Biological Engineers (MAS140). Administratively, he oversees editorial operations for journals like Journal of Applied Probability and manages the Biometrika Trust's statistical research fellowships. He holds roles as School of Mathematics and Statistics Timetable Manager, GTA Director, and Tutor for LGBT+ Students. His work bridges academic administration, research leadership, and pedagogy in mathematical sciences. Research Interests: Random networks, graph theory, stochastic processes Administrative Roles: Editorial oversight, trust management, timetable coordination Teaching: Probability theory, applied mathematics for engineering

Kaave Hosseiniمشاهده پروفایل

استادیار

• Theoretical Computer Science
• Additive Combinatorics
• Approximate Algebraic Structure
• +۳ مورد دیگر

Kaave Hosseini is an Assistant Professor in the Department of Computer Science at the University of Rochester. He holds a PhD from UC San Diego and a BSc from Sharif University of Technology. His research focuses on theoretical computer science and additive combinatorics, emphasizing approximate algebraic structures and pseudorandomness. Education: PhD in Computer Science, UC San Diego (advisor: Shachar Lovett) BSc in Mathematics and Computer Science, Sharif University of Technology Research Interests: His work bridges theoretical computer science and mathematics, particularly in: Computational complexity Combinatorial structures Discrepancy theory Algebraic methods in computer science Key Publications: Recent works include advancements in communication complexity, pseudorandomness, and lower bounds. Notable achievements include a Best Paper Award at ICALP 2023. Awards: Best Paper Award at ICALP 2023. Teaching: He has taught courses such as Advanced Algorithms (CSC 484/284) and Analytic Methods in Computer Science (CSC 488/288) at the University of Rochester, and combinatorics and probability courses at Carnegie Mellon University. Professional Activities: Organized the Eastern Great Lakes (EaGL) workshop in Theory of Computation.

Nathan Kaplanمشاهده پروفایل

استاد

• Number Theory
• Arithmetic Algebraic Geometry
• Coding Theory
• +۳ مورد دیگر

Nathan Kaplan is a Professor of Mathematics at the University of California, Irvine (UCI). He specializes in Number Theory, Arithmetic Algebraic Geometry, Coding Theory, and Combinatorics. He holds a PhD from Harvard University (2013) and has held postdoctoral positions at Yale University and the NSA. His research focuses on rational points on varieties over finite fields, arithmetic statistics, and cokernels of random matrices. Kaplan has authored over 40 publications and has been recognized with awards such as the UCI Outstanding Contributions to Undergraduate Education Award (2022) and the AMS-MAA-SIAM Morgan Prize (2008). He has advised numerous PhD students and mentors postdoctoral researchers, including Harold Polo and Gilyoung Cheong. His editorial roles include serving on the Springer Undergraduate Texts in Mathematics Advisory Board and as a Communicating Editor for Semigroup Forum. Kaplan is actively involved in organizing conferences like the Southern California Number Theory Day and has secured grants from the NSF and Simons Foundation. Teaching includes undergraduate and graduate courses in Number Theory, Algebra, and Combinatorics. He emphasizes undergraduate research, mentoring programs like SUMRY and REU initiatives. His outreach spans talks at museums, math circles, and national competitions, reflecting his commitment to mathematical education and diversity in STEM.

• Fractal Geometry
• Mathematical Analysis
• Geometric Measure Theory
• +۶ مورد دیگر

Prof Kenneth Falconer is the Regius Professor of Mathematics at the University of St Andrews, leading the School of Mathematics and Statistics. He specializes in Fractal Geometry and Mathematical Analysis, with contributions to self-affine sets, box-counting dimensions, and fractal stochastic processes. His academic journey includes a PhD from the University of Cambridge and roles at the University of Bristol before joining St Andrews in 1993. He has authored five books, including the seminal Fractal Geometry: Mathematical Foundations and Applications . His research spans over 130 publications, focusing on fractal geometry's theoretical and applied aspects, including Falconer's distance problem and affinity dimension. He has supervised 19 PhD students, many of whom pursue academic careers. Awards include the Shephard Prize (2020), CBE (2024), and Fellowship in the Royal Society of Edinburgh. Teaching responsibilities include courses on Fractal Geometry, Functional Analysis, and Analysis for postgraduates via the Scottish Mathematics and Statistics Training Centre. He has held administrative roles like Head of School and Postgraduate ProDean. Beyond academia, Falconer is an avid long-distance walker, completing 37 LDWA 100-mile events and climbing all Munros and Corbetts in Scotland.