Random walk Professors and Supervisors | ApplySharif

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

استاد راهنما، استاد دانشگاه یا پژوهشگر مناسب برای مسیر پژوهشی‌تان را پیدا کنید و با او ارتباط بگیرید.

نمایش ۱-۱۵ از ۱٬۳۱۰ استاد راهنما

اطلاعات این پروفایل‌ها از صفحات عمومی دانشگاه‌ها جمع‌آوری شده و ممکن است به‌روز نباشد.

Werner Wendelinمشاهده پروفایل

استاد

Graz University of TechnologyAustria

Wendelin Werner is a renowned mathematician and currently the Rouse Ball Professor of Mathematics at the University of Cambridge (since 2023). Previously, he held professorships at ETH Zürich (2013–2023) and the University of Paris-Sud in Orsay (1997–2013). His research focuses on probability theory, mathematical physics, and complex analysis, particularly Schramm-Loewner evolution and conformal invariance. He has received prestigious awards, including the Fields Medal (2006), SIAM George Pólya Prize (2006), and Fermat Prize (2001). His work bridges stochastic processes and geometric structures, with implications for statistical mechanics and critical phenomena. Werner studied at the École Normale Supérieure (1987–1991) and earned his PhD from Université Paris VI under J. F. Le Gall (1993). Early career positions included postdoctoral research at Cambridge (1993–1995) and roles at CNRS (1991–1993, 1995–1997). His academic contributions span stochastic geometry, critical systems, and random curves, with seminal papers on loop measures, percolation, and SLE. He has delivered major lectures globally, including at the International Congress of Mathematicians (IMC 2006) and the College de France's Cours Peccot. Werner’s honors include membership in the French Academy of Sciences (2008), the Berlin-Brandenburg Academy (BBAW), and the German National Academy Leopoldina. He is also an honorary fellow of Gonville and Caius College, Cambridge (2009). His research has advanced understanding of universal scaling limits in two-dimensional models, earning recognition as a leader in probability and mathematical physics.

پروفایل رسمی دانشگاه

Amitabha Bagchiمشاهده پروفایل

استاد

University of Michigan-Ann ArborUnited States

Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.

پروفایل رسمی دانشگاه

Stanislav Smirnovمشاهده پروفایل

استاد

University of GenevaSwitzerland

Stanislav Smirnov is a Professor of Mathematics at the University of Geneva, where he has been a faculty member since 2003. He also holds a part-time position at the Chebyshev Laboratory of St. Petersburg State University. As Director of the National Centre of Competence in Research SwissMAP since 2014, he leads a major research initiative funded by the Swiss National Science Foundation. His education includes a mathematics degree from St. Petersburg State University (1992) and a PhD from the California Institute of Technology (1996). Prior to joining Geneva, he held positions at Yale University, the Institute for Advanced Study in Princeton, the Max Planck Institute in Bonn, and the Royal Institute of Technology in Stockholm. Professor Smirnov's research focuses on the mathematical foundations of statistical physics, with particular emphasis on conformal invariance in two-dimensional lattice models. His work has revolutionized our understanding of critical phenomena through rigorous mathematical approaches, establishing deep connections between probability theory, complex analysis, and statistical mechanics. He develops novel discrete complex analysis techniques to prove continuum limits of lattice models at criticality. His publication record shows consistent advancement in understanding random planar geometry, percolation theory, and the Ising model, with increasing attention to Liouville quantum gravity in recent years. His work bridges deep mathematical analysis with physical insights, often providing rigorous proofs for phenomena previously understood only through physical intuition. Fields Medal (2010) for the proof of conformal invariance of percolation and the planar Ising model in statistical physics As an advisor, Professor Smirnov has mentored doctoral students including Ekin Arikök and Nikolai Bobenko. He leads the ANALYSE, PHYSIQUE MATHÉMATIQUE ET PROBABILITÉS research group at the University of Geneva. His research is supported by major grants including the NCCR SwissMAP, European Research Council's AG COMPASP, and Swiss National Science Foundation grants 200020_143434 and 200020_141329. Professor Smirnov has organized numerous influential conferences, including the "Conformal maps from probability to physics" workshop at Monte Verità (2010) and multiple "Random Planar Geometry" meetings in Les Diablerets, fostering collaboration between mathematicians and physicists working on critical phenomena and random geometry.

