Random Walk Professors and Supervisors | ApplySharif

Find Academic Supervisors

Find and connect with academic supervisors, professors, and scholars for your research journey.

Showing 16-30 of 1,310 supervisors

Profile data may be stale. It is sourced from public faculty pages.

Aram HarrowView profile

Professor

Massachusetts Institute of TechnologyUnited States

Aram Harrow is a Professor of Physics at the Massachusetts Institute of Technology (MIT) , affiliated with the MIT Center for Theoretical Physics and MIT Center for Quantum Engineering . He focuses on quantum information science and quantum algorithms , with additional interests in representation theory and optimization . His recent work explores quantum computing applications in chemical physics and statistical mechanics . Undergraduate and graduate degrees in Physics at MIT Faculty positions: MIT (2013-present), University of Washington (2010-12), University of Bristol (2005-10) Research Interests: His work bridges quantum information theory and many-body physics , including: Quantum algorithm design for chemistry and optimization Quantum circuit complexity and t-designs Entanglement dynamics in quantum systems Quantum-classical hybrid computing models Key Publications: Recent articles demonstrate quantum speedups for biomolecular free energy calculations , Hamiltonian simulation , and jet clustering algorithms . His research combines quantum complexity theory with practical implementations on near-term quantum devices. Scientific Awards: 2023 Simons Investigator 2018 APS Bennett Award 2017 IEEE Best Paper Award 2016 Kavli Frontiers Fellow Mentorship: He advises current PhD students Shankar Balasubramanian , Angus Lowe , and Norah Tan , with 12 former advisees including Anand Natarajan and Saeed Mehraban . His 2026 recruitment seeks one new graduate student.

Official University Profile

Karsten BorgwardtView profile

Professor

ETH ZurichSwitzerland

Karsten Borgwardt is a Professor and Director of the Department of Machine Learning and Systems Biology at the Max Planck Institute of Biochemistry. He holds a PhD in Computer Science (2007) from LMU Munich and has held academic positions at ETH Zürich, Universität Tübingen, and the Max Planck Institutes in Tübingen. His research focuses on machine learning applications in biology and medicine, including biomarker discovery, personalized medicine, and systems biology. Education: PhD in Computer Science (2007), LMU Munich M.Sc. in Biology (2003), University of Oxford Diplom (M.Sc. equivalent) in Computer Science (2004), LMU Munich Research Interests: Development of machine learning algorithms for large biomedical datasets Pattern recognition in genomic and clinical data Applications in sepsis biomarkers, antimicrobial resistance prediction, and personalized medicine Grants & Projects: Scientific Coordinator of Marie Curie Networks (2013-2022) Swiss National Science Foundation Starting Grant (2014) Personalized Swiss Sepsis Study (CHF 5.3M, 2018) Awards: Krupp Award (2013), Golden Owl Teaching Award (2017), multiple 'Top 40 under 40' recognitions (2014-2016). Labs: Leads the Machine Learning and Systems Biology Department at MPI, collaborating with 22+ labs in sepsis research and international networks.

Official University Profile

Shirshendu GangulyView profile

Associate Professor

University of California, BerkeleyUnited States

Shirshendu Ganguly is an Associate Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on probability theory, statistical physics, and their applications, including percolation models, phase transitions, Markov chains, and random graphs. He holds a PhD in Mathematics from the University of Washington and has held postdoctoral positions at UC Berkeley. Ganguly has been recognized with the 2019 Sloan Research Fellowship. Education: PhD in Mathematics, University of Washington, 2011–2016 Miller Postdoctoral Fellow, UC Berkeley, 2016–2018 Research Interests: Probability Theory, Statistical Mechanics, Markov Chains, Random Graphs, Percolation Theory, Sparse Combinatorial Structures His work explores geometric and probabilistic phenomena in disordered systems, including polymer models, self-organized criticality, and random matrix theory. He has advised multiple PhD students and contributes to teaching advanced probability courses at Berkeley. Awards: 2019 Sloan Research Fellowship

Official University Profile

Daniel A. SpielmanView profile

Professor

Yale UniversityUnited States

Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.

Official University Profile

Roberta SinatraView profile

Professor

University of CopenhagenDenmark

Roberta Sinatra is a Professor in Social Data Science at the University of Copenhagen, with part-time affiliations at ITU Copenhagen, ISI Foundation (Italy), and CSH (Austria). She co-founded the NERDS Research Group at ITU and co-leads the Pioneer Centre for AI in Copenhagen. Research Interests: Her work spans computational social science, network science, and data science, focusing on fairness in AI, scientific careers, and human mobility. Recent projects include analyzing child protection algorithms and modeling urban bicycle networks. Scientific Awards: ERC Consolidator Grant Villum Young Investigator Grant Complex Systems Society Junior Prize DPG Young Scientist Award for Socio- and Econophysics Sapere Aude: Starting Grant Publications: Her research, often in top-tier venues like Nature and Science , explores interdisciplinary themes, including AI ethics, gender disparities in science, and social network dynamics. Labs & Teams: She leads research initiatives at the Center for Social Data Science (KU) and co-founded the NERDS Research Group at ITU, fostering international collaboration in network science and AI ethics.

