Skip to Content
  • Proceeding Paper
  • Open Access

24 September 2026

9 Pages

Confidence Bands for Local Non-Stationarity Detection †

Dipartimento di Statistica, Informatica ed Applicazioni, Università di Firenze, 50134 Firenze, Italy
†
Presented at the 12th International Conference on Time Series and Forecasting, Canaria, Spain, 15–17 July 2026.

Abstract

This article develops an asymptotic theory for the sample (time-averaged) variance of the locally stationary wavelet packet (LSWP) processes. Our focus is the periodogram and the sample variance, and in particular its average. Under a near-epoch-dependence (NED) condition on the periodogram, and mild moment and summability assumptions, we establish a central limit theorem and a consistent estimator for the average process variance. These results yield asymptotic stationarity bands for the average variance, providing a simple, theoretically grounded benchmark for second-order stationarity in packet-domain models.

1. Introduction

For a stationary time series, second-order properties such as the autocovariance function and spectrum are time-invariant. In many applications (financial volatility, geophysics, biomedical signals), these properties evolve over time: series can appear approximately stationary on short intervals but exhibit clear changes on longer horizons. The locally stationary literature formalizes this idea by allowing a smoothly varying local spectrum; foundational work includes Priestley’s evolutionary-spectrum formulation [1] and later treatments of evolutionary spectra [2,3], as well as subsequent general frameworks and reviews [4,5]. Wavelet-based models provide an alternative, multiscale notion of local second-order structure. The locally stationary wavelet (LSW) model of [6] represents a nonstationary process by a superposition of non-decimated wavelet atoms with slowly varying amplitudes, leading to the evolutionary wavelet spectrum (EWS) and associated (bias-corrected) wavelet periodograms. Wavelet packet extensions enrich the time–frequency tiling and can better capture oscillatory features; the locally stationary wavelet packet (LSWP) framework of [7] develops basis selection and model fitting for this class. This paper is a theory note aimed at a single inferential building block: a central limit theorem (CLT) for the average sample variance of LSWP processes. The main results are: (i) an L 2 near-epoch-dependence (NED) control for the time-varying periodogram and the average sample variance; (ii) a CLT for the average sample variance; and (iii) consistent estimators of the corresponding average (marginal) variance and its standard error, yielding its asymptotic stationarity bands. Section 2 introduces the relevant definitions and assumptions. Section 3 states the NED bounds and the CLT and describes the resulting stationarity bands. Proofs and technical lemmas are collected in Appendix A.

2. Notation, Definitions and Assumptions