پروفایل رسمی دانشگاه

Maya Ramanathمشاهده پروفایل

دانشیار

University of ToursFrance

Maya Ramanath is an Associate Professor in the Department of Computer Science and Engineering at Indian Institute of Technology (IIT) Delhi. She joined IIT Delhi in 2011 after a postdoctoral research stint at the Max-Planck Institute for Informatics in Germany. Her research interests focus on database systems, information retrieval, semantic web technologies, and knowledge graph construction and applications. Education: PhD in Computer Science, Indian Institute of Science, Bangalore M.Sc.(Engg.) in Computer Science, Indian Institute of Science, Bangalore B.E. in Computer Science and Engineering, Bangalore University, Bangalore Her recent work emphasizes efficient query processing over large-scale graphs, knowledge graph applications, and natural language interfaces for semantic data. Notable contributions include algorithms for reachability approximation in web-scale graphs, speculative query planning for knowledge graphs, and exploratory querying techniques. She has collaborated extensively on projects like NAGA, ESTHETE, and KlusTree, advancing the state of the art in graph-based data management and semantic search. Publications span conferences such as ICDE, ECIR, EDBT, and VLDB, reflecting a strong focus on database systems, graph algorithms, and semantic web applications. Her work bridges theoretical foundations with practical implementations, addressing scalability and efficiency challenges in modern data management systems. Research and advising activities include supervision of projects on distributed graph processing, query optimization, and knowledge representation. She has contributed to open-source tools like LegoDB and StatiX, and her lab focuses on interdisciplinary approaches to data-centric AI.

پروفایل رسمی دانشگاه

Smirnov Stanislavمشاهده پروفایل

استاد

Graz University of TechnologyAustria

Stanislav Smirnov is a Professor at the University of Geneva's Department of Mathematics since 2003 and Head of the Chebyshev Laboratory at St. Petersburg State University since 2010. He holds a Ph.D. from the California Institute of Technology (1996) and a B.Sc./M.Sc. from St. Petersburg State University (1992). His research focuses on mathematical physics, probability, complex analysis, and dynamical systems, with groundbreaking contributions to the understanding of critical phenomena in statistical physics. Key achievements include receiving the Fields Medal (2010), the highest honor in mathematics, for his work on percolation and the Ising model. He has organized major international conferences, such as the 'St. Petersburg School in Probability & Statistical Physics' (2012) and the '2D Statistical Physics Workshop' (2013). His academic career includes positions at Yale University, the Max-Planck Institute, and KTH Royal Institute of Technology. Education: Ph.D., Mathematics, California Institute of Technology (1996) B.Sc./M.Sc., Mathematics (with honors), St. Petersburg State University (1992) Awards: Fields Medal (2010) European Research Council Advanced Grants (2008, 2013) Rollo Davidson Prize (2002) Salem Prize (2001) Smirnov’s research bridges probability theory and complex analysis, with notable results on conformal invariance in two-dimensional models. His work has advanced understanding of critical exponents, percolation thresholds, and the universality of phase transitions. He advises doctoral students and collaborates internationally on projects funded by Swiss and European grants. He co-organized over 20 conferences worldwide, including plenary talks at the International Congress of Mathematicians (2006, 2010) and the World Congress in Probability and Statistics (2012). His lab fosters interdisciplinary research, linking mathematics to physics and computer science.

پروفایل رسمی دانشگاه

Ewain Gwynneمشاهده پروفایل

استاد

University of ChicagoUnited States

Ewain Gwynne is a Professor of Mathematics at the University of Chicago, affiliated with the Committee on Computational and Applied Mathematics (CCAM) and the Statistics Department. He previously held postdoctoral positions at the University of Cambridge and earned his Ph.D. from MIT in 2018 under Scott Sheffield. His research focuses on probability theory, particularly random geometric structures in statistical mechanics, including Schramm-Loewner evolution (SLE), Liouville quantum gravity (LQG), and random planar maps. Education: Ph.D. in Mathematics, MIT (2018); M.Sc., MIT (2015); B.Sc., Northwestern University (2013). Research Interests: Random geometric objects in statistical mechanics Liouville quantum gravity and its metric properties Random planar maps and their scaling limits SLE and its relationship with LQG Random walks on random planar maps Percolation and permutons His recent articles explore topics such as supercritical LQG, Gaussian curvature on random maps, and harmonic balls in LQG. He has advised multiple Ph.D. students and serves as an associate editor for Probability and Mathematical Physics . His work bridges probability theory, geometry, and mathematical physics, with applications to understanding critical phenomena in random systems.

