2 citations · 3 across the 6 of their papers we have counts for
Showing math.STShow all
3 papers · 1 filter
math.ST2023
Strong Consistency Guarantees for Clustering High-Dimensional Bipartite Graphs with the Spectral Method
Guillaume Braun
In this work, we focus on the Bipartite Stochastic Block Model (BiSBM), a popular model for bipartite graphs with a community structure. We consider the high dimensional setting wh…
math.ST2022★ 1 cited
Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power Method
Guillaume Braun, Hemant Tyagi
Clustering bipartite graphs is a fundamental task in network analysis. In the high-dimensional regime where the number of rows and the number of columns of the associat…
math.ST2022
Seeded graph matching for the correlated Gaussian Wigner model via the projected power method
Ernesto Araya, Guillaume Braun, Hemant Tyagi
In the \emph{graph matching} problem we observe two graphs and the goal is to find an assignment (or matching) between their vertices such that some measure of edge agreement…