Online Program Home
My Program

Abstract Details

Activity Number: 185
Type: Contributed
Date/Time: Monday, August 1, 2016 : 10:30 AM to 12:20 PM
Sponsor: Section on Nonparametric Statistics
Abstract #318724 View Presentation
Title: Estimating Network Edge Probabilities by Neighborhood Smoothing
Author(s): Yuan Zhang* and Elizaveta Levina and Ji Zhu
Companies: University of Michigan and University of Michigan and University of Michigan
Keywords: networks ; matrix estimation ; graphon ; nonparametric statistics ; neighborhood smoothing
Abstract:

The problem of estimating probabilities of network edges from the observed adjacency matrix has important applications to predicting missing links and network denoising. It has usually been addressed by estimating the graphon, a function that determines the matrix of edge probabilities, but is ill-defined without strong assumptions on the network structure. Here we propose a novel computationally efficient method based on neighborhood smoothing to estimate the expectation of the adjacency matrix directly, without making the strong structural assumptions graphon estimation requires. The neighborhood smoothing method requires little tuning, has a competitive mean-squared error rate, and outperforms many benchmark methods on the task of link prediction in both simulated and real networks.


Authors who are presenting talks have a * after their name.

Back to the full JSM 2016 program

 
 
Copyright © American Statistical Association