Assumption-Lean Inference for Spectral Differential Network Analysis of High-Dimensional Time Series
Abstract
Network analysis for multivariate time series is popular in many fields, from neuroscience to seismology. The inverse spectral density is a common choice for time series network analysis due to its representation of the frequency domain correlation between two variables after removing the best linear predictor of all other variables. In many applications, the goal is to study how these networks change across different conditions. For example, in neuroscience, one might be interested in how the brain connectivity network changes before and after stimulation. Towards this goal, we develop an inference framework based on a direct estimate of the difference in two high-dimensional inverse spectral densities. We develop a new Gaussian approximation error bound for any de-biased D-trace estimation procedure which is then leveraged to both inform optimal window sizes of Welch's estimators of the spectral density and establish asymptotic normality of our de-biased D-trace estimator. Moreover, we develop an efficient algorithm based on a generalized D-trace estimation procedure to overcome the computational complexity of high-dimensional inference. The method is illustrated on synthetic data experiments and on experiments with electroencephalography data.
Related
- Covariate Adjustment for Time-Restricted Marginal Win Statistics in Randomized Trials: Assumption-Lean Inference and Guaranteed Efficiency Gain
- Functional Analysis and Partial Differential Equations in Spectral Barron Spaces
- Spectral Chebyshev wavelet method for state-dependent fractional integro-differential equations in adaptive tumor growth modeling
- Asymptotic Anytime-Valid Quantile Inference under Local Differential Privacy
- Infinite Quantiles Inference under Local Differential Privacy
BibTeX
@misc{hellstern2026assumptionlean,
title = {{Assumption-Lean Inference for Spectral Differential Network Analysis of High-Dimensional Time Series}},
author = {Michael Hellstern and Byol Kim and Ali Shojaie},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.13609},
eprint = {2609.13609},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.13609},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Assumption-Lean Inference for Spectral Differential Network Analysis of High-Dimensional Time Series
AU - Michael Hellstern
AU - Byol Kim
AU - Ali Shojaie
PY - 2026
DA - 2026/09/11
PB - arXiv
DO - 10.48550/arxiv.2609.13609
UR - https://arxiv.org/abs/2609.13609
AB - Network analysis for multivariate time series is popular in many fields, from neuroscience to seismology. The inverse spectral density is a common choice for time series network analysis due to its representation of the frequency domain correlation between two variables after removing the best linear predictor of all other variables. In many applications, the goal is to study how these networks change across different conditions. For example, in neuroscience, one might be interested in how the brain connectivity network changes before and after stimulation. Towards this goal, we develop an inference framework based on a direct estimate of the difference in two high-dimensional inverse spectral densities. We develop a new Gaussian approximation error bound for any de-biased D-trace estimation procedure which is then leveraged to both inform optimal window sizes of Welch's estimators of the spectral density and establish asymptotic normality of our de-biased D-trace estimator. Moreover, we develop an efficient algorithm based on a generalized D-trace estimation procedure to overcome the computational complexity of high-dimensional inference. The method is illustrated on synthetic data experiments and on experiments with electroencephalography data.
ER -