Uncertainty Quantification of Network Inference With Data Sufficiency

Network inference, which involves reconstructing the connectivity structure of a network from recorded data, is essential for broadening our understanding of physical, biological, and chemical systems. Although data-driven network inference algorithms have made significant strides in recent years, determining how much data is required so that the inferred network topology faithfully mirrors the underlying network remains an essential but often overlooked subject. In this paper, we present a statistical method to determine whether the recorded data carries sufficient variability to ensure an accurate reconstruction of the true network topology. Our approach leverages parametric confidence intervals to establish the bounds of true connection strengths, which subsequently enable the uncertainty quantification of inferred connectivity. The proposed technique is validated using noisy data generated from networks of Kuramoto and Stuart-Landau oscillators. Additionally, the method is applied to experimentally obtained data from an electrochemical oscillator network, where we find that the data sufficiency technique can successfully predict the accuracy of the inferred network.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network Science and Engineering
Published
2025-04-22
DOI
https://doi.org/10.1109/tnse.2025.3563303
Citations
1
Primary Topic
Nonlinear Dynamics and Pattern Formation
Type
article
Field-Weighted Citation Impact
1.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Uncertainty Quantification of Network Inference With Data Sufficiency

Erik D. Herzog, K. L. Nikhil, Bharat Singhal, Jr-Shin Li et al.
1 citations
IEEE Transactions on Network Science and Engineering
Nonlinear Dynamics and Pattern Formation
1.49
article

Uncertainty Quantification of Network Inference With Data Sufficiency

Erik D. Herzog, K. L. Nikhil, Bharat Singhal, Jr-Shin Li, Jorge Luis Ocampo‐Espindola, István Z. Kiss
article en
1 citations

Abstract

Network inference, which involves reconstructing the connectivity structure of a network from recorded data, is essential for broadening our understanding of physical, biological, and chemical systems. Although data-driven network inference algorithms have made significant strides in recent years, determining how much data is required so that the inferred network topology faithfully mirrors the underlying network remains an essential but often overlooked subject. In this paper, we present a statistical method to determine whether the recorded data carries sufficient variability to ensure an accurate reconstruction of the true network topology. Our approach leverages parametric confidence intervals to establish the bounds of true connection strengths, which subsequently enable the uncertainty quantification of inferred connectivity. The proposed technique is validated using noisy data generated from networks of Kuramoto and Stuart-Landau oscillators. Additionally, the method is applied to experimentally obtained data from an electrochemical oscillator network, where we find that the data sufficiency technique can successfully predict the accuracy of the inferred network.

IEEE Transactions on Network Science and EngineeringVol. 12(5)
Washington University in St. Louis (US), Saint Louis University (US)
National Science Foundation, National Institutes of Health, National Institute of General Medical Sciences, Air Force Office of Scientific Research
Openalex Percentile: Top 18%
Nonlinear Dynamics and Pattern Formation
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.