Expectation-Maximizing Network Reconstruction and MostApplicable Network Types Based on Binary Time Series Data

Abstract

Based on the binary time series data of social infection dynamics, we propose a general framework to reconstruct 2-simplex complexes with two-body and three-body interactions by combining the maximum likelihood estimation in statistical inference and introducing the expectation maximization. In order to improve the code running efficiency, the whole algorithm adopts vectorization expression. Through the inference of maximum likelihood estimation, the vectorization expression of the edge existence probability can be obtained, and through the probability matrix, the adjacency matrix of the network can be estimated. We apply a two-step scheme to improve the effectiveness of network reconstruction while reducing the amount of computation significantly. The framework has been tested on different types of complex networks. Among them, four kinds of networks can obtain high reconstruction effectiveness. Besides, we study the influence of noise data or random interference and prove the robustness of the framework, then the effects of two kinds of hyper-parameters on the experimental results are tested. Finally, we analyze which type of network is more suitable for this framework, and propose methods to improve the effectiveness of the experimental results.

References in corpus (23)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Stochastic blockmodels and community structure in networks
• Networks beyond pairwise interactions: structure and dynamics
• Renormalization group analysis of the small-world network model
• Simplicial models of social contagion
• High-resolution measurements of face-to-face contact patterns in a primary school
• Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys
• Data Based Identification and Prediction of Nonlinear and Complex Dynamical Systems
• Community structure and scale-free collections of Erdös-Rényi graphs
• Can co-location be used as a proxy for face-to-face contacts?
• Social contagion models on hypergraphs
• Random walks on hypergraphs
• Reconstructing propagation networks with natural diversity and identifying hidden sources
• Community detection, link prediction, and layer interdependence in multilayer networks
• Evolutionary Prisoner's Dilemma on heterogeneous Newman-Watts small-world network
• The effect of heterogeneity on hypergraph contagion models
• Abrupt phase transition of epidemic spreading in simplicial complexes
• Estimating the number of communities in a network
• Hypergraph reconstruction from network data
• A statistical inference approach to structural reconstruction of complex networks from binary time series
• Network clique cover approximation to analyze complex contagions through group interactions
• Neural Information Squeezer for Causal Emergence

Cited by in corpus (3)

• An Exact Theory of Causal Emergence for Linear Stochastic Iteration Systems
• Reconstructing networks from simple and complex contagions
• SVD-based Causal Emergence for Gaussian Iterative Systems