Network reconstruction via density sampling
Tiziano Squartini, Giulio Cimini, Andrea Gabrielli, Diego Garlaschelli

TL;DR
This paper presents a novel network reconstruction method that estimates both topology and weights from limited data by sampling node subsets and assuming network homogeneity, improving accuracy in real economic and financial networks.
Contribution
It introduces a density sampling approach that reconstructs networks without requiring the total number of links, relying on homogeneous network assumptions and random node sampling.
Findings
Achieves high accuracy on real economic and financial data
Robust to different sampled subsets
Requires minimal topological information
Abstract
Reconstructing weighted networks from partial information is necessary in many important circumstances, e.g. for a correct estimation of systemic risk. It has been shown that, in order to achieve an accurate reconstruction, it is crucial to reliably replicate the empirical degree sequence, which is however unknown in many realistic situations. More recently, it has been found that the knowledge of the degree sequence can be replaced by the knowledge of the strength sequence, which is typically accessible, complemented by that of the total number of links, thus considerably relaxing the observational requirements. Here we further relax these requirements and devise a procedure valid when even the the total number of links is unavailable. We assume that, apart from the heterogeneity induced by the degree sequence itself, the network is homogeneous, so that its (global) link density can be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Topological and Geometric Data Analysis