We consider a locally stationary wavelet packet representation from [7]. For a nontrivial theory we recall the necessary concepts from that paper, and define some further tools and notation. Non-decimated wavelet packets are locally supported oscillatory functions ψ j , i , k ( t ) , where the index j = 1 , 2 , … , log 2 ( T ) controls the support width and the scale of oscillation, the index i = 0 , 1 , … , 2 j controls the oscillation frequency within a fixed scale, and k denotes translation. In what follows, B denotes a redundant collection of dyadic increasing partitions of the frequency interval ( 0 , 1 / 2 ] , and each b ∈ B is a disjoint cover of that interval. Summation over packet indices is therefore taken over p , p ′ , q ∈ b . A basis b can be selected from B as shown in [7].
Definition 1 (Non-decimated wavelet packets).
Let { ψ p , k ( t ) } p ∈ b , k ∈ Z be a non-decimated wavelet packet family (a redundant packet frame), indexed by the flattened packet index p = ( j p , i p ) and translation k. Let L p denote the support length of packet p, with L p ≍ 2 j p .
Definition 2 (Cross-correlation wavelet packets).
For p , p ′ ∈ b the cross-correlation wavelet packet is defined by
Ψ p , p ′ ( τ ) = ∑ k ψ p , k ψ p ′ , k − τ ,
where ψ p , k are the non-decimated wavelet packets from Definition 1. When p ′ = p , Ψ p , p ( τ ) = Ψ p ( τ ) is the corresponding autocorrelation wavelet packet. Let L p , p ′ denote the support length of Ψ p , p ′ , with L p , p ′ ≍ 2 j p ∧ j p ′ .
Definition 3 (Locally stationary wavelet packet process).
A locally stationary wavelet packet (LSWP) process is a triangular array { X t ; T } with the mean-square representation
X t ; T = ∑ p ∈ b ∑ k ω p , k ; T ψ p , k ( t ) ε p , k ,
where b is a partition element of the redundant dictionary B . The amplitudes satisfy
sup k | ω p , k ; T − W p ( k / T ) | ≤ C p T , ∥ W p 2 ∥ T V ≤ L p , L p ≤ K 2 − j p ,
for finite constants C p , L p and K, and | | x | | T V is the total variation norm of x.
More details on this setup and on the packet indexing conventions are given in [7]. The assumptions below are stated at the level needed for the theory that follows. They emphasize (i) moment conditions on the innovations, (ii) summability and tail decay of packet-correlation kernels, and (iii) a multiscale growth regime ensuring uniformity over the packet indices used in the cumulative statistics.
Assumption 1 (Innovations: moments and weak dependence).
The array { ϵ q , m } q , m satisfies E ϵ q , m = 0 , E ϵ q , m 2 = 1 , and sup q , m E | ϵ q , m | 4 + δ < ∞ for some δ > 0 . Moreover, for each fixed q the sequence { ϵ q , m } m is α-mixing (see [8]), with coefficients α ϵ ( r ) such that ∑ r ≥ 1 α ϵ ( r ) δ / ( 2 + δ ) < ∞ .
Assumption 2 (Weighted tail summability of packet correlations).
There exists ε > 0 such that, uniformly over all relevant indices ( q , p ′ ) ,
∑ b ∈ Z ( 1 + | b | ) 1 + 2 ε Ψ q , p ′ 2 ( b ) < ∞ , ∑ b ∈ Z ( 1 + | b | ) 1 + 2 ε Ψ q , p ′ 4 ( b ) < ∞ .
Assumption 3 (Uniform bounds on time-varying amplitudes).
There exist finite constants C 2 , C 4 such that sup q , m , T ω q , m ; T 2 ≤ C 2 and sup q , m , T ω q , m ; T 4 ≤ C 4 . Whenever sums over packet indices are used, the corresponding scale-energy is summable so that the resulting bounds are finite.
Assumption 4 (Multiscale growth regime).
Inner sums defining the LSWP process and the local second-order structure are taken over p ∈ b , while the cumulative statistics use a finite sample truncation 1 ≤ p ≤ P T satisfying log 2 ( T ) ≤ P T < T . All bounds involving cumulative statistics are uniform in ( k , T ) and over p ≤ P T .
Remark 1 (Local spectra and local covariance for LSWP processes).
For z ∈ [ 0 , 1 ) and k = [ z T ] , and for increasing T, we have [ z T ] / T → z . This is the rescaled time. We then define the evolutionary wavelet packet spectrum (EWPS) by
S p ( z ) = | W p ( z ) | 2 ,
where the single index p is a shorthand for the packet pair ( j p , i p ) ; see [7]. The marginal EWPS is S ¯ p = ∫ 0 1 S p ( z ) d z . The time-localized covariance is
C ( z , τ ) = ∑ p ∈ b S p ( z ) Ψ p ( τ ) ,
where Ψ p ( τ ) is the autocorrelation packet from Definition 2. Since Ψ p ( 0 ) = 1 for all p, the time-localized variance is
σ 2 ( z ) = C ( z , 0 ) = ∑ p ∈ b S p ( z ) .
The corresponding marginal variance is
σ 2 = ∫ 0 1 C ( z , 0 ) d z = ∑ p ∈ b ∫ 0 1 S p ( z ) d z .
Definition 4 (Packet periodogram and bias-corrected periodogram).
Given a packet family { ψ p , k } , define the raw packet periodogram by I p , k ; T = ∑ t ψ p ( t − k ) X t ; T 2 . Let A = ( A p , p ′ ) with A p , p ′ = ∑ τ Ψ p , p ′ 2 ( τ ) , and let A − 1 = ( A p , p ′ − 1 ) denote its inverse on the relevant packet set. The bias-corrected (asymptotically unbiased) packet periodogram is
L p , k ; T = ∑ p ′ = 1 P T A p , p ′ − 1 I p ′ , k ; T .
The bias-corrected packet periodogram satisfies E L p , k ; T = S p ( z ) + O ( T − 1 ) uniformly in k.
Definition 5 (Locally stationary sample variance).
The locally stationary sample variance (LSSV) is the sequence
s k ; T 2 = ∑ p = 1 P T L p , k ; T .
We center it by the deterministic local variance curve and define
U k ; T = s k ; T 2 − σ 2 ( k / T ) , b T 2 = E ∑ k = 0 T − 1 U k ; T 2 .

