Universal structural estimator and dynamics approximator for complex networks
arXiv:1611.01849 · doi:10.1103/PhysRevE.97.032317
Abstract
Revealing the structure and dynamics of complex networked systems from observed data is of fundamental importance to science, engineering, and society. Is it possible to develop a universal, completely data driven framework to decipher the network structure and different types of dynamical processes on complex networks, regardless of their details? We develop a Markov network based model, sparse dynamical Boltzmann machine (SDBM), as a universal network structural estimator and dynamics approximator. The SDBM attains its topology according to that of the original system and is capable of simulating the original dynamical process. We develop a fully automated method based on compressive sensing and machine learning to find the SDBM. We demonstrate, for a large variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and predicts its dynamical behavior with high precision.
References in corpus (30)
- Epidemic spreading in scale-free networks
- Discovering governing equations from data: Sparse identification of nonlinear dynamical systems
- Statistical physics of social dynamics
- Hierarchical structure and the prediction of missing links in networks
- Epidemic dynamics and endemic states in complex networks
- Evolutionary prisoner's dilemma game on a square lattice
- Emergence of Cooperation and Organization in an Evolutionary Game
- Voter Model on Heterogeneous Graphs
- Revealing Network Connectivity From Dynamics
- Reconstructing propagation networks with natural diversity and identifying hidden sources
- Inferring Network Topology from Complex Dynamics
- Noise bridges dynamical correlation and topology in coupled oscillator networks
- Robust Reconstruction of Complex Networks from Sparse Data
- Inverse Ising inference using all the data
- Non mean-field behavior of the contact process on scale-free networks
- Adaptive Cluster Expansion for Inferring Boltzmann Machines with Noisy Data
- Self-organized Networks of Competing Boolean Agents
- Mean Field Theory For Non-Equilibrium Network Reconstruction
- Network reconstruction from random phase-resetting
- Extreme events on complex networks
- The Bethe approximation for solving the inverse Ising problem: a comparison with other inference methods
- Pseudolikelihood Decimation Algorithm Improving the Inference of the Interaction Network in a General Class of Ising Models
- A statistical inference approach to structural reconstruction of complex networks from binary time series
- Agent Based Models of Language Competition: Macroscopic descriptions and Order-Disorder transitions
- Mean-field theory for the inverse Ising problem at low temperatures
- Maximum likelihood reconstruction for Ising models with asynchronous updates
- Self-organized Boolean game on networks
- A universal data based method for reconstructing complex networks with binary-state dynamics
- Inference of kinetic Ising model on sparse graphs
- Fluctuations of two-time quantities and time-reparametrization invariance in spin-glasses