Search arXivSearch

arXiv · 2607.17697

A Functional Central Limit Theorem for Localized Partial Sums of Non-Stationary Time Series

Abstract

A localized functional central limit theorem is established for kernel-weighted partial sum processes of piecewise locally stationary time series under geometric decay of the physical dependence measure. The localized process is shown to converge weakly to a centered Gaussian random distribution in $D'(0,1)$, and the limit extends naturally to an isonormal Gaussian process on $L^2([0,1])$. Weak convergence is further derived for processes indexed by totally bounded subsets of $L^2([0,1])$. As an application, the localized limit theory is used to construct tests for constant mean functions against linear, polynomial, and general alternatives in non-parametric regression with locally stationary errors. Simulation results and data examples illustrate the finite sample performance and practical applicability of the proposed methodology.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Florian Heinrichs. 2026-07-20. A Functional Central Limit Theorem for Localized Partial Sums of Non-Stationary Time Series. https://arxiv.org/abs/2607.17697

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A note on the distribution of the partial correlation coefficient with nonparametrically estimated marginal regressions

There has been much interest in the nonparametric testing of conditional independence in the econometric and statistical literature, but the simplest and potentially most useful method, based on the sample partial correlation, seems to have been overlooked, its distribution only having been investigated in some simple parametric instances. The present note shows that an easy to apply permutation test based on the sample partial correlation with nonparametrically estimated marginal regressions has good large and small sample properties.

math.ST

Instance-Log-Optimality of Portfolio-Based E-Processes and their Sequential Hypothesis Tests

We consider the problem of sequential hypothesis testing using $e$-processes. For a rich class of composite testing problems---which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of two-sample and independence testing as special cases---we show that any $e$-process satisfying a certain sublinear regret bound is asymptotically and almost surely instance-log-optimal for a composite alternative. This is a strong notion of optimality that has not previously been established for the aforementioned problems, and we provide explicit test supermartingales and $e$-processes satisfying this notion in a more general case. Furthermore, we derive matching lower and upper bounds on the expected rejection time in the high-confidence regime for the resulting sequential tests in all of these cases. The proofs of these results make weak, algorithm-agnostic moment assumptions and rely on a proof technique involving the aforementioned regret and a family of numeraire portfolios. Finally, we discuss how all of these theorems hold in a distribution-uniform sense, a notion of log-optimality that is stronger still and seems to be new to the literature.

math.ST

Common Drivers in Sparsely Interacting Hawkes Processes

We study a multivariate Hawkes process as a model for time-continuous relational event networks. The model does not assume the network to be known, it includes covariates, and it allows for both common drivers, parameters common to all the actors in the network, and also local parameters specific for each actor. We derive rates of convergence for all of the model parameters when both the number of actors and the time horizon tends to infinity. To prevent an exploding network, sparseness is assumed. We also discuss numerical aspects.

math.ST