He Sun is a senior lecturer in Algorithms and Complexity in the School of Informatics, University of Edinburgh. He obtained his PhD (2009) at Fudan University, under the supervision of Hong Zhu. He held positions at the Max Planck Institute for Informatics from 2010 to 2015, and the University of Bristol from 2015 to 2017. His research interests range over the fields of algorithms, machine learning and data mining, applied probability and statistics, and matrix analysis. A continuing theme of his research is applying these techniques to designing efficient spectral algorithms for massive graphs and datasets, as well as studying their applications in different settings.
He Sun's main research focus at the Turing is to advance the understanding of fundamental spectral techniques, to improve the state-of-the-art of fundamental graph algorithms in more practical settings, and to implement and evaluate these algorithms on real-word datasets. This research plan consists of foundational, algorithmic and applied aspects as summarised below: (1) Advance the foundations of spectral graph theory through the connections between graphs and manifolds, and develop the spectral theory for directed graphs (2) Algorithmic studies for matrix sparsification and graph clustering, with applications in dynamic and streaming settings (3) Develop algorithmic libraries for fundamental spectral algorithms