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

Konstantin (Kostia) M. Zuevمشاهده پروفایل

استاد آموزشی

• Network Science
• Applied Probability
• Computational Statistics
• +۴ مورد دیگر

Dr. Konstantin (Kostia) M. Zuev serves as Teaching Professor in the Computing + Mathematical Sciences Department at California Institute of Technology , where he has made significant contributions to network science and computational statistics since 2016. His dual PhDs in Mathematics (Moscow State University, 2008) and Civil Engineering (HKUST, 2009) underpin his interdisciplinary research spanning differential geometry, stochastic simulation, and network dynamics. Education PhD in Mathematics, Lomonosov Moscow State University (2008) PhD in Civil Engineering, Hong Kong University of Science & Technology (2009) His research focuses on network science , particularly course-prerequisite networks and complex financial systems , with recent work extending to network navigability in cosmological models and rare event simulation. Over his career, he has developed innovative Bayesian inference methods and geometric preferential attachment theories while maintaining active collaborations across mathematics, physics, and biomedical domains. Recent publications highlight network analysis in education ( 2023 ), hyperbolic graph theory ( 2024 ), and pandemic-informed cancer mortality studies ( 2023 ). His 15 most recent articles demonstrate methodological innovations across disciplines including statistics, physics, finance, and cosmology. Scientific recognition includes Humboldt Research Fellowship (2021) Carver Mead Seed Fund Grant (2023) ASCIT Teaching Award (2018, 2023) Northrop Grumman Teaching Excellence Prize (2019) As Graduate Option Representative for Information and Data Sciences at Caltech and faculty advisor for multiple student organizations including the Caltech Karate Club and Caltech Chess Club , he actively bridges academic rigor with community engagement through outreach initiatives like the virtual math education channel and university math circles for K-12 students.

Asaf Ferberمشاهده پروفایل

استادیار

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +۱ مورد دیگر

Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.

Marco Castronovoمشاهده پروفایل

استادیار

• Symplectic Topology
• Mirror Symmetry
• Cluster Algebras
• +۳ مورد دیگر

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.

• Cryptography
• Post-Quantum Cryptography
• Elliptic Curve Cryptography
• +۳ مورد دیگر

David Jao is a Professor in the Department of Combinatorics and Optimization at the University of Waterloo. His research focuses on post-quantum cryptography, particularly leveraging isogenies of supersingular elliptic curves for secure cryptographic protocols. He is renowned for co-developing the Supersingular Isogeny Key Encapsulation (SIKE) protocol, a leading candidate for post-quantum cryptography standards. His work spans theoretical foundations and practical implementations, including optimizing isogeny-based systems for embedded devices and ARM processors. Research interests include isogeny-based cryptosystems, elliptic curve cryptography, zero-knowledge proofs, and cryptographic security against quantum attacks. He explores applications of expander graphs and Ramanujan graphs in cryptography, alongside algorithmic improvements for cryptographic protocols such as SIDH (Supersingular Isogeny Diffie-Hellman). Key contributions include advancements in key compression techniques for SIKE, side-channel attack mitigation, and formalizing security models for post-quantum key exchange. His publications analyze cryptographic hardness assumptions, such as the discrete logarithm problem in finite groups and the semidirect product structure in isogeny-based systems. Jao’s work bridges theoretical mathematics and applied cryptography, with a focus on ensuring practical security in next-generation cryptographic systems. His research addresses challenges in quantum-resistant authentication, key establishment, and digital signatures, often emphasizing efficiency and resistance to both classical and quantum attacks.

W. Brent Lindquistمشاهده پروفایل

استاد

• Computational Finance
• Financial Mathematics
• Porous Media Flow
• +۲ مورد دیگر

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.

Sonia Petroneمشاهده پروفایل

استاد

• Bayesian Statistics
• Predictive Modeling
• Bayesian Nonparametrics
• +۱ مورد دیگر

Dr. Sonia Petrone is a Full Professor of Statistics at Bocconi University's Department of Decision Sciences. She earned her PhD in Statistics from Bocconi University and has held academic positions at the University of Pavia and University of Insubria before joining Bocconi. Her extensive international experience includes research visits across North America, Latin America, Europe, India, and Russia. Her research specializes in Bayesian statistics, with contributions to foundational theory, predictive modeling, Bayesian nonparametrics, and stochastic processes. She currently directs the Bocconi Summer School in Advanced Statistics and Probability and previously led the PhD program in Statistics (2011-2018). Her research portfolio demonstrates consistent focus on Bayesian nonparametric methods, predictive modeling, and applications to complex data structures. Recent work explores urn processes, time series analysis, and network modeling using innovative Bayesian approaches. Awards & Honors: IMS Medallion Lecture Award (2018) ISBA Foundational Lecture Award (2016) Fellow of International Society for Bayesian Analysis Fellow of Institute of Mathematical Statistics Fellow of European Laboratory for Intelligent Systems Fellow of Bocconi Institute of Data Science She has held editorial leadership positions as Editor of Statistical Science (2020-2022) and Bayesian Analysis (2010-2014), and served as President of the International Society for Bayesian Analysis (2014).

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

