Luca Zanetti

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Percolation and localisation: Sub-leading eigenvalues of the nonbacktracking matrix	2025	James Martin Tim Rogers Luca Zanetti
+ PDF Chat	Cycle-Free Polytopal Mesh Sweeping for Boltzmann Transport	2024	Ansar Calloo M. Evans Henry Lockyer François Madiot Tristan Pryer Luca Zanetti
+ PDF Chat	An Analysis of Elo Rating Systems via Markov Chains	2024	Sam Olesker-Taylor Luca Zanetti
+	An iterative spectral algorithm for digraph clustering	2024	James Martin Tim Rogers Luca Zanetti
+ PDF Chat	Geometric bounds on the fastest mixing Markov chain	2024	Sam Olesker-Taylor Luca Zanetti
+	Geometric Bounds on the Fastest Mixing Markov Chain	2021	Sam Olesker-Taylor Luca Zanetti
+	Hermitian matrices for clustering directed graphs: insights and applications	2020	Mihai Cucuringu Huan Li He Sun Luca Zanetti
+	Random walks on randomly evolving graphs	2020	Leran Cai Thomas Sauerwald Luca Zanetti
+	Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities	2019	Thomas Sauerwald Luca Zanetti
+ PDF Chat	Distributed Graph Clustering and Sparsification	2019	He Sun Luca Zanetti
+	Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem	2019	Huan Li He Sun Luca Zanetti
+	Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities.	2019	Thomas Sauerwald Luca Zanetti
+	Hermitian matrices for clustering directed graphs: insights and applications	2019	Mihai Cucuringu Huan Li He Sun Luca Zanetti
+	Hermitian matrices for clustering directed graphs: insights and applications	2019	Mihai Cucuringu Huan Li He Sun Luca Zanetti
+	Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities	2019	Thomas Sauerwald Luca Zanetti
+	Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem	2018	Huan Li He Sun Luca Zanetti
+	Algorithms for partitioning well-clustered graphs	2018	Luca Zanetti
+	Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem	2018	Huan Li He Sun Luca Zanetti
+ PDF Chat	Partitioning Well-Clustered Graphs: Spectral Clustering Works!	2017	Richard Peng He Sun Luca Zanetti
+	Distributed Graph Clustering and Sparsification	2017	He Sun Luca Zanetti
+	Distributed Graph Clustering by Load Balancing	2016	He Sun Luca Zanetti
+	Partitioning Well-clustered Graphs with k-Means and Heat Kernel	2014	Richard Peng He Sun Luca Zanetti
+ PDF Chat	A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems	2014	Dario Tamascelli Luca Zanetti
+	Partitioning Well-Clustered Graphs: Spectral Clustering Works!	2014	Richard Peng He Sun Luca Zanetti

Common Coauthors

