On the reconstruction limits of complex networks

2024-12-23

AI Summary

This paper investigates the fundamental theoretical limits of reconstructing the true interaction structure of complex networks from observational data. It introduces “reconstructibility”—the proportion of structural information recoverable from data—and provides the first rigorous information-theoretic definition. We derive a universal upper bound on the average reconstruction performance of any algorithm, proving it is fully determined by the true data-generating (TDG) model. To enable empirical assessment, we propose a computationally tractable “reconstruction index” as an estimator of reconstructibility, validating its efficacy via Jaccard similarity and error probability modeling. Crucially, we demonstrate that model selection fundamentally governs reconstruction performance. This work establishes the first theoretical benchmark for network reconstruction, revealing intrinsic constraints on structural recoverability and providing principled guidance for method evaluation and model design.

Technology Category

• Machine Learning: Information Theory
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Reasoning under Uncertainty: Graphical Models

Application Category

• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Social Networks and Social Media: Influence propagation, information diffusion, and the prediction on networks
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

Network reconstruction consists in retrieving the hidden interaction structure of a system from observations. Many reconstruction algorithms have been proposed, although less research has been devoted to describe their theoretical limitations. In this work, we adopt an information-theoretic perspective and define the reconstructability: The fraction of structural information recoverable from data. The reconstructability depends on the true data generating (TDG) model which is shown to set the reconstruction limit: any algorithm can perform, on average, at best like the TDG model. We show that the reconstructability is related to various performance measures, such as the probability of error and the Jaccard similarity. In an empirical context where the TDG model is unknown, we introduce the reconstruction index as an approximation of the reconstructability. We find that performing model selection is crucial for the validity of the reconstruction index as a proxy of the reconstructability of empirical time series and networks.

Problem

• Defines reconstructability of network structures
• Explores theoretical limits of reconstruction algorithms
• Introduces reconstruction index for empirical data

Innovation

• Information-theoretic network reconstructability
• True data generating model limits
• Reconstruction index approximates recoverability