3. L 2 NED Properties of LSWP Statistics

This section studies the dependence structure of the bias-corrected packet periodogram and of the locally stationary sample variance. We use the L 2 near-epoch-dependence framework of [8], with the innovation array as the underlying weakly dependent process.
Definition 6.
For an array { { ξ k ; T } k = − ∞ ∞ } T = 1 ∞ and G k − d ; T k + d = σ ( ξ k − d ; T , … , ξ k + d ; T ) , an integrable array { { X k ; T } } T is said to be L 2 near-epoch-dependent if
X k ; T − E ( X k ; T ∣ G k − d ; T k + d ) 2 ≤ a T ( 1 ) a d ; T ( 2 )
uniformly in k, where a d ; T ( 2 ) → 0 as d → ∞ . If a d ; T ( 2 ) = O ( d λ − ϵ ) for some ϵ > 0 , the array is said to be L 2 NED of size λ (see [8] for details).
For the asymptotic arguments below we also define the following:
Definition 7.
Let
κ i ϵ = cum i ( ϵ q , m ) , G k − d ; T k + d = σ ( ϵ ¯ k − d ; T , … , ϵ ¯ k + d ; T ) ,
where ϵ ¯ m ; T = ( ϵ 1 , m , … , ϵ P T , m ) ′ , and let S ˜ p = sup z S p ( z ) . Define
δ T = sup 1 ≤ p ≤ P T C p S ˜ p , w i t h δ T / T ∈ ℓ ∞ .
Under Assumption 1, the innovation array is α -mixing. The next theorem gives the required L 2 NED bound for the bias-corrected packet periodogram.
Theorem 1.
Let X t ; T be specified as in Definition 3 and satisfy Assumptions 1–4. Let { L p , k ; T } k be the bias-corrected packet periodogram sequence for packet p from Definition 4. Then for each p ∈ b , there exist constants b ¯ p ; T = 1 and ν p , d ; T = O ( d − 1 / 2 − ε ) such that, uniformly in k,
L p , k ; T − E L p , k ; T ∣ G k − d ; T k + d 2 ≤ b ¯ p ; T ν p , d ; T .
In particular, { L p , k ; T } k is L 2 NED of size − 1 / 2 − ε .
The LSSV sequence inherits this dependence structure by summing over the finitely many packet indices included in the finite sample truncation P T .
Proposition 1.
Let X t ; T be specified as in Definition 3 and satisfy Assumptions 1–4. Consider the sequences { L p , k ; T } k and { s k ; T 2 } k from Definitions 4 and 5. If, for every p ≤ P T , { L p , k ; T } k satisfies an L 2 NED bound of size − 1 / 2 − ε with constants ( b ¯ p ; T , ν p , d ; T ) , then { s k ; T 2 } k also satisfies an L 2 NED bound of size − 1 / 2 − ε .

Weak Convergence

We derive a central limit theorem for the centered local sample variance. Since, for all k,
E s k ; T 2 = σ 2 ( k / T ) + O ( T − 1 ) ,
centering by σ 2 ( k / T ) is asymptotically equivalent to centering by the exact mean.
Theorem 2.
Let X t ; T be specified as in Definition 3 and satisfy Assumptions 1–4. Consider { U k ; T } k , { s k ; T 2 } k and b T 2 from Definition 5. Then
b T − 1 ∑ k = 0 T − 1 U k ; T ⇝ N ( 0 , 1 ) .
Moreover, the O ( T − 1 ) remainder in the centering can be omitted because
T sup k E s k ; T 2 − σ 2 ( k / T ) = O ( T − 1 / 2 ) → 0 .
To construct confidence bands to assess departures from stationarity using the average sample variance, we require (i) a consistent estimator of the average variance level and (ii) a consistent estimator of the scaling constant b T / T appearing in (10).
Corollary 1.
Under the conditions of Theorem 2,
1 T ∑ k = 0 T − 1 s k ; T 2 − 1 T ∑ k = 0 T − 1 σ 2 ( k / T ) → p 0 .
Proposition 2.
Assume the conditions of Theorem 2 and, in addition, that { U k ; T } k is locally short memory so that sup T ∑ h ≥ 0 sup k | Cov ( U k ; T , U k + h ; T ) | < ∞ . Let w be bounded with w ( 0 ) = 1 and w ( x ) = 0 for x > 1 , and let L T → ∞ with L T / T → 0 . Define
b ^ T 2 = ∑ k = 0 T − 1 U k ; T 2 + 2 ∑ h = 1 L T w ( h / L T ) ∑ k = h T − 1 U k ; T U k − h ; T , b ^ T / T = b ^ T 2 T .
If lim   inf T → ∞ b T 2 / T > 0 , then b ^ T / T / ( b T / T ) → p 1 .
Let s ¯ T 2 = T − 1 ∑ k = 0 T − 1 s k ; T 2 and let z 1 − α / 2 denote the ( 1 − α / 2 ) quantile of the standard normal distribution. Then, for confidence level ( 1 − α ) ,
s ¯ T 2 ± z 1 − α / 2 b ^ T / T
are the endpoints of an asymptotic stationarity band for the local variance sequence { s k ; T 2 } k = 0 T − 1 .

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The author declares no conflicts of interest.

