• Corpus ID: 52110131

Data based reconstruction of complex multiplex networks

  title={Data based reconstruction of complex multiplex networks},
  author={Chuang Ma and Han-Shuang Chen and Xiang Li and Ying-Cheng Lai and Haifeng Zhang},
  journal={arXiv: Physics and Society},
It has been recognized that many complex dynamical systems in the real world require a description in terms of multiplex networks, where a set of common, mutually connected nodes belong to distinct network layers and play a different role in each layer. In spite of recent progress towards data based inference of single-layer networks, to reconstruct complex systems with a multiplex structure remains largely open. We articulate a mean-field based maximum likelihood estimation framework to solve… 

Figures from this paper



Reconstructing complex networks without time series.

A maximum likelihood estimation-based framework to accurately infer the interaction topology of dynamical processes that result in a binary final state is developed and its performance and robustness are validated using various combinations of spreading dynamics and real-world network topologies.

Universal data-based method for reconstructing complex networks with binary-state dynamics.

This work develops a universal data-based linearization approach that is applicable to systems with linear, nonlinear, discontinuous, or stochastic dynamics governed by monotonic functions and represents a general paradigm for reconstructing, understanding, and exploiting complex networked systems with binary-state dynamics.

Mathematical Formulation of Multilayer Networks

This paper introduces a tensorial framework to study multilayer networks, and discusses the generalization of several important network descriptors and dynamical processes—including degree centrality, clustering coefficients, eigenvectorcentrality, modularity, von Neumann entropy, and diffusion—for this framework.

Reconstruction of stochastic temporal networks through diffusive arrival times

This work proposes an inverse modelling method based on first-arrival observations of the diffusion process taking place on temporal networks that builds in particular but not exclusively on the null model assumption of mutually independent interaction sequences at the dyadic level.

Efficient Network Reconstruction from Dynamical Cascades Identifies Small-World Topology of Neuronal Avalanches

A special case of PWA, cast in nonparametric form, which is called normalized count (NC) algorithm, which efficiently reconstructs random and small-world functional network topologies and architectures from subcritical, critical, and supercritical cascading dynamics and yields significant improvements over commonly used correlation methods.

Time-series–based prediction of complex oscillator networks via compressive sensing

This work demonstrates that the network-reconstruction problem can be casted into the form X=G·a, where the vector X and matrix G are determined by the time series and a is a sparse vector to be estimated that contains all nonzero power series coefficients in the mathematical functions of all existing couplings among the nodes.

Inferring network topology from complex dynamics

This work presents an analytical solution to the inverse problem of finding the network topology from observing a time series of state variables only, and provides a conceptually new step towards reconstructing a variety of real-world networks, including gene and protein interaction networks and neuronal circuits.

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Combinatorial Analysis of Multiple Networks

This work introduces a real-world layered network combining different kinds of online and offline relationships, and presents an innovative methodology and related analysis tools suggesting the existence of hidden motifs traversing and correlating different representation layers.

Noise bridges dynamical correlation and topology in coupled oscillator networks.

Noise leads to a general, one-to-one correspondence between the dynamical correlation and the connections among oscillators for a variety of node dynamics and network structures, enabling an accurate prediction of the full network topology based solely on measuring the dynamicals correlation.