جستجوی استاد راهنمای دانشگاهی

Avelio Sepúlveda is an Assistant Professor in the Department of Mathematics at Universidad de Chile, where he has been affiliated since 2021. He previously held a Chair CMM–CNRS fellowship (2020–2021) and completed postdoctoral work at Université Lyon 1 (2017–2020). His education includes a PhD from ETH Zürich (supervised by Wendelin Werner), a Master's from Université d'Orsay, and an Engineering degree from Universidad de Chile. His research centers on probability theory and statistical physics , with emphases on Gaussian free fields, random planar maps, percolation theory, and topological phase transitions. Key investigations include the structure of 2D Gaussian free fields, scaling limits of decorated planar maps, and dynamic conditioning of Markov processes ( myopic conditioning ). His publications (2020–2025) predominantly explore probabilistic geometry, phase transitions, and field theory, with recurring themes in conformal invariance, scaling limits, and lattice models. Notable methodological contributions include novel algorithms for myopic processes and combinatorial characterizations of Markov properties in planar maps. Awards & Service: Chair CMM–CNRS of Excellence for Young Researchers (2020–2021) Associate Editor: Electronic Journal of Probability and Electronic Communications in Probability Advising & Collaborations: He mentors six PhD/Master's students (Pablo Araya, Paul Cahen, Damian Cid, Felipe Espinosa, Pablo Zúñiga, Tomás Laengle) and collaborates extensively with researchers globally, including Christophe Garban (ERC Vortex). He co-organizes the Seminario de Probabilidades de Chile and workshops (e.g., 2025 Topological Phase Transition workshop).

• Probability Theory
• Statistical Physics
• Random Geometry
• +۵ مورد دیگر

Jose A. Soto is an Associate Professor and Academic Chair of the Mathematical Engineering Department at the University of Chile. He is also an associated researcher at the Center for Mathematical Modeling. His research focuses on Combinatorics, Algorithms, and Combinatorial Optimization. Previously, he was a postdoc at TU-Berlin's Combinatorial Optimization & Graph Algorithms Group. He holds a PhD in Mathematics from MIT (2011) and an undergraduate degree in Mathematical Engineering from the University of Chile (2006). He has led multiple grants, including Fondecyt Project 1181180 on approximation algorithms and Fondef IDeA ID18I10250 for VRP optimization. He has collaborated internationally, including with the Max Planck Institute on fast approximation algorithms for massive datasets. His research spans topics like prophet inequalities, matroid secretary problems, and geometric optimization, with notable contributions in Mathematics of Operations Research, Journal of Machine Learning Research, and Algorithmica. He has advised numerous students and postdocs, including Krzysztof Fleszar and Kevin Schewior during the MPII-UChile collaboration. Teaching includes courses on Approximation Algorithms, Combinatorial Optimization, and Calculability/Computational Complexity. He has organized conferences like IPCO 2013 and participated in program committees for WADS 2021 and LATIN 2018.

• Combinatorics
• Algorithms
• Combinatorial Optimization