Fellowship主题: 图谱与动态图(2020-2024)
Efficient Spectral Algorithms for Massive and Dynamic Graphs is an EPSRC Fellowship awarded to He Sun (EP/T00729X/1). The fellowship studies advances of spectral graph theory, designs efficient spectral algorithms for massive and dynamic graphs, and develops an open-source library of spectral algorithms for graphs. With a total award of 1,507,133 pounds, the Fellowship runs from 2020 to 2024, and the current team consists of the PI, 2 Postdocs, and 2 PhD students. This presentation summaries the recent activities of the research group.
“当前team包含the PI, 2 Postdocs, and 2 PhD students
”
目前的成果
As part of the Fellowship, we are developing STAG, an open-source library of efficient spectral algorithms for graphs. STAG is the first such algorithmic library mainly written in C++, with a python wrapper around the underlying C++ library for python users. The source code of STAG can be found from our GitHub page, and will be updated actively. More information can be also found from the STAG website.
相关论文
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. with A. Bernstein, J. van den Brand, M. Gutenberg, D. Nanongkai, T. Saranurak, and A. Sidford (ICALP'22).
Conference version | arXiv version
A Tighter Analysis of Spectral Clustering, and Beyond. with P. Macgregor (ICML'22).
Conference version | arXiv version | Code
Hierarchical clustering: O(1)-approximation for well-clustered graphs. with B. Manghiuc (NeurIPS'21).
Conference version | arXiv version | Code
Finding bipartite components in hypergraphs. with P. Macgregor (NeurIPS'21).
Conference version | arXiv version | Code
Local algorithms for finding densely connected clusters. with P. Macgregor (ICML'21 for a long talk).
Conference version | arXiv version | Talk | Code
Higher-order spectral clustering of directed graphs. with S. Laenen (NeurIPS'20).
Conference version | arXiv version | Talk
Augmenting the Algebraic Connectivity of Graphs. with B. Manghiuc, and P. Peng (ESA'20)
Conference version | arXiv version
Hermitian matrices for clustering directed graphs: insights and applications. with M. Cucuringu, H. Li, and L. Zanetti (AISTATS'20).
Conference version | arXiv version
“更多内容请查看原文https://homepages.inf.ed.ac.uk/hsun4/project.html
”
PhD申请截止时间
Our group has a PhD scholarship available starting in September 2023. There is no restriction on the nationality of this scholarship holder, and we in particular welcome applicants outside Europe. For interested candidates, please send your CV and transcript to h.sun@ed.ac.uk by 15 February.
“2023年2月15
”
导师简介
He Sun is a Reader of Algorithms and Complexity in the School of Informatics, University of Edinburgh. He received his PhD from Fudan University in 2010, and worked at the Max Planck Institute for Informatics (2010-2014), UC Berkeley (2014), and University of Bristol (2015-2017), before joining the University of Edinburgh in 2017. His research interests include algorithmic spectral graph theory, unsupervised learning, computational geometry, and randomised algorithms. He has written over 40 papers and 1 book.
He received the President's Medal of Fudan University (2004), Shanghai Outstanding PhD Thesis Award (2010), and Simons-Berkeley Research Fellowship (2014). In 2020, he received a 5-year EPSRC Fellowship for developing advanced spectral algorithms and their open-source libraries, with a total award of 1.5+ million pounds.
