Fetching the paper…
Reading the bibliography…
The estimation of probabilities of network edges from the observed adjacency matrix has important applications to predicting missing links and network denoising.
Spectral clustering and the high-dimensional stochastic blockmodel
Rohe, K · 1915
Earlier work this paper cites.
Representations for partially exchangeable arrays of random variables
Aldous, D. J · 1981
Earlier work this paper cites.
Assouad, Fano, and Le Cam
Yu, B · 1997
Earlier work this paper cites.
The political blogosphere and the 2004 U.S. Election: divided they blog
Adamic, L. A · 2004
Earlier work this paper cites.
Modeling homophily and stochastic equivalence in symmetric relational data
Hoff, P · 2008
Earlier work this paper cites.
A nonparametric view of network models and Newman–Girvan and other modularities
Bickel, P. J · 2009
Earlier work this paper cites.
New perspectives and methods in link prediction
Lichtenwalter, R. N · 2010
Earlier work this paper cites.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
Candes, E. J · 2011
Earlier work this paper cites.
Stochastic blockmodels and community structure in networks
Karrer, B · 2011
Earlier work this paper cites.
Spectral clustering of graphs with general degrees in the extended planted partition model
Chaudhuri, K · 2012
Cited alongside, same era.
Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
Airoldi, E. M · 2013
Cited alongside, same era.
Mixed membership stochastic blockmodels
Airoldi, E. M · 2014
Cited alongside, same era.
A consistent histogram estimator for exchangeable graph models
Chan, S. H · 2014
Cited alongside, same era.
Co-clustering separately exchangeable network data
Choi, D · 2014
Cited alongside, same era.
Network histograms and universality of blockmodel approximation
Olhede, S. C · 2014
Cited alongside, same era.
Matrix estimation by universal singular value thresholding
Chatterjee, S · 2015
Closest in time.
Rate-optimal graphon estimation
Gao, C · 2015
Closest in time.
Optimal estimation and completion of matrices with biclustering structures
Gao, C · 2016
Closest in time.
Community detection in sparse networks via Grothendieck’s inequality
Guédon, O · 2016
Closest in time.
On semidefinite relaxations for the block model
Amini, A. A · 2017
Closest in time.
Co-clustering of nonsmooth graphons
Choi, D · 2017
Closest in time.
Oracle inequalities for network models and sparse graphon estimation
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Spectral clustering of graphs with the bethe hessian
Saade, A · 2014
Cited alongside, same era.
Nonparametric estimation and testing of exchangeable graph models
Yang, J. J · 2014
Cited alongside, same era.
Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
Cai, T. T · 2015
Cited alongside, same era.
Klopp, O · 2017
Closest in time.
Link prediction for partially observed networks
Zhao, Y · 2017
Closest in time.
Pseudo-likelihood methods for community detection in large sparse networks
Amini, A. A · 2097
Closest in time.