Author
Listed:
- Navit Dori
(Gonda Brain Research Center, Bar-Ilan University)
- Pablo Piedrahita
(Institute for Biocomputation and Physics of Complex Systems (BIFI), University of Zaragoza)
- Yoram Louzoun
(Gonda Brain Research Center, Bar-Ilan University
Bar-Ilan University)
Abstract
The deduction of network connectivity from the observed node dynamics is costly in large networks. The theoretical number of possible networks containing N nodes connected by binary links grows exponentially with N square. This problem is often termed “the curse of dimensionality”. In practice, unfeasible long time-series and a high computational cost are required to detect the connectivity of a network from its observations. Given the large number of time-series currently assembled in all domains of science, a solution to this inverse problem in large networks is required. We here propose a solution to the inverse problem in large networks of binary variables through a redefinition of the problem. Instead of attempting to deduce the links of a network, we redefine the problem into the prediction of future dynamics. Specifically, we show that links between nodes can be divided into links affecting the future dynamics and links that do not. We further show that hard-to-predict links belong to the second group, and as such can be ignored when predicting future dynamics. This division is applied through a two stage algorithm. In the first stage, the vast majority of potential links (pairs of nodes) is removed, since even if they exist they do not affect the dynamics. At the second stage, a rapid high-precision estimate of the predictable links is performed using a modified partial correlation algorithm. A good predictor for the classification of potential links is the mutual information between a node-pair. Similarly, some nodes have practically no variability and as such have practically no effect on the dynamics of other nodes. The links to and from such nodes are hard to predict. We show that a two stage algorithm can be applied to these nodes with similar results. This methodology does not reproduce the network that originally induced the dynamics, but its prediction of future dynamics is similar to the one of the real network. The current analysis is limited to reconstruction using partial correlation methods. However, the same principle can be applied to other reconstruction methods. Graphical abstract
Suggested Citation
Navit Dori & Pablo Piedrahita & Yoram Louzoun, 2019.
"Two stage approach to functional network reconstruction for binary time-series,"
The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 92(2), pages 1-16, February.
Handle:
RePEc:spr:eurphb:v:92:y:2019:i:2:d:10.1140_epjb_e2019-80605-6
DOI: 10.1140/epjb/e2019-80605-6
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:eurphb:v:92:y:2019:i:2:d:10.1140_epjb_e2019-80605-6. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.