@inproceedings{jourdanAlgorithmicKadisonSinger2022,
author = {Ben Jourdan and Peter Macgregor and He Sun},
title = {Is the Algorithmic Kadison-Singer Problem Hard?},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC'23)},
year = {2023}
}
Tech. Report
Spectral Toolkit of Algorithms for Graphs: Technical Report (1)
@misc{macgregor2023spectral,
title={Spectral Toolkit of Algorithms for Graphs: Technical Report (1)},
author={Peter Macgregor and He Sun},
year={2023},
eprint={2304.03170},
archivePrefix={arXiv},
primaryClass={cs.SI}
}
ICML 2022
A Tighter Analysis of Spectral Clustering, and Beyond
@inproceedings{macgregorTighterAnalysisSpectral2022,
title = {A Tighter Analysis of Spectral Clustering, and Beyond},
booktitle = {39th {{International Conference}} on {{Machine Learning}} ({{ICML}}'22)},
author = {Macgregor, Peter and Sun, He},
year = {2022},
pages = {14717--14742}
}
@inproceedings{macgregorFindingBipartiteComponents2021,
title = {Finding Bipartite Components in Hypergraphs},
booktitle = {34th {{Advances}} in {{Neural Information Processing Systems}} ({{NeurIPS}}'21)},
author = {Macgregor, Peter and Sun, He},
year = {2021},
pages = {7912--7923}
}
ICML 2021Oral
Local Algorithms for Finding Densely Connected Clusters
Peter Macgregor, PhD Thesis, University of Edinburgh, 2022
@phdthesis{macgregorLearningStructureClusters2022,
title = {On Learning the Structure of Clusters in Graphs},
author = {Macgregor, Peter},
year = {2022},
school = {University of Edinburgh}
}
Talks
Edinburgh LFCS 2022
MathWorks 2022
Beyond Symmetric Clusters: Finding Inter-Cluster Structure in
Graphs
Edinburgh LFCS 2023
How to Cluster a Million Data Points While the Kettle Boils