Nothing Special   »   [go: up one dir, main page]

Computer Laboratory

Luca Zanetti

I am a Research Associate at the Department of Computer Science and Technology working with Thomas Sauerwald.

Before coming to Cambridge I was a PhD student at the University of Bristol under the supervision of He Sun.


Contact Details


Dr Luca Zanetti
University of Cambridge
Computer Laboratory
15 JJ Thomson Avenue
Cambridge CB3 0FD
United Kingdom

Email: firstname.lastname at cl.cam.ac.uk
Office: FC01

Research Interests


  • Spectral graph theory (with applications to algorithm design and machine learning)
  • Unsupervised and semi-supervised learning on graphs
  • Randomised and distributed algorithms
  • Markov chains

Publications


  • Hermitian matrices for clustering directed graphs: insights and applications (with Mihai Cucuringu, Huan Li, and He Sun)
    AISTATS 2020 (arXiv)
  • Distributed Graph Clustering and Sparsification (with He Sun)
    ACM Transactions on Parallel Computing 2019 (Journal, arXiv)
  • Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem (with Huan Li and He Sun)
    ESA 2019 (arXiv)
  • Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities (with Thomas Sauerwald)
    ICALP 2019 (arXiv)
  • Partitioning Well-Clustered Graphs: Spectral Clustering Works! (with He Sun and Richard Peng)
    SIAM Journal on Computing 2017 and COLT 2015 (Journal, arXiv)

Program committees


  • SPAA 2020, IJCAI 2020

Recent talks


  • Conference talk at ESA'19. Title: Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem (Munich, September 2019)
  • Contributed talk at the 19th International Conference on Random Structures and Algorithms. Title: Random walks on Dynamic Graphs (Zurich, July 2019)
  • Conference talk at ICALP'19. Title: Random walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities (Patras, July 2019)
  • Contributed talk at the Scottish Combinatorics Meeting. Title: Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem (Edinburgh, April 2019)
  • Invited talk at the conference on Analysis of and Analysis on Networks. Title: Random walks on Dynamic Graphs (Middlesbrough, March 2019)

Teaching


  • Lent term 2019/20: Part II course Probability and Computation
  • Lent term 2019/20: Part III/MPhil course Advanced topics in machine learning and natural language processing (slides)
  • Lent term 2018/19: Part II course Probability and Computation
  • Lent term 2018/19: Part III/MPhil course Machine Learning
  • Lent term 2017/18: Part III/MPhil course Machine Learning and Algorithms for Data Mining