Time Series Gaussian Chain Graph Models

arXiv stat.ML / 4/9/2026

💬 OpinionIdeas & Deep AnalysisModels & Research

Key Points

  • The paper proposes a new class of time-series Gaussian chain graph models that separates contemporaneous/lagged cross-block causal relations (directed edges) from within-block conditional dependencies (undirected edges).
  • In the frequency domain, the approach yields a shared group sparse plus group low-rank decomposition of inverse spectral density matrices, enabling identifiability of the underlying chain graph structure.
  • The authors introduce a three-stage estimation procedure based on a regularized Whittle likelihood, using group lasso to promote group sparsity and a tensor-unfolding nuclear norm penalty to encourage group low-rank structure.
  • The method is theoretically supported with asymptotic results guaranteeing consistency for exact recovery of the chain graph, and empirically validated via simulations and an application to U.S. macroeconomic data on monetary policy transmission mechanisms.

Abstract

Time series graphical models have recently received considerable attention for characterizing (conditional) dependence structures in multivariate time series. In many applications, the multivariate series exhibit variable-partitioned blockwise dependence, with distinct patterns within and across blocks. In this paper, we introduce a new class of time series Gaussian chain graph models that represent contemporaneous and lagged causal relations via directed edges across blocks, while capturing within-block conditional dependencies through undirected edges. In the frequency domain, this formulation induces a cross-frequency shared group sparse plus group low-rank decomposition of the inverse spectral density matrices, which we exploit to establish identifiability of the time series chain graph structure. Building on this, we then propose a three-stage learning procedure for estimating the undirected and directed edge sets, which involves optimizing a regularized Whittle likelihood with a group lasso penalty to encourage group sparsity and a novel tensor-unfolding nuclear norm penalty to enforce group low-rank structure. We investigate the asymptotic properties of the proposed method, ensuring its consistency for exact recovery of the chain graph structure. The superior empirical performance of the proposed method is demonstrated through both extensive simulation studies and an application to U.S. macroeconomic data that highlights key monetary policy transmission mechanisms.