Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Luca Zanetti
Observed name:
Zanetti, Luca
Institution:
University of Bath
Observed institutions:
Max Planck Society,
University of Cambridge,
University of Bristol,
Max Planck Institute for Informatics,
University of Bath,
Saarland University
show all 6
ORCID:
0000-0002-4667-2764
Observed ORCID:
0000-0002-4667-2764
OpenAlex ID:
A5061476201
Partitioning Well-Clustered Graphs: Spectral Clustering Works!
2017
·
Richard Peng
, He Sun
, et al.
·
SIAM Journal on Computing
·
109
PDF
A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
2014
·
Dario Tamascelli
, Luca Zanetti
·
Journal of Physics A Mathematical and Theoretical
·
40
PDF
Hermitian matrices for clustering directed graphs: insights and applications
2019
·
Cucuringu, Mihai
, Li, Huan
, et al.
·
arXiv (Cornell University)
·
35
PDF
Distributed Graph Clustering and Sparsification
2019
·
He Sun
, Luca Zanetti
·
ACM Transactions on Parallel Computing
·
33
PDF
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities
2019
·
Sauerwald, Thomas
, Zanetti, Luca
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
32
PDF
Random Walks on Randomly Evolving Graphs
2020
·
Leran Cai
, Thomas Sauerwald
, et al.
·
Lecture notes in computer science
·
20
Geometric bounds on the fastest mixing Markov chain
2024
·
Sam Olesker-Taylor
, Luca Zanetti
·
Probability Theory and Related Fields
·
17
PDF
An Analysis of Elo Rating Systems via Markov Chains
2024
·
Sam Olesker-Taylor
, Luca Zanetti
·
neural information processing systems
·
10
PDF
Cycle-free polytopal mesh sweeping for Boltzmann transport
2025
·
Ansar Calloo
, Matthew Evans
, et al.
·
Numerical Algorithms
·
9
PDF
Distributed Graph Clustering by Load Balancing
2017
·
He Sun
, Luca Zanetti
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
8
PDF
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem
2018
·
Li, Huan
, Sun, He
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
6
PDF
An iterative spectral algorithm for digraph clustering
2024
·
James Martin
, Tim Rogers
, et al.
·
Journal of Complex Networks
·
5
Partitioning Well-clustered Graphs with k-Means and Heat Kernel
2014
·
Richard Peng
, He Sun
, et al.
·
arXiv (Cornell University)
·
4
Wireless Network Topology Inference: A Markov Chains Approach
2025
·
James Martin
, Tristan Pryer
, et al.
·
IEEE Open Journal of the Communications Society
·
3
WSSMT: Towards the Automated Analysis of Security-Sensitive Services and Applications
2010
·
Michele Barletta
, Alberto Calvi
, et al.
·
International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
·
3
Graphical Balanced Allocations with Removals
2026
·
Olesker-Taylor, Sam
, Sauerwald, Thomas
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
Algorithms for partitioning well-clustered graphs
2018
·
Luca Zanetti
·
Bristol Research (University of Bristol)
·
2
PDF
An analysis of elo rating systems via Markov chains
2024
·
Sam Olesker-Taylor
, Luca Zanetti
·
University of Warwick
·
1
Random Walks on Randomly Evolving Graphs
2020
·
Cai, Leran
, Sauerwald, Thomas
, et al.
·
arXiv (Cornell University)
·
1
PDF
Matrix concentration inequalities for time-inhomogeneous Markov chains
2026
·
Zanetti, Luca
·
arXiv (Cornell University)
PDF
An Improved and Generalised Analysis for Spectral Clustering
2025
·
Tyler, George
, Zanetti, Luca
·
arXiv (Cornell University)
PDF
Percolation and localisation: Sub-leading eigenvalues of the nonbacktracking matrix
2025
·
Martin, James
, Rogers, Tim
, et al.
·
arXiv (Cornell University)
PDF
Show more works
View as search
Works count:
26
Citation count:
344
H-index:
9
I10-index:
8
Year
Topic
Type