In stationary subspace analysis (SSA) one assumes that the observable p-variate time series is a linear mixture of a k-variate nonstationary time series and a (p-k)-variate stationary time series. The aim is then to estimate the unmixing matrix which transforms the observed multivariate time series onto stationary and nonstationary components. In the classical approach multivariate data are projected onto stationary and nonstationary subspaces by minimizing a Kullback-Leibler divergence between Gaussian distributions, and the method only detects nonstationarities in the first two moments. In this paper we consider SSA in a more general multivariate time series setting and propose SSA methods which are able to detect nonstationarities in mean, variance and autocorrelation, or in all of them. Simulation studies illustrate the performances of proposed methods, and it is shown that especially the method that detects all three types of nonstationarities performs well in various time series settings. The paper is concluded with an illustrative example.
We are concerned with nonparametric hypothesis testing of time series functionals. It is known that the popular autoregressive sieve bootstrap is, in general, not valid for statistics whose (asymptotic) distribution depends on moments of order higher than two, irrespective of whether the data come from a linear time series or a nonlinear one. Inspired by nonlinear system theory we circumvent this non-validity by introducing a higher-order bootstrap scheme based on the Volterra series representation of the process. In order to estimate coefficients of such a representation efficiently, we rely …
Let $\{X_i(t),t\ge0\}, 1\le i\le n$ be independent copies of a stationary process $\{X(t), t\ge0\}$. For given positive constants $u,T$, define the set of $r$th conjunctions $ C_{r,T,u}:= \{t\in [0,T]: X_{r:n}(t) > u\}$ with $X_{r:n}(t)$ the $r$th largest order statistics of $X_1(t), \ldots , X_n(t), t\ge 0$. In numerous applications such as brain mapping and digital communication systems, of interest is the approximation of the probability that the set of conjunctions $C_{r,T,u}$ is not empty. Imposing the Albin's conditions on $X$, in this paper we obtain an exact asymptotic expansion of thi…
Stationary subspace analysis (SSA) searches for linear combinations of the components of nonstationary vector time series that are stationary. These linear combinations and their number defne an associated stationary subspace and its dimension. SSA is studied here for zero mean nonstationary covariance processes. We characterize stationary subspaces and their dimensions in terms of eigenvalues and eigenvectors of certain symmetric matrices. This characterization is then used to derive formal statistical tests for estimating dimensions of stationary subspaces. Eigenstructure-based techniques ar…
We establish asymptotic properties of $M$-estimators, defined in terms of a contrast function and observations from a continuous-time locally stationary process. Using the stationary approximation of the sequence, $θ$-weak dependence, and hereditary properties, we give sufficient conditions on the contrast function that ensure consistency and asymptotic normality of the $M$-estimator. As an example, we obtain consistency and asymptotic normality of a localized least squares estimator for observations from a sequence of time-varying Lévy-driven Ornstein-Uhlenbeck processes. Furthermore, for a s…
In this paper, we survey some recent results on statistical inference (parametric and nonparametric statistical estimation, hypotheses testing) about the spectrum of stationary models with tapered data, as well as, a question concerning robustness of inferences, carried out on a linear stationary process contaminated by a small trend. We also discuss some question concerning tapered Toeplitz matrices and operators, central limit theorems for tapered Toeplitz type quadratic functionals, and tapered Fejér-type kernels and singular integrals. These are the main tools for obtaining the correspondi…
This paper deals with adaptive radar detection of a subspace signal competing with two sources of interference. The former is Gaussian with unknown covariance matrix and accounts for the joint presence of clutter plus thermal noise. The latter is structured as a subspace signal and models coherent pulsed jammers impinging on the radar antenna. The problem is solved via the Principle of Invariance which is based on the identification of a suitable group of transformations leaving the considered hypothesis testing problem invariant. A maximal invariant statistic, which completely characterizes t…
The Rényi entropy is a generalization of the Shannon entropy and is widely used in mathematical statistics and applied sciences for quantifying the uncertainty in a probability distribution. We consider estimation of the quadratic Rényi entropy and related functionals for the marginal distribution of a stationary m-dependent sequence. The U-statistic estimators under study are based on the number of epsilon-close vector observations in the corresponding sample. A variety of asymptotic properties for these estimators are obtained (e.g., consistency, asymptotic normality, Poisson convergence). T…
We describe the asymptotic behavior of the conditional least squares estimator of the offspring mean for subcritical strongly stationary Galton--Watson processes with regularly varying immigration with tail index $α\in (1,2)$. The limit law is the ratio of two dependent stable random variables with indices $α/2$ and $2α/3$, respectively, and it has a continuously differentiable density function. We use point process technique in the proofs.
In this paper, we provide non-parametric statistical tools to test stationarity of microstructure noise in general hidden Ito semimartingales, and discuss how to measure liquidity risk using high frequency financial data. In particular, we investigate the impact of non-stationary microstructure noise on some volatility estimators, and design three complementary tests by exploiting edge effects, information aggregation of local estimates and high-frequency asymptotic approximation. The asymptotic distributions of these tests are available under both stationary and non-stationary assumptions, th…
We consider the problem of estimating the context tree of a stationary ergodic process with finite alphabet without imposing additional conditions on the process. As a starting point we introduce a Hamming metric in the space of irreducible context trees and we use the properties of the weak topology in the space of ergodic stationary processes to prove that if the Hamming metric is unbounded, there exist no consistent estimators for the context tree. Even in the bounded case we show that there exist no two-sided confidence bounds. However we prove that one-sided inference is possible in this …
In this work we introduce the concept of Bures-Wasserstein barycenter $Q_*$, that is essentially a Fréchet mean of some distribution $\mathbb{P}$ supported on a subspace of positive semi-definite Hermitian operators $\mathbb{H}_{+}(d)$. We allow a barycenter to be restricted to some affine subspace of $\mathbb{H}_{+}(d)$ and provide conditions ensuring its existence and uniqueness. We also investigate convergence and concentration properties of an empirical counterpart of $Q_*$ in both Frobenius norm and Bures-Wasserstein distance, and explain, how obtained results are connected to optimal tra…
Many statistical estimation procedures lead to nonconvex optimization problems. Algorithms to solve these are often guaranteed to output a stationary point of the optimization problem. Oracle inequalities are an important theoretical instrument to asses the statistical performance of an estimator. Oracle results have focused on the theoretical properties of the uncomputable (global) minimum or maximum. In the present work a general framework used for convex optimization problems to derive oracle inequalities for stationary points is extended. A main new ingredient of these oracle inequalities …
For statistical analysis of multiway contingency tables we propose modeling interaction terms in each maximal compact component of a hierarchical model. By this approach we can search for parsimonious models with smaller degrees of freedom than the usual hierarchical model, while preserving conditional independence structures in the hierarchical model. We discuss estimation and exacts tests of the proposed model and illustrate the advantage of the proposed modeling with some data sets.
Stationary determinantal point processes are proved to be Brillinger mixing. This property is an important step towards asymptotic statistics for these processes. As an important example, a central limit theorem for a wide class of functionals of determinantal point processes is established. This result yields in particular the asymptotic normality of the estimator of the intensity of a stationary determinantal point process and of the kernel estimator of its pair correlation.
For a high-dimensional parameter of interest, tests based on quadratic statistics are known to have low power against subsets of the parameter space (henceforth, parameter subspaces). In addition, they typically involve an inverse covariance matrix which is difficult to estimate in high-dimensional settings. I simultaneously address these two issues by proposing a novel test statistic that is large in a conic parameter subspace of interest. This test statistic generalizes the Wald statistic and nests many well-known test statistics. For a given parameter subspace, the statistic is free of tuni…
A common class of methods for analyzing of multivariate time series, stationary and nonstationary, decomposes the observed series into latent sources. Methods such as principal compoment analysis (PCA), independent component analysis (ICA) and Stationary Subspace Analysis (SSA) assume the observed multivariate process is generated by latent sources that are stationary or nonstationary. We develop a method that tracks changes in the complexity of a 32-channel local field potential (LFP) signal from a rat following an experimentally induced stroke. We study complexity through the latent sources …
Perturbation bounds for singular spaces, in particular Wedin's $\sin Θ$ theorem, are a fundamental tool in many fields including high-dimensional statistics, machine learning, and applied mathematics. In this paper, we establish separate perturbation bounds, measured in both spectral and Frobenius $\sin Θ$ distances, for the left and right singular subspaces. Lower bounds, which show that the individual perturbation bounds are rate-optimal, are also given. The new perturbation bounds are applicable to a wide range of problems. In this paper, we consider in detail applications to low-rank matri…
For many relevant statistics of multivariate time series, no valid frequency domain bootstrap procedures exist. This is mainly due to the fact that the distribution of such statistics depends on the fourth-order moment structure of the underlying process in nearly every scenario, except for some special cases like Gaussian time series. In contrast to the univariate case, even additional structural assumptions such as linearity of the multivariate process or a standardization of the statistic of interest do not solve the problem. This paper focuses on integrated periodogram statistics as well a…