دانشیار

• Probability theory
• Diffusions on random fractals
• Scaling limits
• +۵ مورد دیگر

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.

Aaron Smithمشاهده پروفایل

دانشیار

• Applied Probability
• Computational Statistics
• Monte Carlo Methods
• +۳ مورد دیگر

Aaron Smith is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa, affiliated with the Faculty of Science. He holds a PhD from Stanford University. His research focuses on applied probability, computational statistics, Monte Carlo methods, and Markov chains, with an emphasis on advancing theoretical understanding and practical applications of these methodologies. Dr. Smith's work includes contributions to community detection algorithms, Markov chain mixing times, and synthetic health data generation. His recent publications explore topics such as nonstandard Dirichlet form representations, perturbation analysis of MCMC algorithms, and sparse Bayesian multidimensional scaling. He advises students in applied probability and has supervised postdoctoral researchers in related fields. His research interests span a wide range of topics, including stochastic processes, statistical inference, and algorithm design. He is particularly known for his analysis of convergence rates in Markov chains and the development of efficient sampling techniques for complex models. His interdisciplinary work bridges theoretical mathematics and practical computational challenges in data science and healthcare. Dr. Smith collaborates on projects involving synthetic data frameworks for privacy-preserving applications and has contributed to foundational work on mixing times and perturbation effects in stochastic systems.

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

استاد

• Combinatorics
• Probability
• Algorithms
• +۳ مورد دیگر

Professor Alexander Scott is a faculty member at the University of Oxford, holding positions as Professor of Mathematics and Dominic Welsh Tutor in Mathematics at Merton College. His research focuses on combinatorics, probability, algorithms, and graph theory, with a particular interest in the interplay between local and global structures in networks. He has organized the Oxford Combinatorics Seminar and co-founded the online Oxford Discrete Mathematics and Probability Seminar, fostering collaboration in these fields. Professor Scott’s work bridges theoretical foundations with applications in statistical physics and algorithmic design. He has supervised numerous graduate students in combinatorics and regularly teaches undergraduate courses in analysis and discrete mathematics. His contributions include advancements in extremal graph theory, probabilistic methods, and structural combinatorics, with over 150 publications in prestigious journals. He actively organizes academic events such as the annual One-Day Meeting in Combinatorics, hosting speakers from around the world. Despite the absence of explicit awards noted, his prolific research output and academic leadership reflect significant contributions to the field. His current interests continue to explore the Erdős-Hajnal conjecture, induced subgraph densities, and algorithmic challenges in combinatorial structures.

Ben Greenمشاهده پروفایل

استاد

• Additive Combinatorics
• Analytic Number Theory
• Harmonic Analysis
• +۳ مورد دیگر

Ben Green is the Waynflete Professor of Pure Mathematics at the University of Oxford and a Fellow of Magdalen College. His work spans additive combinatorics, analytic number theory, harmonic analysis, ergodic theory, discrete geometry, and group theory, with a focus on interdisciplinary approaches. Research Interests: Additive combinatorics and its applications to primes Analytic number theory (prime distribution, L-functions) Harmonic analysis (Fourier methods, spectral theory) Ergodic theory and its combinatorial applications Discrete geometry (ordinary lines, convex structures) Group theory (approximate groups, expansion) Article Trends: His recent work emphasizes multiplicative functions, Ramsey-type problems in number theory, expansion in finite groups, and extremal set theory. Themes include prime gaps, arithmetic progressions, and interactions between analysis and algebra. Scientific Awards: Clay Research Award (2004) Ostrowski Prize (2005) Whitehead Prize (2005) Leverhulme Prize (2007) European Mathematical Society Prize (2008) Royal Society Fellow (2010) Sylvester Medal (2014) Senior Whitehead Prize (2019) Advising: Ben has supervised numerous D.Phil students across additive combinatorics, analytic number theory, and related fields. Past students hold postdoctoral and academic positions globally.

