scispace - formally typeset
Search or ask a question
Author

S. Gigi

Bio: S. Gigi is an academic researcher from Indian Institute of Technology Madras. The author has an hindex of 1, co-authored 1 publications receiving 9 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: In this article, the authors developed a methodology for reconstruction of plant connectivity from dynamic data using directional spectral analysis, a novel adaptation of ideas from neurosciences and econometrics.

9 citations


Cited by
More filters
Journal Article
TL;DR: A new frequency-domain approach to describe the relationships (direction of information flow) between multivariate time series based on the decomposition of multivariate partial coherences computed from multivariate autoregressive models is introduced.
Abstract: Abstract. This paper introduces a new frequency-domain approach to describe the relationships (direction of information flow) between multivariate time series based on the decomposition of multivariate partial coherences computed from multivariate autoregressive models. We discuss its application and compare its performance to other approaches to the problem of determining neural structure relations from the simultaneous measurement of neural electrophysiological signals. The new concept is shown to reflect a frequency-domain representation of the concept of Granger causality.

176 citations

Journal ArticleDOI
TL;DR: The proposed method is developed in the framework of sparse optimization while adopting a parametric approach using vector auto-regressive (VAR) models, where both the temporal and spatial correlations can be exploited for efficient data recovery.
Abstract: Recovery of missing observations in time-series has been a century-long subject of study, giving rise to two broad classes of methods, namely, one that reconstructs data and the other that directly estimate the statistical properties of the data, largely for univariate processes. In this work, we present a data reconstruction technique for multivariate processes. The proposed method is developed in the framework of sparse optimization while adopting a parametric approach using vector auto-regressive (VAR) models, where both the temporal and spatial correlations can be exploited for efficient data recovery. The primary purpose of recovering the missing data in this work is to develop a directed graphical or a network representation of the multivariate process under study. Existing methods for data-driven network reconstruction are built on the assumption of data being available at regular intervals. In this respect, the proposed method offers an effective methodology for reconstructing weighted causal networks from missing data. The scope of this work is restricted to linear, jointly stationary multivariate processes that can be suitably represented by VAR models of finite order and missing data of the random type. Simulation studies on different data generating processes with varying proportions of missing observations illustrate the efficacy of the proposed method in recovering the multivariate signals and thereby reconstructing weighted causal networks.

8 citations

Posted Content
TL;DR: It is shown that identification is equivalent to learning a model which captures the approximate linear relationships between the different variables comprising $\mathbf{X}$ such that A_n is full rank (highest possible) and consistent with a network node-edge incidence structure.
Abstract: We solve the problem of identifying (reconstructing) network topology from steady state network measurements. Concretely, given only a data matrix $\mathbf{X}$ where the $X_{ij}$ entry corresponds to flow in edge $i$ in configuration (steady-state) $j$, we wish to find a network structure for which flow conservation is obeyed at all the nodes. This models many network problems involving conserved quantities like water, power, and metabolic networks. We show that identification is equivalent to learning a model $\mathbf{A_n}$ which captures the approximate linear relationships between the different variables comprising $\mathbf{X}$ (i.e. of the form $\mathbf{A_n X \approx 0}$) such that $\mathbf{A_n}$ is full rank (highest possible) and consistent with a network node-edge incidence structure. The problem is solved through a sequence of steps like estimating approximate linear relationships using Principal Component Analysis, obtaining f-cut-sets from these approximate relationships, and graph realization from f-cut-sets (or equivalently f-circuits). Each step and the overall process is polynomial time. The method is illustrated by identifying topology of a water distribution network. We also study the extent of identifiability from steady-state data.

7 citations

Proceedings ArticleDOI
17 Jun 2013
TL;DR: The EAUDI method is further extended to detect causality from process data, and it can also provide models of all connecting paths simultaneously and hypothesis testing is proposed to verify the results of this approach (by testing cross-regressive coefficients).
Abstract: To the best of our knowledge, there are few methods which can determine both causality and models from process data, although both of them are crucial in practical applications The extended augmented UD identification (EAUDI) is an identification approach which does not need a priori causal relationship between variables in advance In this method, however, the information contained in the augmented information matrix (AIM) is still not fully utilized and yet helpful for causality analysis, namely, whether the values of cross-regressive coefficients are sufficiently weak to be considered as insignificant Based on this, the EAUDI method is further extended to detect causality from process data, and it can also provide models of all connecting paths simultaneously Moreover, hypothesis testing (F-distribution) is proposed to verify the results of this approach (by testing cross-regressive coefficients) The effectiveness of the proposed method is demonstrated by numerical examples

3 citations

Proceedings ArticleDOI
01 Apr 2017
TL;DR: This paper presents a method to reconstruct the causal graph from data with missing observations using sparse optimization (SPOPT) techniques, particularly devised for jointly stationary multivariate processes that have vector autoregressive (VAR) structure representations.
Abstract: Learning temporal causal relationships between time series is an important tool for the identification of causal network structures in linear dynamic systems from measurements. The main objective in network reconstruction is to identify the causal interactions between the variables and determine the connectivity strengths from time-series data. Among several recently introduced data-driven causality measures, partial directed coherence (PDC), directed partial correlation (DPC) and direct power transfer (DPT) have been shown to be effective in both identifying the causal interactions as well as quantifying the strength of connectivity. However, all the existing approaches assume that the observations are available at all time instants and fail to cater to the case of missing observations. This paper presents a method to reconstruct the causal graph from data with missing observations using sparse optimization (SPOPT) techniques. The method is particularly devised for jointly stationary multivariate processes that have vector autoregressive (VAR) structure representations. Demonstrations on different linear causal dynamic systems illustrate the efficacy of the proposed method with respect to the reconstruction of causal networks.

3 citations