Appendix A. Lemmas and Proofs

Lemma A1.
∑ p s = 1 P T A q s , p s ′ − 1 ∑ q s , p s ′ , m s O C q s + L q s | k − m s | T Ψ q s , p s ′ 2 ( k − m s ) = O 1 T .
Proof of Lemma A1.
For s = 1 , 2 we have
∑ p s = 1 P T ∑ p s ′ , q s A p s , p s ′ − 1 ∑ m s C q s + L q s | k − m s | Ψ q s , p s ′ 2 ( k − m s ) = ∑ p s = 1 P T ∑ q s , p s ′ A p s ′ , p s − 1 A p s ′ , q s C q s + 2 L q s ( L q s , p s ′ − 1 ) ≤ ∑ p s = 1 P T ∑ q s , p s ′ A p s ′ , p s − 1 A p s ′ , q s C q s + 2 L q s L q s , p s ′ ≤   ∑ p s = 1 P T ∑ q s , p s ′ A p s ′ , p s − 1 A p s ′ , q s C q s + 2 L q s L q s =   ∑ p s = 1 P T ∑ q s δ p s , q s 2 C q s + L q s L q s =   ∑ p s = 1 P T 2 C p s + L p s L p s ≤ K .
Here K < ∞ depends on the envelope L p ≤ K 2 − j p , the support relation L p ≍ 2 j p , the fixed finiteness of the outer truncation P T , and the uniform control of C p / S ˜ p through δ T . □
Lemma A2.
Let b T 2 = E ∑ k U k ; T 2 . Then we have b T ≍ T 1 / 2 .
Proof of Lemma 2.
Based on the integer sequence τ = − k , … , 0 , … , T − k − 1 , define τ ′ = τ + k . For P T < ∞ we have
b T 2 = ∑ k T − 1 ∑ τ ∏ s = 1 2 ∑ p s = 1 P T ∑ p s ′ , q s A p s , p s ′ − 1 ∑ m s ( 1 + κ 4 ϵ I s = 1 ) f q s , p s ′ , k + τ , m s = ∑ k T − 1 ∑ τ ∏ s = 1 2 ∑ p s = 1 P T ∑ p s ′ , q s A p s , p s ′ − 1 ∑ m s ( 1 + κ 4 ϵ I s = 1 ) ω q s , m s ; T 2 Ψ q s , p s ′ 2 ( k − m s + τ ) = ∑ k T − 1 ∑ τ ∏ s = 1 2 ∑ p s = 1 P T ∑ p s ′ , q s A p s , p s ′ − 1 ( 1 + κ 4 ϵ I s = 1 ) S q s k T + ∑ m s O C q s + L q s ( k − m s ) T × × Ψ q s , p s ′ 2 ( k − m s + τ ) = ∑ k T − 1 ∏ s = 1 2 ∑ p s = 1 P T ∑ p s ′ , q s A p s , p s ′ − 1 ( 1 + κ 4 ϵ I s = 1 ) S q s k T ∑ m s ∑ τ ′ Ψ q s , p s ′ 2 ( τ ′ − m s ) + O 1 T
We use the finite support of cross-correlation wavelet packets in order to bound the double summation. Since in general ∑ τ Ψ q , p ′ 2 ( τ ) = A q , p ′ we have
∑ m s ∑ τ ′ Ψ q s , p s ′ 2 ( τ ′ − m s ) = A q s , p s ′ B q s , p s ′
where
B q s , p s ′ = 1 , if s = 1 ; L q s , p s ′ , if s = 2 .
By using this result and Lemma 1, we bound the constants b T 2 as
b T 2 ≤ ∑ k T − 1 ∏ s = 1 2 ∑ p s = 1 P T ∑ q s , p s ′ A p s , p s ′ − 1 A q s , p s ′ B q s , p s ′ ( 1 + κ 4 ϵ I s = 1 ) S q s k T + O 1 T ≤ ∑ k T − 1 ∏ s = 1 2 ∑ p s = 1 P T ∑ q s ∑ p s ′ A p s , p s ′ − 1 A q s , p s ′ B q s ( 1 + κ 4 ϵ I s = 1 ) S q s k T + O 1 T = ∑ k T − 1 ∏ s = 1 2 ∑ p s = 1 P T ∑ q s δ p s , q s B q s ( 1 + κ 4 ϵ I s = 1 ) S q s k T + O 1 T = ∑ k T − 1 ∏ s = 1 2 ( 1 + κ 4 ϵ I s = 1 ) ∑ p s = 1 P T B p s S p s k T + O 1 T
This result shows that the constants b T 2 are of order O ( T ) . □
Proof of Proposition 1.
From Definition 5, s k ; T 2 = ∑ p = 1 P T L p , k ; T . Hence, for every d ≥ 0 ,
s k ; T 2 − E s k ; T 2 ∣ G k − d ; T k + d 2 ≤ ∑ p = 1 P T L p , k ; T − E L p , k ; T ∣ G k − d ; T k + d 2 .
If each packet–periodogram sequence satisfies an L 2 NED bound of size − 1 / 2 − ε , then
s k ; T 2 − E s k ; T 2 ∣ G k − d ; T k + d 2 ≤ ∑ p = 1 P T b ¯ p ; T ν p , d ; T .
Since P T < ∞ for each T by Assumption 4, the finite sum on the right-hand side preserves the rate O ( d − 1 / 2 − ε ) . Therefore, { s k ; T 2 } k satisfies an L 2 NED bound of size − 1 / 2 − ε . □
Proof of Theorem 1.
Using the notation introduced in Definition 7, let
Q p ′ , k , d ; T = ∑ | m − k | > d ∑ q Ψ q , p ′ ( k − m ) ω q , m ; T ϵ q , m κ 4 Q p ′ , d = sup k cum 4 ( Q p ′ , k , d ; T )
We also define
L p , k ; T = ∑ p ′ A p , p ′ − 1 I p ′ , k ; T = ∑ p ′ A p , p ′ − 1 ∑ q , m Ψ q , p ′ ( k − m ) ω q , m ; T ϵ q , m 2 = ∑ p ′ A p , p ′ − 1 ∑ q 1 , q 2 ∑ m 1 , m 2 f p ′ , q 1 , k , m 1 f p ′ , q 2 , k , m 2 ϵ q 1 , m 1 ϵ q 2 , m 2
along with the sequence
L p , k ; T − E ( L p , k ; T ∣ G k − d ; T k + d ) = ∑ p ′ A p , p ′ − 1 J p ′ , k ; T 2 − Z p ′ , k , d ; T 2 − Q ¯ p ′ , k , d ; T ( 2 )
where J p ′ , k ; T 2 = Z p ′ , k , d ; T 2 + Q p ′ , k , d ; T 2 such that E Q p ′ , k , d ; T 2 = Q ¯ p ′ , k , d ; T ( 2 ) so that E ( J p ′ , k ; T 2 | G k − d ; T k + d ) = Z p ′ , k , d ; T 2 + Q ¯ p ′ , k , d ; T ( 2 ) and
Z p ′ , k , d ; T 2 = ∑ | m − k | ≤ d ∑ q Ψ q , p ′ ( k − m ) ω q , m ; T ϵ q , m 2 Q ¯ p ′ , k , d ; T ( 2 ) = ∑ | m − k | > d ∑ q Ψ q , p ′ 2 ( k − m ) ω q , m ; T 2
Since J and Z are square-integrable, the following elementary bound applies by setting Q 2 = E ( J − Z ) 2 ; in the present proof this corresponds to Q 2 = Q ¯ p ′ , k , d ; T ( 2 ) . Then, using ( x − c ) 2 ≤ 2 x 2 + 2 c 2 and ( J 2 − Z 2 ) 2 = ( J − Z ) 2 ( J + Z ) 2 with Cauchy–Schwarz, we obtain
E ( J 2 − Z 2 − Q 2 ) 2 ≤ 2 E ( J 2 − Z 2 ) 2 + 2 Q 4 ≤ 4 Q 2 E ( J 2 + Z 2 ) + 2 Q 4 .
Define J ˜ p ′ ; T ( 2 ) = 2 ( 1 + δ T / T ) ∑ q A p ′ , q S ˜ q and Q ˜ p ′ , d ; T ( 2 ) = 2 ( 1 + δ T / T ) ∑ q S ˜ q ∑ | g | > d Ψ q , p ′ 2 ( g ) . By construction, J ˜ p ′ ; T ( 2 ) bounds sup k E ( J p ′ , k ; T 2 + Z p ′ , k , d ; T 2 ) , and Q ˜ p ′ , d ; T ( 2 ) bounds sup k Q ¯ p ′ , k , d ; T ( 2 ) . Moreover, Ref. [7] showed that { A p , p ′ − 1 } p ′ is a summable sequence. We therefore bound the L 2 norm as
E ∑ p ′ A p , p ′ − 1 ( J p ′ , k ; T 2 − Z p ′ , k , d ; T 2 − Q ¯ p ′ , k , d ; T ( 2 ) ) 2 ≤ ∑ p ′ ( A p , p ′ − 1 ) 2 ∑ p ′ E ( J p ′ , k ; T 2 − Z p ′ , k , d ; T 2 − Q ¯ p ′ , k , d ; T ( 2 ) ) 2 ≤ ∑ p ′ ( A p , p ′ − 1 ) 2 ∑ p ′ κ 4 Q p ′ , d + 4 ∑ p ′ Q ¯ p ′ , k , d ; T ( 2 ) E ( J p ′ , k ; T 2 + Z p ′ , k , d ; T 2 ) + 2 ∑ p ′ ( Q ¯ p ′ , k , d ; T ( 2 ) ) 2 ≤ ∑ p ′ ( A p , p ′ − 1 ) 2 ∑ p ′ κ 4 Q p ′ , d + 4 ∑ p ′ Q ¯ p ′ , k , d ; T ( 2 ) J ˜ p ′ ; T ( 2 ) + 2 ∑ p ′ ( Q ¯ p ′ , k , d ; T ( 2 ) ) 2 ≤ ∑ p ′ ( A p , p ′ − 1 ) 2 ∑ p ′ κ 4 Q p ′ , d + 4 ∑ p ′ Q ˜ p ′ , d ; T ( 2 ) J ˜ p ′ ; T ( 2 ) + 2 ∑ p ′ ( Q ˜ p ′ , d ; T ( 2 ) ) 2 = ν p , d ; T 2
Using standard cumulant properties, we obtain
κ 4 Q p ′ , d = 2 κ 4 ϵ ( 1 + δ T / T ) ∑ q S ˜ q 2 ∑ | g | > d Ψ q , p ′ 4 ( g ) ≥ ∑ | m − k | > d ∑ q Ψ q , p ′ 4 ( k − m ) ω q , m ; T 4 κ 4 ϵ
It turns out that ∑ p ′ κ 4 Q p ′ , d < ∞ , the sequence ω q , m ; T 4 being uniformly bounded as a consequence of Assumption 3, and the positive sequence { Ψ q , p ′ 4 ( k − m ) } p ′ being bounded above by the converging sequence { A q , p ′ } p ′ . Looking at Equations (A6) and (A7), by Assumption 2 we have the uniform tail bounds ∑ | g | > d Ψ q , p ′ 4 ( g ) = O ( d − 1 − 2 ε ) and ∑ | g | > d Ψ q , p ′ 2 ( g ) = O ( d − 1 − 2 ε ) . Therefore, κ 4 Q p ′ , d = O ( d − 1 − 2 ε ) and Q ˜ p ′ , d ; T ( 2 ) = O ( d − 1 − 2 ε ) . The term 2 ∑ p ′ ( Q ˜ p ′ , d ; T ( 2 ) ) 2 is then O ( d − 2 − 4 ε ) and does not affect the leading rate for ν p , d ; T 2 . In particular, ν p , d ; T 2 = O ( d − 1 − 2 ε ) ; hence ν p , d ; T = O ( d − 1 / 2 − ε ) and L p , k ; T satisfies the L 2 –NED bound of size − 1 / 2 − ε . □
Proof of Theorem 2.
Set U ˜ k ; T = U k ; T − E U k ; T . Since σ 2 ( k / T ) is deterministic, U ˜ k ; T inherits the L 2 –NED bound of the LSSV sequence from Proposition 1. Moreover, by Assumption 1 the innovation array is α –mixing with sufficient moments. Therefore, the CLT for NED functions of strong mixing processes (Davidson [8], Theorem 24.6 with Lemma 24.7) applies to b T − 1 ∑ k = 0 T − 1 U ˜ k ; T once the standard conditions are verified.
(a) 
By construction, E U ˜ k ; T = 0 and with b T 2 = E ∑ k = 0 T − 1 U ˜ k ; T 2 we have
E ∑ k = 0 T − 1 U ˜ k ; T b T = 0 , E ∑ k = 0 T − 1 U ˜ k ; T b T 2 = 1 .
The centering error is negligible because sup k | E U k ; T | = O ( T − 1 ) uniformly in k and b T ≍ T (Lemma A2); hence, b T − 1 ∑ k = 0 T − 1 E U k ; T = O ( T − 1 / 2 ) → 0 .
(b) 
From Assumptions 1–4 and standard continuity arguments, for some r > 2 we have sup k ; T ∥ U ˜ k ; T / b T ∥ r < ∞ .
(c) 
U ˜ k ; T is L 2 –NED of size − 1 / 2 − ε as a consequence of Proposition 1, and the base innovation process is α -mixing by Assumption 1.
(d) 
Lemma A2 implies b T ≍ T 1 / 2 .
This completes the proof. □
Proof of Proposition 2.
Write b T 2 = ∑ k = 0 T − 1 E U k ; T 2 + 2 ∑ h ≥ 1 ∑ k = h T − 1 E ( U k ; T U k − h ; T ) . Decompose b ^ T 2 − b T 2 = R T , 1 + R T , 2 + R T , 3 , where R T , 1 is the empirical-minus-mean part over 1 ≤ h ≤ L T , R T , 2 is the kernel bias from ( w ( h / L T ) − 1 ) over 1 ≤ h ≤ L T , and R T , 3 is the covariance tail over h > L T . By the L 2 -NED law of large numbers for the uniformly short-memory quadratic array (see [8]), uniformly over 1 ≤ h ≤ L T , T − 1 sup 1 ≤ h ≤ L T | ∑ k = h T − 1 ( U k ; T U k − h ; T − E ( U k ; T U k − h ; T ) ) | = o p ( 1 ) ; hence, R T , 1 = o p ( T ) since L T / T → 0 . By local short memory and bounded w, both R T , 2 = o ( T ) and R T , 3 = o ( T ) as L T → ∞ . Therefore, T − 1 ( b ^ T 2 − b T 2 ) → p 0 , and with lim   inf T b T 2 / T > 0 we conclude ( b ^ T / T ) / ( b T / T ) → p 1 by continuity. □

