Local Tomography of Large Networks under the Low-Observability Regime

05/23/2018
by   Augusto Santos, et al.
0

This article studies the problem of reconstructing the topology of a network of interacting agents via observations of the state-evolution of the agents. We focus on the large-scale network setting with the additional constraint of partial observations, where only a small fraction of the agents can be feasibly observed. The goal is to infer the underlying subnetwork of interactions and we refer to this problem as local tomography. In order to study the large-scale setting, we adopt a proper stochastic formulation where the unobserved part of the network is modeled as an Erdös-Rényi random graph, while the observable subnetwork is left arbitrary. The main result of this work is establishing that, under this setting, local tomography is actually possible with high probability, provided that certain conditions on the network model are met (such as stability and symmetry of the network combination matrix). Remarkably, such conclusion is established under the low-observability regime, where the cardinality of the observable subnetwork is fixed, while the size of the overall network can increase without bound.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2017

Consistent Tomography under Partial Observations over Adaptive Networks

This work studies the problem of inferring whether an agent is directly ...
research
08/14/2018

Latent Agents in Networks: Estimation and Pricing

We focus on a setting where agents in a social network consume a product...
research
09/24/2021

Learning to maximize global influence from local observations

We study a family online influence maximization problems where in a sequ...
research
09/14/2023

Gradient Dynamics in Linear Quadratic Network Games with Time-Varying Connectivity and Population Fluctuation

In this paper, we consider a learning problem among non-cooperative agen...
research
04/05/2019

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

This work examines the problem of graph learning over a diffusion networ...
research
12/18/2019

Inverse Graph Learning over Optimization Networks

Many inferential and learning tasks can be accomplished efficiently by m...

Please sign up or login with your details

Forgot password? Click here to reset