Online Program Home
  My Program

All Times EDT

Abstract Details

Activity Number: 586 - Theoretical Investigations on Discrete Structure Recovery
Type: Topic Contributed
Date/Time: Thursday, August 6, 2020 : 3:00 PM to 4:50 PM
Sponsor: IMS
Abstract #309682
Title: Edgeworth Approximation to Network U-Statistics
Author(s): Yuan Zhang*
Companies: Ohio State University - Columbus, OH
Keywords: networks; Edgeworth expansion; bootstrap; asymptotics; method of moments
Abstract:

In this talk, we present some limiting theory and numerical results for approximating the distribution of network U-statistics in presence of edge-wise random noise. We compare the results with the classical noiseless setting and discuss their connections and differences. We derive the first higher order accuracy term in the Edgeworth approximation and show an explicit uniform error bound for the remainder under mild sparsity and other conditions. Specifically, we discovered that the roles of sparsity and random edge noise to be blessing in smoothing out periodicity in the case that Cramer's condition, which has always been assumed in the noiseless case but is violated by some most frequently studied network models such as stochastic block model, fails. We also discuss the nonparametric bootstrap's performance and compared our method's accuracy with it.


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

Back to the full JSM 2020 program