پروفایل رسمی دانشگاه

Seth Lloydمشاهده پروفایل

استاد

University of CopenhagenDenmark

Seth Lloyd is a Professor of Mechanical Engineering at the Massachusetts Institute of Technology (MIT), where he directs the Center for Extreme Quantum Information Theory (xQIT). His work bridges theoretical physics, quantum information science, and complex systems theory. He has made significant contributions to the foundations of quantum computing and quantum information processing. Lloyd received his education from prestigious institutions: B.A. from Harvard College (1982) M.Phil from Cambridge University (1984) as a Marshall Scholar Ph.D. in Physics from Rockefeller University (1988) Lloyd's research focuses on quantum information science, particularly quantum computation and quantum communications. He has pioneered work in quantum analog computation, quantum error correction, and quantum metrology. His research explores how quantum mechanics can be harnessed for information processing tasks, with applications ranging from quantum computing to understanding biological processes like photosynthesis. Lloyd is also known for his work on complex systems and the relationship between information and physical systems, arguing that the universe itself can be viewed as a quantum computer. His publication record shows a clear progression from foundational quantum computing work to applications in quantum machine learning and quantum biology. The most recent articles reveal a strong focus on quantum algorithms for machine learning, quantum metrology, and the intersection of quantum mechanics with biological systems. His work on the HHL algorithm for solving linear systems has been particularly influential in quantum machine learning, though its practical advantages have been debated following Ewin Tang's classical algorithms. Lloyd has received numerous scientific honors: Lindbergh Fellow (1994) Finmeccanica Professorship (1996) Edgerton Prize (2001) Fellow of the American Physical Society (2007) Quantum Communication Award (2012) International Quantum Communication Award (2012) Throughout his career, Lloyd has mentored numerous students and researchers in quantum information science. He has secured significant research funding for his work in quantum computing and complex systems. His research has been supported by various foundations and government agencies interested in advancing quantum technologies. Lloyd has also been involved in interdisciplinary collaborations, particularly with biologists studying quantum effects in photosynthesis. Lloyd directs the Center for Extreme Quantum Information Theory (xQIT) at MIT, which brings together researchers from physics, computer science, and engineering to tackle fundamental challenges in quantum information processing. His lab has been at the forefront of developing theoretical frameworks for quantum computing and exploring practical implementations of quantum information protocols.

پروفایل رسمی دانشگاه

Andrew Childsمشاهده پروفایل

استاد

University of Maryland, College ParkUnited States

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

پروفایل رسمی دانشگاه

Zhuoyue Zhaoمشاهده پروفایل

استادیار

State University of New York at BuffaloUnited States

