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.
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 .
Artur Czumaj is a Professor in the Department of Computer Science at the University of Warwick and serves as the Director of the Centre for Discrete Mathematics and its Applications (DIMAP). He is a member of the Division of Theory and Foundations (FoCS) and holds affiliations with the Alan Turing Institute, the Warwick Data Science Institute (WDSI), and the Warwick Centre for Doctoral Training in Mathematics of Real-world Systems (MathSys). Previously, he served as Head of Department and President of the European Association for Theoretical Computer Science (EATCS) from 2020 to 2024. His research lies at the core of theoretical computer science, focusing on the design and analysis of algorithms, particularly randomized, sublinear, parallel, and distributed algorithms. His work spans graph theory, combinatorics, computational geometry, algorithmic game theory, and property testing. He has led major research initiatives funded by EPSRC, IBM, the Royal Society, and Weizmann-UK grants. The trends in his recent publications highlight a strong emphasis on sublinear algorithms, dynamic graph algorithms, and property testing, with recurring themes in randomized methods, graph processing, and efficient data structures. His work bridges foundational theory with applications in data summarization, network analysis, and computational geometry. EPSRC grants: EP/D063191/1, EP/G064679/1, EP/G069034/1, EP/J021814/1, EP/N011163/1, EP/V01305X/1, EPSRC studentship IBM Faculty Award Royal Society International Exchanges Scheme Weizmann-UK Making Connections Grants on combinatorial and algorithmic primitives and the interplay between algorithms and randomness Peter Davies received the 2020 Warwick Faculty of Science Thesis Prize under his supervision Artur Czumaj has supervised numerous PhD students, including Anna Adamaszek, Michal Adamaszek, Sam Coy, Peter Davies, Michail Fasoulakis, Jan Hladky, Wang Xin, and Hairong Zhao. His research has been supported by sustained grant funding, reflecting his leadership in theoretical computer science. He has organized major workshops at Dagstuhl, Oberwolfach, Simons Institute, and the University of Warwick, and has served on the steering committees of HALG and as PC Chair for SODA 2018 and ICALP 2020. He is actively involved in organizing key research events, including the Simons Institute Special Semester on Sublinear Algorithms (2024), the Workshop on Sublinear Graph Simplification (2024), and the Computational Complexity Conference (CCC 2023) at Warwick. He also co-organizes the Warwick-Weizmann workshops and the IGAFIT Algorithmic Postdocs Workshop, fostering international collaboration in algorithms research.
Yaoqing Yang is an Assistant Professor at the Department of Computer Science, Dartmouth College. He earned his PhD in Electrical and Computer Engineering (ECE) from Carnegie Mellon University (CMU) and completed postdoctoral research at UC Berkeley's RISE Lab. His work focuses on robustness in machine learning systems, spectral analysis of neural networks, and algorithm design for structured data like graphs and point clouds. PhD in ECE, Carnegie Mellon University Postdoc, RISE Lab, UC Berkeley BS in Electrical Engineering, Tsinghua University Research interests include diagnosing and mitigating model failures through heavy-tailed spectral analysis, decision boundary studies, and loss landscape visualization. He develops methods such as AlphaPruning and SharpBalance to enhance large language models and ensemble learning. Recent work spans 2025 publications on spectral evolution of neural networks, agentic AI for science, and LLM safety. Key collaborations include Michael W. Mahoney and other researchers. Burke Research Initiation Award, Dartmouth (2024) DOE grant for scientific foundation models (2024) DARPA grant for AI robustness (2024) He serves as Area Chair at NeurIPS 2025 and ICLR 2026, and has presented at Google Research, Lawrence Berkeley National Laboratory, and leading universities worldwide. His lab at Dartmouth engages in theoretical and applied research, with connections to UC Berkeley's RISE Lab and collaborations across institutions like CMU and Tsinghua University.
Nathan Kaplan is a Professor in the Department of Mathematics at the University of California, Irvine, where he conducts research in number theory, algebraic geometry, and combinatorics. His work spans rational points on varieties over finite fields, arithmetic statistics, coding theory, and the study of numerical semigroups. He is actively involved in the mathematical community, organizing seminars and conferences including the UC Irvine Number Theory Seminar and the Southern California Number Theory Day. Dr. Kaplan received his PhD from Harvard University in 2013 under the direction of Noam Elkies. Following his doctorate, he was a postdoctoral researcher at Yale University from 2013-2015 before joining the faculty at UC Irvine. His research interests focus on the intersection of number theory and algebraic geometry, with particular attention to problems involving rational points on varieties over finite fields, arithmetic statistics, and coding theory. He has made significant contributions to the study of numerical semigroups, cokernels of random p-adic and integer matrices, and quadratic forms and lattices. His work often bridges theoretical mathematics with applications in coding theory and cryptography. Analysis of his recent publications shows a strong trend toward combinatorial aspects of number theory, particularly in the study of numerical semigroups and their properties. He frequently collaborates with researchers across institutions, with recent work spanning algebraic geometry, combinatorics, and coding theory. His publications demonstrate expertise in both theoretical developments and computational aspects of number theory. Dr. Kaplan is deeply committed to undergraduate research and mentoring. He has experience as a mentor for undergraduate research projects through programs including SUMRY (a research program for Yale undergraduates), the University of Minnesota-Duluth REU program, and the Trinity University REU program. He actively encourages undergraduates to apply for summer research opportunities and has organized numerous outreach activities. He is an organizer of the UC Irvine Number Theory Seminar and the Southern California Number Theory Day conference series. In 2018, he co-organized the Conference on Open Questions in Cryptography and Number Theory in honor of Alice Silverberg's 60th Birthday. Dr. Kaplan has given numerous talks at mathematical venues including the Museum of Mathematics' Math Encounters series, where he presented "Error-Correcting Codes: The Mathematics of Communication" in July 2022. He has also spoken at the Yale Undergraduate Math Society, the UCI Math Circle, and various other outreach events.
Ron Peled is a Full Professor in the School of Mathematical Sciences at Tel Aviv University , currently on leave to serve as the Brin Professor in the Department of Mathematics at the University of Maryland starting summer 2024. During 2022–2024 he was a Member at Princeton University and the Institute for Advanced Study . Education & Career: While explicit degrees are not listed, his trajectory shows appointments at NYU (2009–2010), UC Berkeley and Tel Aviv University as a teaching assistant, followed by faculty positions culminating in full professorship. Research Interests: His work lies at the intersection of probability theory, statistical physics, and combinatorics . Key themes include: Disordered systems and random environments (random-field Ising, spin glasses) First-passage percolation and random metrics Random surfaces and height functions Loop models and critical phenomena Random matrices and band matrices Geometric probability and allocation problems Publications & Impact: With over 70 papers in top journals such as Annals of Mathematics , Annals of Probability , Inventiones Mathematicae , and Communications in Mathematical Physics , his recent work explores minimal surfaces in random environments, localization in random band matrices, and quantitative disorder effects in low-dimensional spin systems. Grants & Awards: Research has been continuously funded by: Israel Science Foundation (grants 1048/11, 861/15, 1971/19, 2340/23) ERC Starting Grant LocalOrder ERC Consolidator Grant Transitions Marie Skłodowska-Curie International Reintegration Grant SPTRF Teaching & Mentoring: Prof. Peled has taught a broad spectrum of courses at Tel Aviv University (Brownian motion, probability, percolation, random matrices, stochastic calculus) and NYU (combinatorics, discrete mathematics). He has supervised 13 post-doctoral fellows and 8 graduate students (PhD & MSc) to date. Service & Outreach: He co-organizes the Joint Israeli Probability Seminar and has organized numerous international workshops and conferences including at Oberwolfach, Technion, and Tel Aviv University.
Yvain Bruned is a Professor of Mathematics at Université de Lorraine, Nancy, France, where he leads research in singular stochastic partial differential equations and related fields. He serves as Principal Investigator for the ERC Starting Grant LoRDeT (2023-2028), which focuses on advancing the theory of decorated trees and Hopf algebraic structures for solving singular SPDEs and dispersive PDEs at low regularity. Previously, he was a Lecturer at the University of Edinburgh (2019-2022) and completed postdoctoral work at Imperial College London and University of Warwick under Martin Hairer. His educational background includes: PhD in Mathematics (2012-2015), UPMC (Paris 6), on "Singular KPZ type equations" under Lorenzo Zambotti Master 2 in Probability and Statistics, ENS Cachan / Rennes 1, with honors Master 1 in Mathematics, ENS Cachan, with honors Bachelor in Mathematics and Computer Science, University of Rennes 1, with honors Student at ENS Cachan Brittany extension (2009-2013) Classes Préparatoires in Mathematics and Physics (2007-2009) Bruned's research centers on singular stochastic partial differential equations, with particular focus on Regularity Structures, renormalization theory, and their connections to Hopf algebras. His work bridges theoretical mathematics with applications in quantum field theory, wave turbulence, and numerical analysis. He has developed novel approaches using decorated trees to handle renormalization procedures for singular SPDEs and has extended these methods to dispersive PDEs with random initial data. His research program aims to establish existence and uniqueness results for quasilinear and dispersive SPDEs while developing algebraic tools through deformations of Hopf algebras. His extensive publication record demonstrates consistent contributions to the field of singular SPDEs, with a clear trajectory from foundational work on Regularity Structures to more recent applications in dispersive PDEs and numerical methods. The publications reveal a strong collaborative network with leading researchers in stochastic analysis, mathematical physics, and algebra. His work shows increasing sophistication in handling renormalization procedures through algebraic structures, with recent papers exploring connections between different mathematical frameworks. His major scientific recognition includes: ERC Starting Grant LoRDeT (2023-2028) Bruned actively supervises a large group of researchers, currently advising 4 PhD students and 2 postdoctoral researchers at Université de Lorraine, with several former PhD students having completed their degrees at the University of Edinburgh. His ERC grant has enabled him to organize multiple international workshops in Nancy, fostering collaboration between researchers in singular SPDEs, algebraic structures, and numerical analysis. The grant also supports the development of software platforms for decorated trees and their Hopf algebraic structures. As Principal Investigator of the ERC LoRDeT project, Bruned leads a vibrant research team based at the Elie Cartan Institute of Lorraine, which includes postdocs, PhD students, and visiting researchers. The team regularly organizes specialized workshops on topics including operads, symmetries for quantum field theory, and normal forms for singular dynamics, creating a dynamic research environment that bridges multiple mathematical disciplines.
Samuel Johnston is a Lecturer in Probability Theory at the Department of Mathematics, King's College London, affiliated with the Faculty of Natural, Mathematical & Engineering Sciences. He joined King's in 2022 after postdoctoral roles at the University of Bath, University of Graz, and University College Dublin. MMath, University of Oxford (2014) PhD in Probability, University of Bath (2017) Johnston's research spans probability theory, with a focus on stochastic processes involving branching, coalescence, and fragmentation. He actively explores free probability, random matrices, integrable combinatorics, and combinatorial approaches to the Jacobian conjecture. His work intersects with statistical physics and asymptotic geometric analysis. Recent publications highlight coalescent structures in heavy-tailed branching processes, integrable probability models, free probability via entropic transport, and convexity in high dimensions. Keywords include universality classes, Berry-Esseen bounds, and fragmentation-scaling limits. Samuel has not been mentioned to have received specific scientific awards or honors. He advises PhD students Rohan Shiatis (2023-) and Neil Mukerji (2024-). Collaborations span institutions in the UK, USA, Mexico, Austria, and Poland, with invited talks at global conferences including Xiangtan University, Imperial College London, and UCLA.
Christina Lee Yu is an Assistant Professor at Cornell University in the School of Operations Research and Information Engineering (ORIE). She holds a PhD and MS in Electrical Engineering and Computer Science from MIT (2017, 2013) and a BS in Computer Science from Caltech (2011). Her research focuses on algorithm design, high-dimensional statistics, causal inference in networks, and reinforcement learning. She is also an Amazon Scholar and has received prestigious awards, including the NSF CAREER Award and Intel Rising Stars Award. Her work is supported by grants from the NSF and Air Force Office of Scientific Research. Education: PhD in EECS, MIT (2017) MS in EECS, MIT (2013) BS in Computer Science, Caltech (2011) Research Interests: Algorithm design and analysis Inference over networks and causal inference Sequential decision making under uncertainty Online learning and reinforcement learning High-dimensional statistics Awards and Honors: NSF CAREER Award (2024) ACM SIGMETRICS Rising Stars Award (2024) Intel® Rising Stars Award (2021) JPMorgan Faculty Research Award (2021) Simons Institute Research Fellow (2020) INFORMS Dantzig Dissertation Award Honorable Mention (2018) Grants and Funding: National Science Foundation (NSF) CAREER Grant Air Force Office of Scientific Research Grant Advising: PhD Students: Sean Sinclair, Tyler Sam, Xumei Xi Collaborators: Mayleen Cortez, Matthew Eichhorn Labs and Collaborations: Member of ORIE, Statistics, CAM, and CS graduate fields at Cornell Amazon Visiting Academic in Fulfillment Optimization (2025)
June Huh is a Mathematics Professor at Princeton University's Department of Mathematics. His research focuses on the interplay between algebraic geometry, combinatorics, and matroid theory, with notable contributions to Hodge theory, tropical geometry, and log-concavity phenomena. He is actively involved in collaborative projects such as the FRG initiative on matroids, graphs, and algebraic geometry. Key research interests include matroid polytopes, Chow rings, Lagrangian geometry, and combinatorial applications of Hodge-Riemann relations. His work bridges discrete and continuous mathematics, with implications for enumerative geometry and geometric combinatorics. Recent publications explore topics like volume polynomials, Bergman fans, and singular Hodge theory in combinatorial geometries. He has received funding for interdisciplinary research through grants like the FRG Collaborative Research program. His contributions highlight innovative methods in geometric and algebraic combinatorics.
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.
Jonathan Hauenstein is the Robert and Sara Lumpkins Collegiate Professor in the Department of Applied and Computational Mathematics and Statistics at the University of Notre Dame, serving as Department Chair. He holds a Ph.D. from Notre Dame (2009) and M.S. from Miami University (2005). His research focuses on numerical algebraic geometry and computational methods for solving nonlinear equations, implemented in the Bertini software package. Applications span engineering, ecology, sports science, and machine learning. Education: Ph.D., Applied and Computational Mathematics, University of Notre Dame (2009) M.S., Mathematics, Miami University (2005) Research Interests: Development of numerical algorithms for polynomial systems, real algebraic geometry, and scientific computing. Key areas include homotopy continuation methods, parameter space decomposition, and applications in mechanism design, ecological modeling, and sports biomechanics. His work bridges theoretical mathematics with practical computational tools. Awards: Sloan Research Fellowship DARPA Young Faculty Award Army Research Office Young Investigator Award Office of Naval Research Young Investigator Award College of Science Research Award Advising & Grants: Advised numerous undergraduates, graduate students, and postdoctoral researchers. Active in securing grants for computational mathematics projects, including NSF-funded initiatives. His work emphasizes interdisciplinary collaboration between mathematics and engineering. Labs/Teams: Leads computational algebraic geometry research groups at Notre Dame, focusing on software development (e.g., Bertini) and numerical methods innovation.
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.
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.
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.
