Mountain ridge above clouds

Luca Zanetti

Lecturer at the Department of Mathematical Sciences, University of Bath
Deputy Director at the Institute for Mathematical Innovation

Research interests

I am interested in Markov chains, spectral graph theory, and their applications to the design and analysis of algorithms.

Publications

Matrix concentration inequalities for time-inhomogeneous Markov chains

L. Zanetti. Submitted to publication.

Graphical Balanced Allocations with Removals

S. Olesker-Taylor, T. Sauerwald, L. Zanetti. To appear in 37th International Conference / Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2026).

An Improved and Generalised Analysis for Spectral Clustering

G. Tyler, L. Zanetti. In Proceedings of the Fourth Learning on Graphs Conference (LoG 2025), PMLR 269, 2025.

Percolation and localization: sub-leading eigenvalues of the nonbacktracking matrix

J. Martin, T. Rogers, L. Zanetti. Journal of Complex Networks 13(5), 2025.

Wireless Network Topology Inference: A Markov Chains Approach

J. Martin, T. Pryer, L. Zanetti. IEEE Open Journal of the Communications Society 6, 5584-5598, 2025.

Cycle-free polytopal mesh sweeping for Boltzmann transport

A. Calloo, M. Evans, H. Lockyer, F. Madiot, T. Pryer, L. Zanetti. Numerical Algorithms 101, 2157-2180, 2026.

An analysis of Elo rating systems via Markov chains

S. Olesker-Taylor, L. Zanetti. Advances in Neural Information Processing Systems 37 (NeurIPS 2024), 2024.

An iterative spectral algorithm for digraph clustering

J. Martin, T. Rogers, L. Zanetti. Journal of Complex Networks 12(2), 2024.

Geometric bounds on the fastest mixing Markov chain

S. Olesker-Taylor, L. Zanetti. Probability Theory and Related Fields 188, 1017-1062, 2024.

Hermitian matrices for clustering directed graphs: insights and applications

M. Cucuringu, H. Li, H. Sun, L. Zanetti. In Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics (AISTATS 2020), PMLR 108, 983-992, 2020.

Random walks on randomly evolving graphs

L. Cai, T. Sauerwald, L. Zanetti. In Structural Information and Communication Complexity (SIROCCO 2020), LNCS 12156, 111-128, 2020.

Distributed graph clustering and sparsification

H. Sun, L. Zanetti. ACM Transactions on Parallel Computing 6(3), Article 17, 1-23, 2019.

Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem

H. Li, H. Sun, L. Zanetti. In 27th Annual European Symposium on Algorithms (ESA 2019), LIPIcs 144, 71:1-71:14, 2019.

Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities

T. Sauerwald, L. Zanetti. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), LIPIcs 132, 93:1-93:15, 2019.

Partitioning well-clustered graphs: Spectral clustering works!

R. Peng, H. Sun, L. Zanetti. SIAM Journal on Computing 46(2), 710-743, 2017.

A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems

D. Tamascelli, L. Zanetti. Journal of Physics A: Mathematical and Theoretical 47(32), 325302, 2014.