Jan de Gierمشاهده پروفایل

استاد

• Mathematical Physics
• Statistical Mechanics
• Solvable Lattice Models
• +۳ مورد دیگر

Jan de Gier is a Professor at the School of Mathematics and Statistics, The University of Melbourne . He is also the Founding Director of MATRIX , Australia’s residential research institute in the mathematical sciences, and a former Deputy Director and Chief Investigator in the Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers (ACEMS) . Additionally, he co-founded the Australian and New Zealand Association for Mathematical Physics (ANZAMP) in 2011 and served as its inaugural Chair. His research focuses on solvable lattice models at the intersection of mathematical physics and statistical mechanics . Key areas include the application of quantum integrability , algebraic structures like the Yang-Baxter equation, Hecke algebras, and quantum groups, as well as analytical methods such as complex analysis and elliptic curves. His work bridges pure and applied mathematics through connections between enumerative combinatorics , representation theory , and real-world phenomena like traffic flow modeling via exclusion processes . The 15 most recent articles reflect his expertise in integrable systems , non-equilibrium statistical mechanics , and algebraic combinatorics . Topics span Macdonald polynomials , stochastic duality , quantum spin chains , and traffic modeling , with methodologies involving matrix product forms , exact solutions , and critical phenomena analysis. He has contributed to editorial efforts through the AustMS Gazette and MATRIX Annals, and has been involved in public science communication via opinion pieces on mathematics funding and applications. His work emphasizes the importance of fundamental research in driving technological innovation, as highlighted in media articles discussing pi calculation , zero-knowledge proofs , and mathematics education .

Melanie Weberمشاهده پروفایل

استادیار

• Geometric Machine Learning
• Optimization on Manifolds
• Non-Euclidean Machine Learning
• +۳ مورد دیگر

Melanie Weber is an Assistant Professor of Applied Mathematics and Computer Science at Harvard University's John A. Paulson School of Engineering and Applied Sciences (SEAS), leading the Geometric Machine Learning Group. Her research focuses on leveraging geometric structures in data for designing efficient machine learning and optimization algorithms with theoretical guarantees. She holds a PhD from Princeton University (2021) and has held fellowships at the Mathematical Institute of Oxford, Brasenose College, and the Simons Institute. Her work bridges geometry, optimization, and machine learning, with funding from NSF, Sloan Foundation, and Harvard initiatives. Education : PhD in Applied Mathematics, Princeton University (2021) BSc/MSc in Mathematics and Physics, University of Leipzig (2016) Research Interests : Dr. Weber's research integrates geometric principles into machine learning and optimization, focusing on non-Euclidean spaces, graph structures, and manifold-based methods. Key areas include optimization on Riemannian manifolds, curvature-based analysis (e.g., Ricci curvature), and developing algorithms resilient to data geometry challenges like over-smoothing in graph neural networks. Her work emphasizes theoretical foundations while addressing practical scalability in high-dimensional data. Awards & Recognition : 2024 Sloan Research Fellowship 2023 Leslie Fox Prize in Numerical Analysis 2023 NSF Grant for Geometric Optimization Grants & Funding : Supported by National Science Foundation (NSF), Alfred P. Sloan Foundation, Aramont Foundation, Harvard Dean’s Fund, and Harvard Data Science Initiative. Labs & Collaborations : Leads the Geometric Machine Learning Group at SEAS, collaborating with institutions like MIT, Max Planck Institute, and industry labs (Facebook, Google, Microsoft). Active in organizing workshops on geometric methods and curvature analysis.

Shantanu Duttمشاهده پروفایل

استاد

• VLSI CAD
• Discrete Optimization
• FPGA Testing and Trusted Design
• +۲ مورد دیگر

