Learning Erdős-Rényi Graphs under Partial Observations: Concentration or Sparsity?

04/05/2019
by   Vincenzo Matta, et al.
0

This work examines the problem of graph learning over a diffusion network when data can be collected from a limited portion of the network (partial observability). While most works in the literature rely on a degree of sparsity to provide guarantees of consistent graph recovery, our analysis moves away from this condition and includes the demanding setting of dense connectivity. We ascertain that suitable estimators of the combination matrix (i.e., the matrix that quantifies the pairwise interaction between nodes) possess an identifiability gap that enables the discrimination between connected and disconnected nodes. Fundamental conditions are established under which the subgraph of monitored nodes can be recovered, with high probability as the network size increases, through universal clustering algorithms. This claim is proved for three matrix estimators: i) the Granger estimator that adapts to the partial observability setting the solution that is optimal under full observability ; ii) the one-lag correlation matrix; and iii) the residual estimator based on the difference between two consecutive time samples. Comparison among the estimators is performed through illustrative examples that reveal how estimators that are not optimal in the full observability regime can outperform the Granger estimator in the partial observability regime. The analysis reveals that the fundamental property enabling consistent graph learning is the statistical concentration of node degrees, rather than the sparsity of connections.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2022

Learning the Structure of Large Networked Systems Obeying Conservation Laws

Many networked systems such as electric networks, the brain, and social ...
research
07/01/2020

Partial Recovery in the Graph Alignment Problem

In this paper, we consider the graph alignment problem, which is the pro...
research
04/20/2020

Estimating Ising Models from One Sample

Given one sample X ∈{± 1}^n from an Ising model [X=x]∝(x^ J x/2), whose ...
research
03/02/2021

On the Connectivity and Giant Component Size of Random K-out Graphs Under Randomly Deleted Nodes

Random K-out graphs, denoted ℍ(n;K), are generated by each of the n node...
research
04/14/2023

Strong Consistency Guarantees for Clustering High-Dimensional Bipartite Graphs with the Spectral Method

In this work, we focus on the Bipartite Stochastic Block Model (BiSBM), ...
research
12/18/2019

Inverse Graph Learning over Optimization Networks

Many inferential and learning tasks can be accomplished efficiently by m...
research
05/23/2018

Local Tomography of Large Networks under the Low-Observability Regime

This article studies the problem of reconstructing the topology of a net...

Please sign up or login with your details

Forgot password? Click here to reset