Official University Profile

Marco CastronovoView profile

Assistant Professor

Barnard CollegeUnited States

Marco Castronovo serves as an Assistant Professor in the Mathematics Department at Columbia University, with his office located in Mathematics Hall 614. His academic work bridges continuous and discrete mathematical structures through the lens of symplectic geometry and topology. His research focuses on Symplectic Topology , particularly exploring symplectic structures as frameworks for quantization of classical invariants. Key interests include: Developing open-string versions of Schubert calculus Investigating cluster structures in positroid varieties Constructing Landau-Ginzburg models for Grassmannians Studying Lagrangian cobordisms and exotic tori Analyzing connections between Dubrovin spectra and Fukaya algebras His recent publications reveal a consistent trajectory toward unifying symplectic geometry with combinatorial algebraic structures, particularly through Grassmannian varieties and their mirror symmetric counterparts. The work demonstrates increasing sophistication in connecting Fukaya categories with cluster algebraic frameworks, while maintaining strong ties to quantum topological invariants. As an academic mentor, Castronovo supervises undergraduate researchers including B. Basson (Barnard Summer Research Institute) and S. Kesavan (Columbia Summer Research Fellowship). He actively contributes to the mathematical community through refereeing and co-organizing the Columbia SGGTC Seminar, demonstrating commitment to both research dissemination and academic service. His computational work manifests through three significant open-source projects: Posetroids for exploring Zariski closure orders in Grassmannians, DubrovinDynamics for visualizing spectral evolution in truncated Dubrovin operators, and ClusterExplorer for conducting random walks on cluster structures of Grassmannians. These tools have become valuable resources for researchers working at the intersection of symplectic geometry and combinatorics.

Official University Profile

Jonathan A. KelnerView profile

Professor

Massachusetts Institute of TechnologyUnited States

Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.

Official University Profile

Massimo MischiView profile

Professor

Eindhoven University of TechnologyNetherlands

Massimo Mischi is a Full Professor at the Faculty of Electrical Engineering of the Eindhoven University of Technology (TU/e) and chairs the Signal Processing Systems (SPS) Division , the largest division at TU/e with over 250 researchers. He founded the Biomedical Diagnostics (BM/d) Lab in 2012, which now includes 180 researchers and clinical/industrial advisors, focusing on biomedical signal processing for diagnostics and monitoring.

Official University Profile

David JerisonView profile

Professor

Massachusetts Institute of TechnologyUnited States

David Jerison is a Professor of Mathematics at the Massachusetts Institute of Technology (MIT), where he conducts research in Fourier analysis and partial differential equations. His work focuses primarily on free boundary problems and, more recently, on internal Diffusion Limited Aggregation (internal DLA), a stochastic growth model. He maintains an active research program with numerous publications in leading mathematical journals. Professor Jerison's research spans several interconnected areas of mathematical analysis. His primary interests include Fourier analysis and partial differential equations, with particular emphasis on free boundary problems. In recent years, he has expanded his research to include internal Diffusion Limited Aggregation, a stochastic growth model that has connections to probability theory and mathematical physics. His work often bridges geometric analysis, spectral theory, and probabilistic methods, demonstrating the deep connections between different branches of mathematics. Analysis of Professor Jerison's recent publications reveals a consistent focus on geometric aspects of partial differential equations, particularly free boundary problems. His research shows progression from classical PDE theory toward more stochastic and probabilistic approaches, as evidenced by his work on internal DLA. The publications demonstrate interdisciplinary connections between mathematical analysis, probability theory, and mathematical physics, with applications ranging from geometric measure theory to quantum mechanics. Professor Jerison is actively involved in teaching and mentoring at MIT. He has taught courses including Differential Equations (18.03), Fourier Analysis and Applications (18.103), and Differential Analysis (18.155). He also directs the Summer Program for Undergraduate Research (SPUR), which is exclusively for MIT undergraduates, and organizes the mathematics section of the Research Science Institute (RSI) for high school students. His teaching materials are available through MIT's Open Courseware platform, indicating his commitment to educational outreach and accessibility.

Official University Profile

Milos PopovicView profile

Professor

University of TorontoCanada

