3 papers
cs.DS2025
Spectral Clustering with Side Information
Hendrik Fichtenberger, Michael Kapralov, Ekaterina Kochetkova +3
In the graph clustering problem with a planted solution, the input is a graph on vertices partitioned into clusters, and the task is to infer the clusters from graph struct…
stat.ML2024
On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
Aditya Bhaskara, Agastya Vibhuti Jha, Michael Kapralov +3
In a graph bisection problem, we are given a graph with two equally-sized unlabeled communities, and the goal is to recover the vertices in these communities. A popular heurist…
cs.DS2024
On the Streaming Complexity of Expander Decomposition
Yu Chen, Michael Kapralov, Mikhail Makarov +1
In this paper we study the problem of finding -expander decompositions of a graph in the streaming model, in particular for dynamic streams of edge insertions and deletions…