Zhuoyue Zhao is an Assistant Professor in the Department of Computer Science and Engineering at the University at Buffalo, School of Engineering and Applied Sciences. His office is located at 338I Davis Hall, Buffalo, NY 14260, and he can be reached at zzhao35@buffalo.edu or by phone at (716) 645-4735. Dr. Zhao received his PhD in Computer Science from the University of Utah in 2021, where he was advised by Prof. Feifei Li and Prof. Jeff Phillips. Prior to that, he earned his BS in Computer Science from Shanghai Jiao Tong University in 2016, where he was part of the prestigious ACM Class. During his undergraduate studies, he conducted research under Prof. Kenny Zhu and spent Fall 2015 as a research assistant at Hong Kong Polytechnic University supervised by Prof. Eric Lo. Dr. Zhao's research focuses on database management systems, with specific emphasis on traditional and approximate query processing, query optimization, database systems on modern hardware, transaction processing, indexing, and storage. His work bridges theoretical foundations with practical implementations, often resulting in systems that address real-world database challenges. He has made significant contributions to probabilistic query processing, transaction scheduling, and learned indexing techniques. His recent publications demonstrate a clear trajectory toward optimizing database performance in hybrid transactional/analytical processing environments. His research increasingly integrates systems techniques with machine learning approaches, particularly in the area of learned indexes. There's also a strong focus on making database operations more efficient through innovative scheduling mechanisms and query processing techniques that can handle concurrent updates. Google PhD Fellowship (2019-2021) Best Paper Award at SIGMOD 2016 for "Wander Join: Online Aggregation via Random Walks" Best Paper Award at SIGMOD 2025 for "Low-Latency Transaction Scheduling via Userspace Interrupts" Dr. Zhao currently advises several PhD students including Yunnan Yu, Congying Wang, Gaoxiang Liu (co-advised with Prof. Ziming Zhao), and Zhuoran Li. He has successfully guided MS student Nithin Sastry Tellapuri to graduation (Fall 2023), who is now employed at AirPay. His research is supported by significant funding including an NSF CAREER award (#2339596) totaling $599,977 for research on "Speedy and Reliable Approximate Queries in Hybrid Transactional/Analytical Systems" (2024-2029) and an unrestricted Google gift of $30,000 (2021). Dr. Zhao leads the ADBLab research group at UB, where students work on cutting-edge database systems research. His lab focuses on building practical database systems that address real-world challenges in query processing, transaction management, and indexing. The lab maintains strong connections with industry partners and regularly contributes to open-source database projects.

پروفایل رسمی دانشگاه

Alexander Gorodnikمشاهده پروفایل

استاد

University of ZurichSwitzerland

Alexander Gorodnik is a Professor of Mathematics at the University of Zurich, focusing on the interplay between dynamical systems and number theory. His work bridges ergodic theory, homogeneous dynamics, and Diophantine approximation, with applications to arithmetic counting problems and geometric distribution of lattice orbits. Current lectures include MAT121: Analysis I and MAT221: Analysis III at the University of Zurich Co-author of the book The ergodic theory of lattice subgroups (Princeton University Press, 2010) Editor of the journal Ergodic Theory and Dynamical Systems His research explores Diophantine approximation through dynamical systems, investigating how orbits of group actions distribute in homogeneous spaces. Key topics include mixing properties , central limit theorems , and metric theorems for multiplicative approximation. Recent publications address automorphic density estimates , discrepancy in intrinsic Diophantine approximation , and effective equidistribution of translated measures. His work often employs tools from representation theory and spectral analysis . Current working group members include Zhiyuan Deng , Zouhair Ouaggag , and Yuval Yifrach . He has taught courses at institutions in Zurich, Bristol, Princeton, and Mumbai, with lecture materials covering topics from ergodic theorems to Každan's property (T) .

پروفایل رسمی دانشگاه

Nina Gantertمشاهده پروفایل

استاد

Technical University of MunichGermany

Prof. Dr. Nina Gantert is a distinguished Professor of Probability Theory at the Technical University of Munich (TUM) , affiliated with the TUM School of Computation, Information and Technology . She has held faculty positions at Karlsruhe Institute of Technology and the University of Münster prior to joining TUM in 2011. Her research focuses on probability theory , particularly stochastic processes , large deviations , and random media . She investigates random walks in random environments as models for transport in disordered systems and explores applications in physics and biology . Recent publications highlight her work on branching random walks , mixing times , biased random walks , and large deviation principles for complex stochastic systems. She has co-authored studies on random walks in dynamical percolation , interacting edge-reinforced processes , and extremal point processes in branching models. Scientific Awards: Elected fellow of the IMS (2016) Her academic career spans institutions including ETH Zürich, University of Bonn, Technical University of Berlin, and TUM. She has supervised numerous Bachelor’s and Master’s theses on topics ranging from mixing time analysis to percolation theory , often collaborating with international co-authors.

پروفایل رسمی دانشگاه

David Bindelمشاهده پروفایل

دانشیار

Cornell UniversityUnited States

David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.

پروفایل رسمی دانشگاه

Illya V. Hicksمشاهده پروفایل

استاد

Rice UniversityUnited States

Illya V. Hicks is a Professor in the Computational and Applied Mathematics Department at Rice University. He holds a PhD from Rice University (2000) and a BS from Texas State University (1995). His research focuses on combinatorial optimization, integer programming, graph theory, and matroid theory, with applications in social networks, cancer treatment, and network design. He has advised numerous doctoral, post-doctoral, and masters students. Education: PhD and MA in Computational and Applied Mathematics, Rice University, 2000 BS in Mathematics, Texas State University, 1995 Research Interests: Utilizing graph decomposition techniques to solve NP-complete problems, including branch decompositions and matroid circuit problems. Applications include sensor network design, healthcare logistics, and algorithmic graph theory. Awards: Recognized with the 2015 Presidential Mentoring Award (Rice University), 2010 Forum Moving Spirit Award (INFORMS), and the 2005 Optimization Prize for Young Researchers. Grants and Projects: Includes NSF-funded research on branch decomposition techniques, submodular optimization, and healthcare service distribution. Active in promoting minority participation in operations research through travel grants and mentoring initiatives. Labs/Teams: Engaged in collaborative research on graph algorithms, combinatorial optimization, and interdisciplinary applications in healthcare and engineering.

پروفایل رسمی دانشگاه

Harry Hyungryul Baikمشاهده پروفایل

دانشیار

Yale UniversityUnited States

Prof. Harry Hyungryul Baik is a Tenured Associate Professor at KAIST's Department of Mathematical Sciences since 2017. He holds a PhD from Cornell University (2014) and a B.S. from KAIST (2009), advised by William Thurston, John Hubbard, and Dylan Thurston. His research focuses on geometric topology, geometric group theory, and low-dimensional topology, with notable contributions to mapping class groups, Kleinian groups, and Teichmüller theory. Education: PhD in Mathematics (Cornell, 2014), B.S. in Mathematics (KAIST, 2009). Key research areas include asymptotic translation lengths, laminar groups, and circular orders of groups. He co-leads the KAIST-KIAS joint research group 2K-GATE as Director, emphasizing collaboration between topologists. Research highlights: Characterization of Fuchsian groups via laminations, unsmoothability of mapping class group actions on 1-manifolds, and exponential torsion growth in random 3-manifolds. His work bridges topology with dynamical systems and geometric group theory, often involving collaborations with institutions like KIAS and MPIM. Awards include the Sangsan Prize (2018), Young-KAST membership (2020–2023), and multiple grants from Samsung and POSCO. He advises 7 PhD students and has mentored 15+ alumni, many of whom hold postdoc positions globally. His lab actively hosts conferences like the KAIST Geometric Topology Fair. Labs/Teams: Director of 2K-GATE (KAIST-KIAS), core member of the KAIST Topology Research Group, collaborator with international networks including the Harvard-MIT-Princeton topology axis.

پروفایل رسمی دانشگاه

Brett Kolesnikمشاهده پروفایل

پژوهشگر ارشد

University of WarwickUnited Kingdom

Brett Kolesnik is a Research Fellow in the Department of Statistics at the University of Warwick. His research focuses on probability theory, random structures, bootstrap percolation, and interactions with combinatorics. He has held postdoctoral fellowships at UC Berkeley, San Diego, and the University of Oxford, and was a Senior Demy at Magdalen College. His work includes organizing workshops on bootstrap percolation and collaborating with leading researchers in probability and combinatorics. Education: PhD in Mathematics from the University of British Columbia (advised by Omer Angel). Notable awards include the NSERC Postdoctoral Fellowship and the Florence Nightingale Bicentennial Fellowship in Statistics. Research interests span bootstrap percolation models, random graph dynamics, and stochastic processes. Recent work includes studies on Brownian map geometry, tournament score sequences, and Coxeter group structures. Selected articles explore topics such as critical beta-splitting processes, Catalan percolation, and random walks on algebraic structures. His publications appear in top journals like Electronic Journal of Probability and Annals of Applied Probability . Awards include the Florence Nightingale Fellowship and NSERC Postdoctoral Fellowship. Professional involvement includes organizing the 2024 BIRS workshop on Bootstrap Percolation and contributing to interdisciplinary collaborations in probability and combinatorics.

پروفایل رسمی دانشگاه

فقط ۷۵۰ نتیجه اول نمایش داده می‌شود. برای رسیدن به نتایج دقیق‌تر، جست‌وجو را با فیلترها محدودتر کنید.