Milos Popovic is a Professor and Director at the Institute of Biomedical Engineering, University of Toronto, and serves as Senior Scientist and Director of Research at the Toronto Rehabilitation Institute (KITE), University Health Network. He holds the Toronto Rehab Chair in Spinal Cord Injury Research and Neural Engineering and co-leads the Centre for Research in Advanced Neural Implant Applications (CRANIA). His leadership spans academic, clinical, and translational research domains in neuroengineering and rehabilitation. His research focuses on neurorehabilitation, neuroprosthetics, functional electrical stimulation (FES), brain-machine interfaces, and assistive technologies . He develops physiological control systems and therapeutic robotics to restore motor function after spinal cord injury and stroke. His work integrates biomechanics, signal processing, and human-machine interfaces to innovate rehabilitative solutions. Dr. Popovic's recent publications emphasize electrical neuromodulation, FES therapy for motor recovery, deep brain stimulation for cognitive deficits, and wearable/implantable technologies . The articles reflect a strong trend toward closed-loop systems, translational research, and interdisciplinary innovation in neuroengineering and rehabilitation. Swiss National Science Foundation Technology Transfer Award - 1st place (1997) Engineering Medal for Research and Development, Professional Engineers of Ontario (2008) Elected to the College of Fellows, American Institute of Medical and Biological Engineering (2011) 1st Prize and Best Intellectual Property Award, TiEQuest Business Venture Competition (2012) Morris (Mickey) Milner Award for Assistive Technologies (2013) University of Toronto Inventor of the Year Award (2013) University Health Network’s Inventor of the Year Award (2015) Dr. Popovic has secured significant research funding and leads the Neural Engineering and Therapeutics team at KITE. He co-founded MyndTec Inc. and the Canadian National Spinal Cord Injury Conference, demonstrating strong mentorship, innovation, and national impact. He advises graduate students and postdoctoral fellows in biomedical engineering and rehabilitation sciences. He leads the Rehabilitation Engineering Laboratory and the Neural Engineering and Therapeutics Team at KITE, fostering collaboration across engineering, neuroscience, and clinical rehabilitation. His lab develops advanced neurotechnologies with a focus on clinical translation and commercialization.

Official University Profile

Martin LiebeckView profile

Professor

Imperial College LondonUnited Kingdom

Professor Martin Liebeck is a Professor of Pure Mathematics and Head of the Pure Mathematics Section at the Department of Mathematics, Imperial College London. He is affiliated with the Algebra and Algebraic Combinatorics research groups and is part of the Mathematics research and teaching staff within the Faculty of Natural Sciences. His research interests span Pure Mathematics, with a focus on group theory, algebraic combinatorics, Lie groups, and representation theory. His work often involves the structure and properties of finite simple groups, algebraic groups, and their applications to permutation groups and character theory. Recent publications explore topics such as the actions of simple groups, unipotent classes in algebraic groups, character ratios, and the classification of permutation groups. His work frequently intersects with combinatorial and algebraic structures, with implications for both theoretical and applied mathematics. Professor Liebeck’s contributions include foundational studies on group generation, covering numbers, and character bounds, reflecting his deep engagement with the interplay between algebraic structures and combinatorial problems. His research has been published in leading mathematics journals, and he maintains an active academic profile through his personal webpage at http://www.ma.ic.ac.uk/~mwl/ .

Official University Profile

W. Brent LindquistView profile

Professor

Texas Tech UniversityUnited States

W. Brent Lindquist is a Professor in the Department of Mathematics and Statistics at Texas Tech University, affiliated with the TTU Mathematical Finance Program. His contact details include office location in the Mathematics & Statistics building (Room 104), phone (+1 806 834 2348), and email brent.lindquist@ttu.edu. His research spans computational financial mathematics, porous media flow, neuroscience applications, and quantum electrodynamics. Key contributions include dynamic asset pricing with market microstructure integration, pore-scale flow modeling using 3D micro-tomography, automated neuron morphology identification, and QED computations for electron magnetic moments. Recent work emphasizes ESG factor incorporation into financial models. Analysis of 2023–2025 publications reveals a dominant focus on sustainable finance, particularly ESG-integrated option pricing and portfolio optimization. Methodologies include random forests for market microstructure analysis, skew random walks for volatility modeling, and Lévy processes for Bitcoin dynamics. Cross-cutting themes involve hedonic real estate models with ESG factors and unified asset pricing frameworks bridging classical finance theories.

Official University Profile

Ingo ScholtesView profile

Professor

Julius-Maximilians-Universität WürzburgGermany

