Estimation of dynamic networks for high-dimensional nonstationary time series

Abstract

This paper is concerned with the estimation of time-varying networks for high-dimensional nonstationary time series. Two types of dynamic behaviors are considered: structural breaks (i.e., abrupt change points) and smooth changes. To simultaneously handle these two types of time-varying features, a two-step approach is proposed: multiple change point locations are first identified based on comparing the difference between the localized averages on sample covariance matrices, and then graph supports are recovered based on a kernelized time-varying constrained $L_1$-minimization for inverse matrix estimation (CLIME) estimator on each segment. We derive the rates of convergence for estimating the change points and precision matrices under mild moment and dependence conditions. In particular, we show that this two-step approach is consistent in estimating the change points and the piecewise smooth precision matrix function, under certain high-dimensional scaling limit. The method is applied to the analysis of network structure of the S\&P 500 index between 2003 and 2008.

References in corpus (17)

• High-dimensional graphs and variable selection with the Lasso
• Sparse permutation invariant covariance estimation
• Wild binary segmentation for multiple change-point detection
• Regularized estimation in sparse high-dimensional time series models
• Network exploration via the adaptive LASSO and SCAD penalties
• Multiple-change-point detection for high dimensional time series via sparsified binary segmentation
• Break detection in the covariance structure of multivariate time series models
• Estimating time-varying networks
• Local linear quantile estimation for nonstationary time series
• Covariance and precision matrix estimation for high-dimensional time series
• Structure estimation for discrete graphical models: Generalized covariance matrices and their inverses
• Nonparametric Bayes Modeling of Populations of Networks
• Rejoinder: The Dantzig selector: Statistical estimation when $p$ is much larger than $n$
• Gemini: Graph estimation with matrix variate normal instances
• Change-Point Estimation in High-Dimensional Markov Random Field Models
• Locally Adaptive Dynamic Networks
• Regularized estimation of linear functionals of precision matrices for high-dimensional time series