Network Recovery from Unlabeled Noisy Samples

by   Nathaniel Josephs, et al.

There is a growing literature on the statistical analysis of multiple networks in which the network is the fundamental data object. However, most of this work requires networks on a shared set of labeled vertices. In this work, we consider the question of recovering a parent network based on noisy unlabeled samples. We identify a specific regime in the noisy network literature for recovery that is asymptotically unbiased and computationally tractable based on a three-stage recovery procedure: first, we align the networks via a sequential pairwise graph matching procedure; next, we compute the sample average of the aligned networks; finally, we obtain an estimate of the parent by thresholding the sample average. Previous work on multiple unlabeled networks is only possible for trivial networks due to the complexity of brute-force computations.



page 1

page 2

page 3

page 4


Phase Transition for Support Recovery from Gaussian Linear Measurements

We study the problem of recovering the common k-sized support of a set o...

Sample complexity of population recovery

The problem of population recovery refers to estimating a distribution b...

Yet Another Statistical Analysis of Bob Ross Paintings

In this paper, we analyze a sample of clippings from paintings by the la...

Recovering a Hidden Community Beyond the Spectral Limit in O(|E| ^*|V|) Time

Community detection is considered for a stochastic block model graph of ...

Unsupervised Learning with Stein's Unbiased Risk Estimator

Learning from unlabeled and noisy data is one of the grand challenges of...

Recovering low-rank structure from multiple networks with unknown edge distributions

In increasingly many settings, particularly in neuroimaging, data sets c...

Code Repositories

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.