|
Activity Number:
|
330
- Advances in Inference of Networks
|
|
Type:
|
Topic Contributed
|
|
Date/Time:
|
Tuesday, August 1, 2017 : 10:30 AM to 12:20 PM
|
|
Sponsor:
|
Section on Nonparametric Statistics
|
|
Abstract #323632
|
|
|
Title:
|
Testing Social Structure with Subgraph Counts
|
|
Author(s):
|
Chao Gao*
|
|
Companies:
|
University of Chicago
|
|
Keywords:
|
|
|
Abstract:
|
A fundamental problem of network inference is to test whether a given network has an interesting social structure. We derive asymptotic distributions of various subgraph counts. These results can be applied to test certain equations between frequencies of different subgraph counts. For example, one can test an Erdos-Renyi graph against a stochastic block model or against a low-rank latent network model. Power analysis and optimality of the test are also discussed.
|
Authors who are presenting talks have a * after their name.
Back to the full JSM 2017 program
|
