Iterative procedure for network inference

Abstract

When a network is reconstructed from data, two types of errors can occur: false positive and false negative errors about the presence or absence of links. In this paper, the vertex degree distribution of the true underlying network is analytically reconstructed using an iterative procedure. Such procedure is based on the inferred network and estimates for the probabilities $\alpha$ and $\beta$ of type I and type II errors, respectively. The iteration procedure consists of choosing various values for $\alpha$ to perform the iteration steps of the network reconstruction. For the first step, the standard value for $\alpha$ of 0.05 can be chosen as an example. The result of this first step gives a first estimate of the network topology of interest. For the second iteration step the value for $\alpha$ is adjusted according to the findings of the first step. This procedure is iterated, ultimately leading to a reconstruction of the vertex degree distribution tailored to its previously unknown network topology.

References in corpus (20)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Scale-free brain functional networks
• Clustering in Complex Directed Networks
• Graph analysis of functional brain networks: practical issues in translational neuroscience
• Inferring Network Topology from Complex Dynamics
• Trainspotting: Extraction and Analysis of Traffic and Topologies of Transportation Networks
• Heterogeneity effects in power-grid network models
• Reconstructing networks of pulse-coupled oscillators from spike trains
• Using Machine Learning to Assess Short Term Causal Dependence and Infer Network Links
• Reconstruction of chaotic neural network from observed firing rates
• Complex networks: new trends for the analysis of brain connectivity
• Model reconstruction from temporal data for coupled oscillator networks
• Hopping in the crowd to unveil network topology
• Optimizing transport efficiency on scale-free networks through assortative or dissortative topology
• Reconstructing dynamical networks via feature ranking
• Selecting the rank of truncated SVD by Maximum Approximation Capacity
• Quantifying structure in networks
• Improving Network Inference: The Impact of False Positive and False Negative Conclusions about the Presence or Absence of Links
• Analytical approach to network inference: Investigating degree distribution

Cited by in corpus (1)

• Impact of network characteristics on network reconstruction