Coauthor	Papers Together
He Sun	8
Thomas Sauerwald	4
Richard Peng	3
Huan Li	3
Mihai Cucuringu	3
Huan Li	3
He Sun	3
Sam Olesker-Taylor	3
James Martin	2
Tim Rogers	2
M. Evans	1
François Madiot	1
Dario Tamascelli	1
He Sun	1
Ansar Calloo	1
Tristan Pryer	1
Henry Lockyer	1
Leran Cai	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Community detection in graphs	2009	Santo Fortunato	5
+ PDF Chat	A tutorial on spectral clustering	2007	Ulrike von Luxburg	5
+ PDF Chat	A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning	2013	Daniel A. Spielman Shang‐Hua Teng	4
+	Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator	2012	Lorenzo Orecchia Sushant Sachdeva Nisheeth K. Vishnoi	3
+	A combinatorial, primal-dual approach to semidefinite programs	2007	Sanjeev Arora Satyen Kale	3
+ PDF Chat	Multi-way spectral partitioning and higher-order cheeger inequalities	2012	James R. Lee Shayan Oveis Gharan Luca Trevisan	3
+ PDF Chat	Graph Sparsification by Effective Resistances	2011	Daniel A. Spielman Nikhil Srivastava	3
+ PDF Chat	Spectral Sparsification of Graphs	2011	Daniel A. Spielman Shang‐Hua Teng	3
+ PDF Chat	Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities	2014	James R. Lee Shayan Oveis Gharan Luca Trevisan	3
+	The Rotation of Eigenvectors by a Perturbation. III	1970	Chandler Davis W. Kahan	3
+ PDF Chat	Reductions between Expansion Problems	2012	Prasad Raghavendra David Steurer Madhur Tulsiani	3
+ PDF Chat	Twice-Ramanujan Sparsifiers	2012	Joshua Batson Daniel A. Spielman Nikhil Srivastava	3
+	A decentralized algorithm for spectral analysis	2004	David Kempe Frank McSherry	3
+	Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices	2012	Ioannis Koutis A. Levin Richard Peng	3
+	Merging for inhomogeneous finite Markov chains, part II: Nash and log-Sobolev inequalities	2011	Laurent Saloff‐Coste J. Zúñiga	2
+ PDF Chat	Rumor spreading in random evolving graphs	2015	Andrea Clementi Pierluigi Crescenzi Carola Doerr Pierre Fraigniaud Francesco Pasquale Riccardo Silvestri	2
+	Spectral Graph Theory	1996	Fan Chung	2
+	Find your place: simple distributed algorithms for community detection	2017	Luca Becchetti Andrea Clementi Emanuele Natale Francesco Pasquale Luca Trevisan	2
+ PDF Chat	Many sparse cuts via higher eigenvalues	2012	Anand Louis Prasad Raghavendra Prasad Tetali Santosh Vempala	2
+ PDF Chat	Bounds on the Voter Model in Dynamic Networks	2016	Petra Berenbrink George Giakkoupis Anne-Marie Kermarrec Frederik Mallmann-Trenn	2
+	Random Walks on Evolving Graphs with Recurring Topologies	2014	Oksana Denysyuk Luı́s Rodrigues	2
+ PDF Chat	The electrical resistance of a graph captures its commute and cover times	1989	Ashok K. Chandra Prabhakar Raghavan Walter L. Ruzzo Roman Smolensky	2
+	Cover time and mixing time of random walks on dynamic graphs	2017	Chen Avin Michal Koucký Zvi Lotker	2
+ PDF Chat	Cutoff for random walk on dynamical Erdős–Rényi graph	2020	Perla Sousi Sam Thomas	2
+	Spectral clustering and the high-dimensional stochastic blockmodel	2011	Karl Rohe Sourav Chatterjee Bin Yu	2
+ PDF Chat	Breaking the multicommodity flow barrier for o(√log n)-approximations to sparsest cut	2009	Jonah Sherman	2
+ PDF Chat	Information spreading in dynamic graphs	2014	Andrea Clementi Riccardo Silvestri Luca Trevisan	2
+	A simple SVD algorithm for finding hidden partitions	2014	Van Vu	2
+	Spectral concentration, robust k-center, and simple clustering	2014	Tamal K. Dey Alfred Rossi Anastasios Sidiropoulos	2
+	A comparison principle for random walk on dynamical percolation.	2019	Jonathan Hermon Perla Sousi	2
+	Improved Cheeger's inequality	2013	Tsz Chiu Kwok Lap Chi Lau Yin Tat Lee Shayan Oveis Gharan Luca Trevisan	2
+	Local divergence of Markov chains and the analysis of iterative load-balancing schemes	2002	Yuval Rabani Alistair Sinclair Rolf Wanka	2
+ PDF Chat	Mathematical Aspects of Mixing Times in Markov Chains	2005	Ravi Montenegro Prasad Tetali	2
+	An elementary proof of a theorem of Johnson and Lindenstrauss	2002	Sanjoy Dasgupta Anupam Gupta	2
+	Partitioning into expanders	2014	Shayan Oveis Gharan Luca Trevisan	2
+ PDF Chat	Center-based clustering under perturbation stability	2011	Pranjal Awasthi Avrim Blum Or Sheffet	2
+ PDF Chat	Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times	2014	Yuval Peres Alexandre Stauffer Jeffrey E. Steif	2
+	Spectral partitioning of random graphs	2001	Frank McSherry	2
+ PDF Chat	Approximate counting, uniform generation and rapidly mixing Markov chains	1989	Alistair Sinclair Mark Jerrum	2
+	Partitioning Well-Clustered Graphs: Spectral Clustering Works!	2014	Richard Peng He Sun Luca Zanetti	2
+ PDF Chat	Localization and its consequences for quantum walk algorithms and quantum communication	2007	Jonathan P. Keating Noah Linden Jonathan C. F. Matthews Andreas Winter	1
+	Tight bounds for rumor spreading with vertex expansion	2014	George Giakkoupis	1
+	λ1, Isoperimetric inequalities for graphs, and superconcentrators	1985	Noga Alon Vitali Milman	1
+	Symmetric squares of graphs	2006	Koenraad M. R. Audenaert Chris Godsil Gordon Royle Terry Rudolph	1
+ PDF Chat	Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time	2015	Yin Tat Lee He Sun	1
+	Reversible Markov Chains and Random Walks on Graphs	2014	David Aldous James Allen Fill	1
+ PDF Chat	High-performance Physics Simulations Using Multi-core CPUs and GPGPUs in a Volunteer Computing Context	2010	Kamran Karimi Neil G. Dickson Firas Hamze	1
+	Physically-motivated dynamical algorithms for the graph isomorphism problem	2005	Shiue-Yuan Shiau Robert Joynt S. N. Coppersmith	1
+ PDF Chat	Quantum-computer architecture using nonlocal interactions	2003	Gavin K. Brennen Daegene Song Carl J. Williams	1
+ PDF Chat	The electrical resistance of a graph captures its commute and cover times	1996	Ashok K. Chandra Prabhakar Raghavan Walter L. Ruzzo Roman Smolensky Prasoon Tiwari	1