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. 1708.05573
  4. Cited By
Two provably consistent divide and conquer clustering algorithms for
  large networks

Two provably consistent divide and conquer clustering algorithms for large networks

18 August 2017
Soumendu Sundar Mukherjee
Purnamrita Sarkar
Peter J. Bickel
ArXivPDFHTML

Papers citing "Two provably consistent divide and conquer clustering algorithms for large networks"

1 / 1 papers shown
Title
Asymptotic normality of maximum likelihood and its variational
  approximation for stochastic blockmodels
Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
Peter J. Bickel
David S. Choi
Xiangyu Chang
Hai Zhang
65
220
0
04 Jul 2012
1