Estimating network edge probabilities by neighborhood smoothing

v1v2v3 (latest)

Estimating network edge probabilities by neighborhood smoothing

29 September 2015

Elizaveta Levina

ArXiv (abs)PDF HTML

Papers citing "Estimating network edge probabilities by neighborhood smoothing"

12 / 62 papers shown

Title
Revisiting Spectral Graph Clustering with Generative Community Models Pin-Yu Chen Lingfei Wu 290 12 0 14 Sep 2017
Rates of Convergence of Spectral Methods for Graphon Estimation Jiaming Xu 249 90 0 10 Sep 2017
Centrality measures for graphons: Accounting for uncertainty in networks Marco Avella-Medina F. Parise Michael T. Schaub Santiago Segarra 308 89 0 28 Jul 2017
Generalized linear models with low rank effects for network data Yun-Jhong Wu Elizaveta Levina Ji Zhu 147 18 0 18 May 2017
Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model Yihua Li Devavrat Shah Dogyoon Song Chao Yu 726 26 0 13 May 2017
Spectral clustering in the dynamic stochastic block model Marianna Pensky Teng Zhang 241 81 0 02 May 2017
Reducing Crowdsourcing to Graphon Estimation, Statistically Devavrat Shah Christina E. Lee 252 24 0 23 Mar 2017
Optimal graphon estimation in cut distance Olga Klopp Nicolas Verzélen 239 33 0 15 Mar 2017
Network cross-validation by edge sampling Tianxi Li Elizaveta Levina Ji Zhu 344 177 0 14 Dec 2016
Graphons, mergeons, and so on!Neural Information Processing Systems (NeurIPS), 2016 Justin Eldridge M. Belkin Yusu Wang GNN 217 26 0 06 Jul 2016
On clustering network-valued dataNeural Information Processing Systems (NeurIPS), 2016 Soumendu Sundar Mukherjee Purnamrita Sarkar Lizhen Lin 115 43 0 08 Jun 2016
On semidefinite relaxations for the block model Arash A. Amini Elizaveta Levina 366 172 0 21 Jun 2014