Fetching the paper…
Reading the bibliography…
The mixed membership stochastic blockmodel is a statistical model for a graph, which extends the stochastic blockmodel by allowing every node to randomly choose a different community each time a decision of whether to form an edge is made.
Spectral clustering and the high-dimensional stochastic blockmodel
Rohe, K., Chatterjee, S., and Yu, B. (2011) · 1915
Earlier work this paper cites.
Exceptional rotations of random graphs: a vc theory
Addario-Berry, L., Bhamidi, S., Bubeck, S., Devroye, L., Lugosi, G., and Oliveira, R. I. (2015) · 1922
Earlier work this paper cites.
A fast hyperplane-based minimum-volume enclosing simplex algorithm for blind hyperspectral unmixing
Lin, C.-H., Chi, C.-Y., Wang, Y.-H., and Chan, T.-H. (2016) · 1961
Earlier work this paper cites.
Stochastic blockmodels: First steps
Holland, P. W., Laskey, K. B., and Leinhardt, S. (1983) · 1983
Earlier work this paper cites.
NP-hardness of largest contained and smallest containing simplices for v-and h-polytopes
Packer, A. (2002) · 2002
Earlier work this paper cites.
Random Dot Product Graphs: A Model for Social Networks
Nickel, C. (2006) · 2006
Earlier work this paper cites.
A tutorial on spectral clustering
Von Luxburg, U. (2007) · 2007
Earlier work this paper cites.
Random dot product graph models for social networks
Young, S. J. and Scheinerman, E. R. (2007) · 2007
Earlier work this paper cites.
Stochastic blockmodels and community structure in networks
Karrer, B. and Newman, M. E. (2011) · 2011
Earlier work this paper cites.
Stochastic blockmodels with a growing number of classes
Choi, D. S., Wolfe, P. J., and Airoldi, E. M. (2012) · 2012
Cited alongside, same era.
Modelling extremal events: for insurance and finance
Embrechts, P., Klüppelberg, C., and Mikosch, T. (2013) · 2013
Cited alongside, same era.
Efficient discovery of overlapping communities in massive networks
Gopalan, P. K. and Blei, D. M. (2013) · 2013
Cited alongside, same era.
Mixed membership stochastic blockmodels
Airoldi, E. M., Blei, D. M., Fienberg, S. E., and Xing, E. P. (2008) · 2014
Cited alongside, same era.
A tensor approach to learning mixed membership community models
Anandkumar, A., Ge, R., Hsu, D. J., and Kakade, S. M. (2014) · 2014
Cited alongside, same era.
Detecting overlapping communities in networks using spectral methods
A limit theorem for scaled eigenvectors of random dot product graphs
Athreya, A., Priebe, C. E., Tang, M., Lyzinski, V., Marchette, D. J., and Sussman, D. L. (2016) · 2016
Later among the works it cites.
Network science
Barabási, A.-L. (2016) · 2016
Later among the works it cites.
Latent space inference of internet-scale networks
Ho, Q., Yin, J., and Xing, E. P. (2016) · 2016
Later among the works it cites.
A goodness-of-fit test for stochastic block models
Lei, J. et al. (2016) · 2016
Later among the works it cites.
Provable symmetric nonnegative matrix factorization for overlapping clustering
Mao, X., Sarkar, P., and Chakrabarti, D. (2016) · 2016
Later among the works it cites.
Trend filtering on graphs
Wang, Y.-X., Sharpnack, J., Smola, A., and Tibshirani, R. J. (2016) · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Zhang, Y., Levina, E., and Zhu, J. (2014) · 2014
Cited alongside, same era.
Rate-optimal graphon estimation
Gao, C., Lu, Y., Zhou, H. H., et al. (2015) · 2015
Cited alongside, same era.
Consistency of spectral clustering in stochastic block models
Lei, J. and Rinaldo, A. (2015) · 2015
Cited alongside, same era.
A useful variant of the Davis–Kahan theorem for statisticians
Yu, Y., Wang, T., and Samworth, R. J. (2015) · 2015
Cited alongside, same era.
Sparse graphs using exchangeable random measures
Caron, F. and Fox, E. B. (2017) · 2017
Closest in time.
Oracle inequalities for network models and sparse graphon estimation
Klopp, O., Tsybakov, A. B., Verzelen, N., et al. (2017) · 2017
Closest in time.
Community detection and classification in hierarchical stochastic blockmodels
Lyzinski, V., Tang, M., Athreya, A., Park, Y., and Priebe, C. E. (2017) · 2017
Closest in time.