Prof. Dr. Ingo Scholtes is Chair of Machine Learning for Complex Networks at Julius-Maximilians-Universität Würzburg's Center for Artificial Intelligence and Data Science (CAIDAS). His research spans network science, graph machine learning, and computational social science, with applications in software engineering, ecology, biology, and physics. He received a Juniorfellowship from the German Informatics Society (2014) and an SNSF Professorship (CHF 1.5Mio, 2018). Current affiliations: JMU Würzburg (since 2021), University of Zurich (2018-2024), Bergische Universität Wuppertal (2019-2021) Research focus: Higher-order network modeling, temporal graph analysis, AI for collaborative systems, causality-aware machine learning His recent publications demonstrate strong trends in temporal network analysis , graph neural networks for time-series, and higher-order models across software engineering and social science domains. He co-chairs multiple international workshops on complex networks and serves as associate editor for EPJ Data Science and Advances in Complex Systems. Key scientific contributions: Foundational work on higher-order network models published in Nature Physics Methodological innovations in temporal network visualization (HOTVis) and path-based analysis (pathpy) As both educator and organizer, he leads the Computational Social Science Section at GI e.V., mentors across disciplines, and develops tools like git2net for collaboration analysis. His work bridges theoretical foundations with practical applications in network science.

Official University Profile

David CroydonView profile

Associate Professor

Kyoto UniversityJapan

David Croydon is an Associate Professor at the Research Institute for Mathematical Sciences (RIMS), Kyoto University. His research focuses on probability theory, particularly diffusions on random fractals and scaling limits of random walks on random graphs. He also investigates discrete integrable systems with random initial conditions. Dr. Croydon's primary research interests span several areas of probability theory and mathematical physics. His work centers on diffusions on random fractals and how these processes can be constructed as scaling limits of related random walks on random graphs. He has made significant contributions to understanding random walks on critical structures including Galton-Watson trees, uniform spanning trees, and percolation clusters. More recently, he has developed a growing interest in the behavior of discrete integrable systems such as the box-ball system, particularly when started from random initial conditions. His research often bridges theoretical probability with applications in statistical physics and mathematical physics. Dr. Croydon's recent publications demonstrate a dual focus on theoretical probability and mathematical physics. His work on random walks spans various structures including binary trees, critical percolation clusters, and uniform spanning trees. He has made significant contributions to understanding aging phenomena, heat kernel fluctuations, and scaling limits in random media. Simultaneously, his research on discrete integrable systems explores the connections between probability theory and soliton theory, particularly through the lens of the box-ball system and related models. These two research strands converge in his investigations of scaling limits and invariant measures for complex stochastic systems. Dr. Croydon's scientific contributions have been recognized through publications in top-tier journals across probability theory and mathematical physics, though specific awards are not mentioned in the available information. Dr. Croydon has supervised several doctoral students to completion, including Adam Bowditch (2017), George Andriopoulos (2019), Eleanor Archer (2020), and Takumu Ooi (2024). He has also served in advisory roles for other students including John Sylvester (2017). His collaborative research spans multiple international institutions, suggesting involvement in various research grants supporting his work in probability theory and mathematical physics. While specific lab names aren't mentioned, Dr. Croydon is part of the vibrant probability theory research group at the Research Institute for Mathematical Sciences (RIMS) at Kyoto University. His extensive collaborations with researchers worldwide, particularly in the UK, France, and Japan, indicate active participation in international research networks focused on stochastic processes, random media, and discrete integrable systems.

Official University Profile

Seth LloydView profile

Professor

Massachusetts Institute of TechnologyUnited States

Seth Lloyd is a Professor in the Department of Mechanical Engineering at the Massachusetts Institute of Technology (MIT), with adjunct appointments at the Santa Fe Institute since 1988 and as a Fellow at the Institute for Scientific Interchange since 2000. His research spans quantum information science, quantum control theory, and complex systems analysis. His educational background includes: B.A. from Harvard University (1982) M. from the University of Cambridge (1984) Ph.D. from Rockefeller University (1988) Lloyd's work focuses on quantum computation, quantum communications, and quantum limits to control and sensing. He has pioneered research in quantum algorithms, quantum metrology, and applications of quantum information to complex biological and physical systems. His research bridges theoretical physics, computer science, and engineering, with over 200 publications and two patents in quantum information processing. Analysis of his recent publications reveals dominant trends in quantum machine learning, quantum metrology, and quantum communication protocols, with increasing interdisciplinary applications in quantum biology and quantum gravity. His work consistently explores fundamental limits of quantum information processing. His scientific awards include: Lindbergh Fellow (1994) Finmeccanica Professorship (1996) Edgerton Prize (2001) Fellow of the American Physical Society (2007) Quantum Communication, Measurement, and Computation Prize (2012) Lloyd serves on the editorial board of Quantum Information Processing and holds significant MIT service roles including Course 2 Undergraduate Committee coordinator and membership on the Institute Foreign Scholarships Committee. He teaches advanced courses in quantum information, dynamics, and computational methods, shaping the next generation of quantum scientists and engineers. As a member of the American Physical Society, he maintains active research collaborations across quantum information science, with ongoing work in quantum algorithms and quantum-enhanced sensing technologies.

Official University Profile