research
∙
04/14/2023
Strong Consistency Guarantees for Clustering High-Dimensional Bipartite Graphs with the Spectral Method
In this work, we focus on the Bipartite Stochastic Block Model (BiSBM), ...
share
research
∙
05/24/2022
Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power Method
Clustering bipartite graphs is a fundamental task in network analysis. I...
research
∙
04/08/2022
Seeded graph matching for the correlated Wigner model via the projected power method
In the graph matching problem we observe two graphs G,H and the goal is ...
research
∙
12/20/2021
An iterative clustering algorithm for the Contextual Stochastic Block Model with optimality guarantees
Real-world networks often come with side information that can help to im...
research
∙
03/04/2021
