Fetching the paper…
Reading the bibliography…
Most recent developments on the stochastic block model (SBM) rely on the knowledge of the model parameters, or at least on the number of communities.
K. Rohe, S. Chatterjee, and B. Yu, Spectral clustering and the high-dimensional stochastic blockmodel , The Annals of Statistics 39
1915
Earlier work this paper cites.
H. C. White, S. A. Boorman, and R. L. Breiger, Social structure from multiple networks , American Journal of Sociology 81
1976
Earlier work this paper cites.
P. W. Holland, K. Laskey, and S. Leinhardt, Stochastic blockmodels: First steps , Social Networks 5
1983
Earlier work this paper cites.
S. E. Fienberg, M. M. Meyer, and S. S. Wasserman, Statistical analysis of multiple sociometric relations , Journal of The American Statistical Association (1985), 51–67
1985
Earlier work this paper cites.
S. Verdú, Asymptotic error probability of binary hypothesis testing for poisson point-process observations (corresp.) , Information Theory, IEEE Transactions on 32
1986
Earlier work this paper cites.
T.N. Bui, S. Chaudhuri, F.T. Leighton, and M. Sipser, Graph bisection algorithms with good average case behavior , Combinatorica 7
1987
Earlier work this paper cites.
R.B. Boppana, Eigenvalues and graph bisection: An average-case analysis , In 28th Annual Symposium on Foundations of Computer Science (1987), 280–285
1987
Earlier work this paper cites.
Y. J. Wang and G. Y. Wong, Stochastic blockmodels for directed graphs , Journal of the American Statistical Association (1987), 8–19
1987
Earlier work this paper cites.
M.E. Dyer and A.M. Frieze, The solution of some random NP-hard problems in polynomial expected time , Journal of Algorithms 10
1989
Earlier work this paper cites.
J. Shi and J. Malik, Normalized cuts and image segmentation , IEEE Transactions on Pattern Analysis and Machine Intelligence 22
1997
Earlier work this paper cites.
T. A. B. Snijders and K. Nowicki, Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure , Journal of Classification 14
1997
Earlier work this paper cites.
Mark Jerrum and Gregory B. Sorkin, The metropolis algorithm for graph bisection , Discrete Applied Mathematics 82
1998
Earlier work this paper cites.
A. Condon and R. M. Karp, Algorithms for graph partitioning on the planted partition model , Lecture Notes in Computer Science 1671
1999
Earlier work this paper cites.
E.M. Marcotte, M. Pellegrini, H.-L. Ng, D.W. Rice, T.O. Yeates, and D. Eisenberg, Detecting protein function and protein-protein interactions from genome sequences , Science 285
1999
Earlier work this paper cites.
J. K. Pritchard, M. Stephens, and P. Donnelly, Inference of Population Structure Using Multilocus Genotype Data , Genetics 155
2000
Earlier work this paper cites.
T. Carson and R. Impagliazzo, Hill-climbing finds random planted bisections , Proc. 12th Symposium on Discrete Algorithms (SODA 01), ACM press, 2001, 2001, pp. 903–909
2001
Earlier work this paper cites.
F. McSherry, Spectral partitioning of random graphs , In 42nd Annual Symposium on Foundations of Computer Science (2001), 529–537
2001
Cited alongside, same era.
S. H. Strogatz, Exploring complex networks , Nature 410
2001
Cited alongside, same era.
M. Girvan and M. E. J. Newman, Community structure in social and biological networks , Proceedings of the National Academy of Sciences 99
2002
Cited alongside, same era.
G. Linden, B. Smith, and J. York, Amazon.com recommendations: Item-to-item collaborative filtering , IEEE Internet Computing 7
2003
Cited alongside, same era.
D. Jiang, C. Tang, and A. Zhang, Cluster analysis for gene expression data: a survey , Knowledge and Data Engineering, IEEE Transactions on 16
2004
Cited alongside, same era.
P. K. Gopalan and D. M. Blei, Efficient discovery of overlapping communities in massive networks , Proceedings of the National Academy of Sciences (2013)
2013
Later among the works it cites.
T. Qin and K. Rohe, Regularized spectral clustering under the degree-corrected stochastic blockmodel , Advances in Neural Information Processing Systems 26 (C.j.c. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K.q. Weinberger, eds.), 2013, pp. 3120–3128
2013
Later among the works it cites.
E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing, Mixed membership stochastic blockmodels , J. Mach. Learn. Res. 9
2014
Later among the works it cites.
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Lada A. Adamic and Natalie Glance, The political blogosphere and the 2004 u.s. election: Divided they blog , Proceedings of the 3rd International Workshop on Link Discovery (New York, NY, USA), LinkKDD ’05, ACM, 2005, pp. 36–43
2005
Cited alongside, same era.
J. Chen and B. Yuan, Detecting functional modules in the yeast proteinÐprotein interaction network , Bioinformatics 22
2006
Cited alongside, same era.
M. Sonka, V. Hlavac, and R. Boyle, Image processing, analysis, and machine vision , Thomson-Engineering, 2007
2007
Cited alongside, same era.
J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, Statistical properties of community structure in large social and information networks , Proceedings of the 17th international conference on World Wide Web (New York, NY, USA), WWW ’08, ACM, 2008, pp. 695–704
2008
Cited alongside, same era.
P. J. Bickel and A. Chen, A nonparametric view of network models and newmanÐgirvan and other modularities , Proceedings of the National Academy of Sciences (2009)
2009
Cited alongside, same era.
A. Coja-oghlan, Graph partitioning via adaptive spectral techniques , Comb. Probab. Comput. 19
2010
Cited alongside, same era.
A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , Phys. Rev. E 84
2011
Cited alongside, same era.
2014
Later among the works it cites.
2014
Later among the works it cites.
L. Massoulié, Community detection thresholds and the weak Ramanujan property , STOC 2014: 46th Annual Symposium on the Theory of Computing (New York, United States), June 2014, pp. 1–10
2014
Later among the works it cites.
2014
Later among the works it cites.
J. Xu, R. Wu, K. Zhu, B. Hajek, R. Srikant, and L. Ying, Jointly clustering rows and columns of binary matrices: Algorithms and trade-offs , SIGMETRICS Perform. Eval. Rev. 42
2014
Later among the works it cites.
2014
Later among the works it cites.
2014
Later among the works it cites.
2015
Closest in time.
A. S. Bandeira, Random laplacian matrices and convex relaxations , arXiv:1504.03987 (2015)
2015
Closest in time.
C. Borgs, J. Chayes, and A. Smith, Private graphon estimation for sparse graphs , In preparation (2015)
2015
Closest in time.
2015
Closest in time.