Shantanu Dutt is a full Professor in the Department of Electrical and Computer Engineering at the University of Illinois at Chicago , located in Chicago, IL. His office is in 930 SEO at 851 S. Morgan St, and he can be reached at dutt@uic.edu . Education Ph.D. in Computer Science and Engineering, University of Michigan, Ann Arbor (1990) M.Tech. in Computer Engineering, Indian Institute of Technology Kharagpur (1984) B.E. in Electronics and Communication Engineering, Maharaja Sayajirao University of Baroda (1983) Research Interests Professor Dutt’s research agenda centers on VLSI Computer-Aided Design (CAD) , with particular emphasis on physical design and incremental synthesis targeting both ASICs and FPGAs. He explores discrete optimization techniques to solve placement, routing, and partitioning problems. Another major thrust is FPGA built-in self-test (BIST) and trusted design , ensuring provable diagnosability and security against hardware Trojans. He also investigates fault-tolerant computing at both chip and system levels, and develops parallel and distributed computing algorithms for scalable performance. Scientific Awards 1996 Best Paper Award , ACM/IEEE Design Automation Conference, for “A probability-based approach to VLSI circuit partitioning” 1995 Most Influential Paper Award , Fault-Tolerant Computing Symposium, for “Design and reconfiguration strategies for near-optimal k-fault-tolerant tree architectures” Research Impact and Funding Professor Dutt has published extensively in top-tier journals (IEEE TVLSI, ACM TRETS, IEEE TCAD) and premier conferences (ICCAD, DAC, DATE, FTCS). His work has shaped incremental placement, timing-driven routing, FPGA security, and fault-tolerant multiprocessor architectures. While specific grant numbers are not listed, the breadth and longevity of his publication record indicate sustained funding from NSF, industry, and other agencies. Laboratory and Collaborations Although no formal laboratory name is provided, Professor Dutt’s research is conducted within the ECE department’s VLSI CAD and Fault-Tolerance groups, collaborating with graduate students and colleagues across the US and internationally.

Gerold Alsmeyerمشاهده پروفایل

استاد

• Theory of stochastic processes
• Stochastic fixed-point equations
• Iterated function systems
• +۷ مورد دیگر

Prof. Dr. Gerold Alsmeyer is a faculty member at the Institute of Mathematical Stochastics, Department of Mathematics and Computer Science, University of Münster. He is an active researcher with a focus on stochastic processes, particularly stochastic fixed-point equations and iterated function systems. His work is supported by his role as an Investigator in Mathematics Münster in the project EXC 2044 - C1: Evolution and asymptotics. His primary research interests include the theory of stochastic processes, branching processes, Markov random walks, renewal theory, and the asymptotic analysis of random structures such as random trees and polytopes. He has made significant contributions to the understanding of fluctuation theory, perpetuities, and the smoothing transform. His recent publications (2017–2023) reveal a sustained focus on theoretical probability, with recurring themes in random difference equations, iterated function systems, and limit theorems for stochastic processes. The work spans pure mathematical theory and applications in mathematical biology and combinatorics, indicating a broad yet deep research profile. Prof. Alsmeyer has supervised numerous doctoral and master’s students, including Viet Hung Hoang, Christopher Eick, Philipp Godland, and Fabian Buckmann, whose dissertations cover topics in branching processes, random walks, and stochastic fixed-point equations. He has no listed scientific awards in the provided texts. He teaches courses in probability theory, mathematical statistics, branching processes, and stochastic recursion equations, demonstrating a strong commitment to academic mentoring and education.

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

استاد

• Combinatorics
• Theoretical Computer Science
• Bioinformatics
• +۶ مورد دیگر

Nathan (Nati) Linial is a Professor at the School of Computer Science and Engineering at the Hebrew University of Jerusalem, where he has been a faculty member since completing his postdoctoral period at UCLA. He earned his undergraduate degree in mathematics from the Technion and his PhD in graph theory from the Hebrew University. His research spans multiple areas of theoretical computer science and mathematics, with primary focus on combinatorics, theoretical computer science, and bioinformatics. Linial's work has made significant contributions to high-dimensional combinatorics, expander graphs, metric embeddings, and computational molecular biology. His research often bridges geometry, analysis, and combinatorial structures, demonstrating deep connections between seemingly disparate mathematical fields. Linial's recent publications reveal a strong trend toward high-dimensional combinatorial structures, including simplicial complexes, hypertrees, and high-dimensional permutations. His work frequently employs probabilistic methods, linear programming techniques, and geometric approaches to solve fundamental combinatorial problems. The breadth of his research is evident in both pure mathematical contributions and applications to computational biology. Fellow of the American Mathematical Society ISI Highly Cited Researcher Conant Prize (2008) for the influential survey paper "Expander graphs and their applications" Linial has served on the editorial boards of several prestigious journals including the Israel Journal of Mathematics (as Chief Editor 2013-2017), Random Structures and Algorithms, and Combinatorica. His academic leadership extends to organizing conferences and workshops in combinatorics and theoretical computer science. He has mentored numerous students whose work spans theoretical computer science, combinatorics, and computational biology. Linial is associated with research projects including ProtoNet (for protein sequence classification) and EVEREST (for evolutionary conserved protein domains), demonstrating his commitment to interdisciplinary research that bridges computer science with molecular biology.