7 citations · 7 across the 1 of their papers we have counts for
5 papers
Random walks on randomly evolving graphs
Leran Cai, Thomas Sauerwald, Luca Zanetti
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under…
Hermitian matrices for clustering directed graphs: insights and applications
Mihai Cucuringu, Huan Li, He Sun +1
Graph clustering is a basic technique in machine learning, and has widespread applications in different domains. While spectral techniques have been successfully applied for cluste…
Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities
Thomas Sauerwald, Luca Zanetti
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are…
Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem
Huan Li, He Sun, Luca Zanetti
We study spectral approaches for the MAX-2-LIN(k) problem, in which we are given a system of linear equations of the form , and required to find…
Distributed Graph Clustering and Sparsification
He Sun, Luca Zanetti
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the…