References

  1. Priestley, M. Evolutionary spectra and non-stationary processes. J. R. Stat. Soc. Ser. B 1965, 27, 204–237. [Google Scholar] [CrossRef] [Scilit]
  2. Priestley, M. Spectral Analysis and Time Series; Academic Press: London, UK, 1983. [Google Scholar]
  3. Priestley, M. Non-Linear and Non-Stationary Time Series Analysis; Academic Press: London, UK, 1988. [Google Scholar]
  4. Dahlhaus, R. Fitting time series models to nonstationary processes. Ann. Stat. 1997, 25, 1–37. [Google Scholar] [CrossRef] [Scilit]
  5. Dahlhaus, R. Locally Stationary Processes. In Handbook of Statistics; Elsevier: Amsterdam, The Netherlands, 2012; Volume 30, pp. 351–413. [Google Scholar]
  6. Nason, G.; von Sachs, R.; Kroisandt, G. Wavelet processes and adaptive estimation of the evolutionary wavelet spectrum. J. R. Stat. Soc. Ser. B 2000, 62, 271–292. [Google Scholar] [CrossRef] [Scilit]
  7. Cardinali, A.; Nason, G.P. Locally Stationary Wavelet Packet Processes: Basis Selection and Model Fitting. J. Time Ser. Anal. 2017, 38, 151–174. [Google Scholar] [CrossRef] [Scilit]
  8. Davidson, A. Stochastic Limit Theory; Oxford University Press: Oxford, UK, 1994. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.