Iterative procedure for network inference

DOI10.1016/J.CNSNS.2020.105286MaRDI QIDQ2208090zbMATH OpenOpenAlexFDO

Authors Gloria Cecchini, Björn Schelter

Publication date 23 October 2020

Published in Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.06593

zbMATH Keywords

false negativefalse positivenetwork inferencenode degree distributionstatistical inference

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Parametric hypothesis testing (62F03) Deterministic network models in operations research (90B10)

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 $$ 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.

Recommendations

• Reconstruction of networks from one-step data by matching positions
• Network Inference From Co-Occurrences
• Inferring network topology via the propagation process
• Inferring network topology from complex dynamics
• Network topology inference using information cascades with limited statistical knowledge

Cites work

• A note on minimum distance estimates
• Complex networks. Structure, robustness and function.
• Complex networks: structure and dynamics
• Dynamical Processes on Complex Networks
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• scientific article; zbMATH DE number 3070130 (Why is no real title available?)
• scientific article; zbMATH DE number 3076220 (Why is no real title available?)
• Inferring network topology from complex dynamics
• Minimum Distance and Robust Estimation
• Network reconstruction by linear dynamics
• Networks. An introduction.
• On the estimation by the minimum distance method
• Statistical mechanics of complex networks
• The Minimum Distance Method
• The Optimal Hard Threshold for Singular Values is <inline-formula> <tex-math notation="TeX">\(4/\sqrt {3}\) </tex-math></inline-formula>
• The Structure and Function of Complex Networks

Cited in

(2)

• scientific article; zbMATH DE number 637314 (Why is no real title available?)
• Iterative maximum likelihood on networks

This page was built for publication: Iterative procedure for network inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2208090)