ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2205.12104
  4. Cited By
Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power
  Method

Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power Method

24 May 2022
Guillaume Braun
Hemant Tyagi
ArXivPDFHTML

Papers citing "Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power Method"

3 / 3 papers shown
Title
Strong Consistency Guarantees for Clustering High-Dimensional Bipartite
  Graphs with the Spectral Method
Strong Consistency Guarantees for Clustering High-Dimensional Bipartite Graphs with the Spectral Method
Guillaume Braun
26
2
0
14 Apr 2023
A non-backtracking method for long matrix and tensor completion
A non-backtracking method for long matrix and tensor completion
Ludovic Stephan
Yizhe Zhu
52
7
0
04 Apr 2023
The Projected Power Method: An Efficient Algorithm for Joint Alignment
  from Pairwise Differences
The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences
Yuxin Chen
Emmanuel Candes
18
92
0
19 Sep 2016
1