Next Article in Journal
The General Fractional Derivative and Related Fractional Differential Equations
Next Article in Special Issue
A Fast-Pivoting Algorithm for Whittle’s Restless Bandit Index
Previous Article in Journal
Improving Convergence in Therapy Scheduling Optimization: A Simulation Study
Previous Article in Special Issue
Upper Bounds and Explicit Formulas for the Ruin Probability in the Risk Model with Stochastic Premiums and a Multi-Layer Dividend Strategy
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Consistency of the CUSUM-Type Estimator of the Change-Point and Its Application

1
School of Mathematical Sciences, Anhui University, Hefei 230601, China
2
School of Life Sciences, Anhui University, Hefei 230601, China
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(12), 2113; https://doi.org/10.3390/math8122113
Submission received: 11 October 2020 / Revised: 13 November 2020 / Accepted: 24 November 2020 / Published: 26 November 2020
(This article belongs to the Special Issue Applied Probability)

Abstract

:
In this paper, we investigate the CUSUM-type estimator of mean change-point models based on m-asymptotically almost negatively associated (m-AANA) sequences. The family of m-AANA sequences contains AANA, NA, m-NA, and independent sequences as special cases. Under some weak conditions, some convergence rates are obtained such as O P ( n 1 / p 1 ) , O P ( n 1 / p 1 log 1 / p n ) and O P ( n α 1 ) , where 0 α < 1 and 1 < p 2 . Our rates are better than the ones obtained by Kokoszka and Leipus (Stat. Probab. Lett., 1998, 40, 385–393). In order to illustrate our results, we do perform simulations based on m-AANA sequences. As important applications, we use the CUSUM-type estimator to do the change-point analysis based on three real data such as Quebec temperature, Nile flow, and stock returns for Tesla. Some potential applications to change-point models in finance and economics are also discussed in this paper.

1. Introduction

Change-point problems originally arose in the context of quality control, where one typically observes the output of a production line and would wish to signal deviation from an acceptable level while observing the data. The change-point problems may be changes of the mean, variance, and other parameters. Therefore, detecting a change-point and estimating its location are both very important in data processing, modeling, estimation, and inference. The cumulative sum (CUSUM) method is a popular method to solve this problem; see Csörgő and Horváth [1] and Shiryaev [2], and among others. In this paper, we consider the mean change-point models, which can be applied in many fields. For example, investors pay attention to the mean changes of the economic growth rate, consumption level, exchange rate, stock returns, and so on. Therefore, we consider the mean change-point models in this paper. For some 0 < τ * < 1 , let k * = n τ * . Here, x denotes the largest integer not exceeding x. For n 1 , suppose the observations X 1 , , X n satisfy the model:
X i = θ 0 + δ n I ( k * + 1 i n ) + Z i , 1 i n ,
where mean parameter θ 0 , change-amount δ n , as well as change-point location k * are unknown and Z 1 , , Z n are mean zero random variables. In Model (1), the estimators of k * and τ * based on the CUSUM method (see Kokoszka and Leipus [3]) are, respectively:
k ^ n ( α ) = argmax 1 k n 1 | U k ( α ) | and τ ^ n ( α ) = k ^ n ( α ) n ,
where:
U k ( α ) = k ( n k ) n 1 α 1 k i = 1 k X i 1 n k i = k + 1 n X i , 1 k n 1 ,
and 0 α < 1 . Kokoszka and Leipus [3] used the Hájek–Rényi-type inequalities to obtain the convergence rate of CUSUM-type estimator τ ^ n ( α ) . In this paper, we also study the consistency of estimator τ ^ n ( α ) in (2) based on dependent sequences of { Z n , n 1 } . Now, let us recall some related definitions. Block et al. [4] introduced an important concept of negative associated (NA) random variables, which can be applied in reliability theory, percolation theory, and multivariate analysis.
Definition 1.
A finite family of random variables { Z i , 1 i n } is said to be NA if for every pair of disjoint subsets A and B of 1, 2,…, n,
C o v ( f ( Z i , i A ) , g ( Z j , j B ) ) 0 .
whenever f and g are coordinatewise nondecreasing and the covariance exists.
Motivated by the notion of NA random variables, Chandra and Ghosal [5] introduced the concept of asymptotically almost negatively associated (AANA) random variables.
Definition 2.
A sequence { Z n , n 1 } of random variables is called AANA if there exists a nonnegative sequence q ( n ) 0 as n such that:
C o v ( f ( Z n ) , g ( Z n + 1 , , Z n + k ) ) q ( n ) [ V a r ( f ( Z n ) ) V a r ( g ( Z n + 1 , , Z n + k ) ) ] 1 / 2 ,
for all n 1 , k 1 and for all coordinatewise nondecreasing continuous functions f and g whenever the variances exist. The sequence { q ( n ) , n 1 } is said to be the mixing coefficients of { Z n , n 1 } .
Hu et al. [6] gave a natural extension of m-NA from NA random variables.
Definition 3.
Let m 1 be a fixed integer. A sequence of random variables { Z n , n 1 } is said to be m-NA if for any n 2 and any i 1 , i 2 , , i n , such that | i k i j | m for all 1 k j n , we have that Z i 1 , Z i 2 , , Z i n are NA random variables.
Motivated by Hu et al. [6], Nam et al. [7] gave the concept of m-AANA.
Definition 4.
Let m 1 be a fixed integer. A sequence of random variables { Z n , n 1 } is said to be m-AANA if there exists a nonnegative sequence q ( n ) 0 as n such that:
C o v ( f ( Z n ) , g ( Z n + m , , Z n + k ) ) q ( n ) [ V a r ( f ( Z n ) ) V a r ( g ( Z n + m , , Z n + k ) ) ] 1 / 2 ,
for all n 1 , k m , and for all coordinatewise nondecreasing continuous functions f and g whenever the variances exist.
Nam et al. [7] obtained the maximal inequalities for m-AANA sequences and gave its applications to Hájek–Rényi-type inequalities and the strong law of large numbers. Ko [8] extended the results of Nam et al. [7] to the Hilbert space. The family of m-AANA sequences contains AANA (with m = 1 ), NA, m-NA, and independent sequences as special cases. The notions of NA and AANA have received increasing attention recently. One can refer to [9,10,11,12,13,14,15], etc.
For the mean change-point model (1), Shi et al. [16] extended the results of Kokoszka and Leipus [3] to NA sequences and obtained the strong convergence rate for the estimator τ ^ n ( α ) in (2). Since the m-AANA sequence is weaker than the NA sequence, we study the convergence rate for the estimator τ ^ n ( α ) based on m-AANA sequences. For more research on the change-point models, we can refer to many works such as [1,17,18,19,20,21,22,23,24] and the references therein. In addition, many researchers have joined the study of change-point models in mathematical finance and econometrics. For example, Shiryaev [25] considered a Brownian motion with mean drift, depending on θ ,
X t = μ ( t θ ) I ( t θ ) + σ B t , t 0 ,
where μ 0 and σ > 0 are known constants (as a rule) and θ is the “disorder” time or change-point location, which can be either a random variable or simply an unknown parameter. Here, { B t , t 0 } is a standard Brownian motion. Obviously, (4) is very important to study Black–Scholes models in finance and economics. For more stochastic models of asset pricing in finance based on change-points, we can refer to Shiryaev [25].
The rest of this paper is organized as follows. Section 2 presents some convergence rates of τ ^ n ( α ) τ * (for example, O P ( n 1 / p 1 ) , O P ( n 1 / p 1 log 1 / p n ) and O P ( n α 1 ) ). Section 3 provides some simulations to check the results obtained in this paper. As important applications, three real data examples are provided to do the mean change-point analysis in Section 4. The conclusions and further research are discussed in Section 5. Lastly, the main proofs are presented in Section 6.

2. Main Results

First, some assumptions are listed as follows.
Assumption 1.
For some 1 < p 2 , let { Z n , n 1 } be a mean zero sequence of m-AANA random variables with sup n 1 E | Z n | p < and the mixing coefficient sequence { q ( n ) , n 1 } satisfy n = 1 q 2 ( n ) < .
Assumption 2.
For 0 α < 1 and 1 < p 2 , denote:
g n ( α , p ) = n 1 / p 1 , i f 0 α < 1 p , n 1 / p 1 log 1 / p n , i f α = 1 p , n α 1 , i f 1 p < α < 1 .
Let:
δ n 0 a n d g n ( α , p ) / δ n 0 a s n .
Then, we obtain the convergence rate of τ ^ n ( α ) τ * in Theorem 1.
Theorem 1.
Let 1 < p 2 and Assumptions 1 and 2 be satisfied. Then, for any given 0 α < 1 ,
τ ^ n ( α ) τ * = O P ( g n ( α , p ) / δ n ) .
As an application of Theorem 1, we have Corollary 1.
Corollary 1.
Let 1 < p 2 . If δ n = δ 0 0 in Theorem 1, then for any given 0 α < 1 ,
τ ^ n ( α ) τ * = O P ( n 1 / p 1 ) , i f 0 α < 1 p , O P ( n 1 / p 1 log 1 / p n ) , i f α = 1 p , O P ( n α 1 ) , i f 1 p < α < 1 .
Remark 1.
In the mean change-point model (1), if δ n = δ 0 0 and { Z n , n 1 } is an independent and identically distributed sequence of random variables with E Z 1 = 0 and V a r ( Z 1 ) = σ 2 > 0 , then, by Corollary 1, it has:
τ ^ n ( α ) τ * = O P ( n 1 / 2 ) , i f 0 α < 1 2 , O P ( n 1 / 2 log 1 / 2 n ) , i f α = 1 2 , O P ( n α 1 ) , i f 1 2 < α < 1 ,
which was obtained by (1.5) of Kokoszka and Leipus [3]. In addition, Kokoszka and Leipus [3] considered the sequence { Z n , n 1 } satisfying the following dependent condition:
V a r i = j m Z i C ( m j + 1 ) β ,
uniformly in j , m , 1 j m n , where 0 β < 2 . Denote:
g ˜ n ( α , β ) = n ( 1 / 2 β / 4 ) , i f 0 α < 1 / 2 β / 4 , n ( 1 / 2 β / 4 ) log 1 / 2 n , i f α = 1 / 2 β / 4 , n α 1 , i f 1 / 2 β / 4 < α < 1 .
Let:
δ n 0 a n d g ˜ n ( α , β ) / δ n 0 a s n .
Then, Kokoszka and Leipus [3] obtained that:
τ ^ n ( α ) τ * = O P ( g ˜ n ( α , β ) / δ n ) ,
(see Corollary 1.1 of [3]). Obviously, our rate (6) is better than that of (9). Thus, our Theorem 1 extends Theorem 1.1 and Corollary 1.1 of [3] to the case of the m-AANA sequence. On the other hand, one can take δ n 0 or δ n in (6) (or (9)), provided g n ( α , p ) / δ n 0 (or g ˜ n ( α , β ) / δ n 0 ) as n . Furthermore, let δ n = δ 0 0 and { Z n , n 1 } be an NA sequence. Shi et al. [16] obtained a strong convergence rate τ ^ n τ * = o ( M ( n ) n ) , a.s. for any M ( n ) satisfying M ( n ) and M ( n ) / n = o ( 1 ) . Our convergence rates are weaker than Shi et al. [16]; however, our m-AANA sequence { Z n , n 1 } is weaker than the NA sequence, and our change-amount δ n can go to zero or infinity.

3. Simulations

In the mean change-point model (1), we assume that there exists a mean change point location k * such that:
X i = θ 0 + δ n I ( k * + 1 i n ) + Z i , 1 i n ,
where Z 1 , , Z n satisfy:
( Z 1 , Z 2 , , Z n ) = d w 1 N n ( 0 , I n ) + w 2 N n ( 0 , Σ n ) ,
where w 1 , w 2 0 , w 1 + w 2 = 1 , I n is an identity matrix, and Σ n is:
Σ n = 1 + 1 / n ρ ρ 2 ρ n 1 ρ 1 + 2 / n ρ ρ n 2 ρ 2 ρ 1 + 3 / n ρ n 3 ρ n 1 ρ 2 ρ 2 n × n
and | ρ | < 1 . It is easy to verify that { Z 1 , , Z n } is a m-AANA sequence with m = 2 and mixing coefficients q ( n ) = O ( | ρ | n ) . For simplicity, we take θ 0 = 1 , τ * = 0.5 , k * = τ * n , w 1 = w 2 = 1 / 2 , and ρ = 0.6 in (10)–(12) to do the simulation with 10000 replications. For the sample n = 50 , 100 , 200 , 800 , 1400 , 2000 , Figure 1 shows the box plots of τ ^ n ( α ) τ * with different α (for example, α = 0 , 0.1 , 0.5 , 0.7 , 0.9 ) and δ n (for example, δ n = n 0.3 , n 0.2 , n 0.1 , n 0 , n 0.1 ), where τ ^ n ( α ) is defined by (2).
In Figure 1, the y-axis is the value of τ ^ n ( α ) τ * , and the x-axis is the sample n. By the box plots in Figure 1, the differences of τ ^ n ( α ) τ * go to zero as sample n increases, which agrees with the consistency of (6) in Theorem 1. It has a similar performance if we take different values ρ , so the details are omitted here.

4. Real Data Examples

In this section, we use the CUSUM-type estimator k ^ n ( α ) = n τ ^ n ( α ) in (2) to do the mean change-point analysis with three real datasets. The first dataset is for the monthly mean temperature of Quebec in Canada from 1944 to 2008. The data can be found at http://climate.weather.gc.ca. For simplicity, we take the data of monthly mean temperatures for June and October, which contain 76 observations denoted by x 1 , i and x 2 , i , 1 i 76 , respectively. Let x i = x 1 , i if i = 1 , , 76 and x i = x 2 , i 76 if i = 76 + 1 , , 152 . Figure 2 shows the plot graph of x i , 1 i 152 , where the y-axis is the value of temperature x i and the x-axis is the sample n.
Obviously, the mean temperature of June is different from that of October, so the change-point location k * is 76 (or τ * = 0.5 ). Now, we use the CUSUM-type estimator k ^ n ( α ) to detect k * , i.e., k ^ n ( α ) is defined by:
k ^ n ( α ) = argmax 1 k n 1 | U k ( α ) |
where 0 α < 1 and:
U k ( α ) = k ( n k ) n 1 α 1 k i = 1 k x i 1 n k i = k + 1 n x i , 1 k n 1 .
Table 1 shows the values of k ^ n ( α ) with different values α such as α = 0 , 0.1 , , 0.9 .
By Table 1, the estimator k ^ n ( α ) with different α successfully detects the true change-point location k * = 76 .
Second, we also use estimator k ^ n ( α ) to detect a time series of the annual flow of the Nile River at Aswan from 1871 to 1970 (see, for example, Zeileis et al. [26]). It measures annual discharge at Aswan in 10 8 m3 and is depicted in Figure 3 (there are 100 observations denoted by x i , 1 i 100 ). In Figure 3, the y-axis is the annual flow of the Nile River x i , and the x-axis is the sample n.
Similar to Table 1, the values of k ^ n ( α ) are given in Table 2.
By Table 2, we get a change-point location of 28 or equivalently the year 1898 (see Figure 3). On the other hand, Zeileis et al. [26] and Gao et al. [27] respectively used F-statistics and CUSUM statistics to detected the same change-point location of 28. It is well known that Aswan dam was built in 1898. It significantly changes the annual flow of the river Nile.
Lastly, we do the change-point analysis of returns based on a financial time series. Let P t be the closing prices of Tesla stock. Therefore, the return is defined as r t = log P t log P t 1 . Figure 4 shows 138 daily returns on the prices of Tesla stock from 1 August 2016 to 13 February 2017. In Figure 4, the y-axis is the i-th return r i , and the x-axis is the sample n. The data were downloaded from Yahoo Finance. Tesla announced on 22 November 2016 that it had completed the acquisition of SolarCity. It seams that the mean returns changed after that time of 22 November 2016 (the observation is 80). Therefore, we perform the test for this change-point of mean returns.
Similar to Kokoszka and Leipus’s CUSUM estimator k ^ n ( α ) defined by (2), for any given 0 α < 1 , Antoch et al. [17] investigated the following CUSUM estimator k ˜ n of k * defined as:
k ˜ n ( α ) = argmax 1 k n 1 | U ˜ k ( α ) | ,
where:
U ˜ k ( α ) = n k ( n k ) α i = 1 k x i x ¯ n , 1 k n 1 ,
and x ¯ n = 1 n i = 1 n x i . Therefore, we use these CUSUM-type estimators k ^ n ( α ) by (13) and k ˜ n ( α ) by (14) to detect the change-point location k * , where x i = r i , 1 i 138 . With the different α = 0 , 0.1 , , 0.9 , the values of k ^ n ( α ) and k ˜ n ( α ) are presented in Table 3.
By Table 3, the estimators k ^ n ( α ) and k ˜ n ( α ) find the same change-point location of 86 (1 December 2016). Thus, the capital market recognized Tesla’s acquisition of SolarCity on 22 November of 2016, and the mean returns significantly changed from negative to positive after the time of 1 December 2016 (see Figure 4).

5. Conclusions

The CUSUM method is a popular method to detect the change-point. In this paper, we investigate the consistency of CUSUM-type estimator τ ^ n ( α ) based on m-AANA sequences, which contain many dependent sequences such as NA, m-NA, and AANA sequences. Under the p-th moment ( 1 < p 2 ) condition, we obtain a general consistency rate τ ^ n ( α ) τ * = O P ( g n ( α , p ) / δ n ) , where g n ( α , p ) is defined by (6) and 0 α < 1 . By taking δ n = δ 0 0 in Theorem 1, we obtain the convergence rates as:
τ ^ n ( α ) τ * = O P ( n 1 / p 1 ) , i f 0 α < 1 p , O P ( n 1 / p 1 log 1 / p n ) , i f α = 1 p , O P ( n α 1 ) , i f 1 p < α < 1 .
Therefore, our Theorem 1 and Corollary 1 generalize the results of Kokoszka and Leipus [3]. In addition, δ n in Theorem 1 can be taken as δ n 0 or δ n , if g n ( α , p ) / δ n 0 as n . Let δ n = δ 0 0 and { M ( n ) , n 1 } be any positive constant sequence satisfying M ( n ) and M ( n ) / n = o ( 1 ) . Shi et al. [16] obtained a strong convergence rate τ ^ n τ * = o ( M ( n ) n ) , a.s. for the case of NA sequence. Our convergence rates are weaker than Shi et al. [16]; however, the m-AANA sequence is weaker than the NA sequence, and the change-amount δ n can go to zero or infinity. In order to check our results, some simulations are shown in Figure 1, which agree with the consistency of Theorem 1. Lastly, three real dataset of Quebec temperature, Nile flow, and returns for Tesla in Section 4 are discussed to show that the CUSUM-type estimator k ^ n ( α ) defined by (13) can successfully detect the change-point location. In addition, it is interesting for scholars to study the strong convergence rate and limit distribution of CUSUM-type estimator τ ^ n ( α ) based on the m-AANA sequence or other dependent sequences in future research. Furthermore, Shiryaev [25] discussed the stochastic disorder problems, which are known as the quickest detection problems. For example, Shiryaev [25] considered the Black–Scholes models with mean drift. Thus, we should pay attention to the applications of change-point models in mathematical finance and econometrics.

6. Proofs of the Main Results

For convenience, in the proofs, let C , C 1 , C 2 , be some positive constants that are independent of n and may have different values in different expressions.
Lemma 1.
(Theorem 3 of Nam et al. [7]). For some 1 < p 2 , let { Z n , n 1 } be an m-AANA sequence of zero mean random variables with mixing coefficients { q ( n ) , n 1 } satisfying n = 1 q 2 ( n ) < . Let { b n , n 1 } be a nondecreasing sequence of positive numbers. Then, for any ε > 0 and any integer n 1 , we have:
P max 1 k n | 1 b k j = 1 k Z j | ε 2 p m p 1 C p ε p j = 1 n E | Z j | p b j p ,
where C p is a positive constant depending only on p.
Proof of Theorem 1.
Let τ n = k / n . For any given 0 α < 1 , we have by (1) and (3) that:
E U k ( α ) = k ( n k ) n 1 α 1 k i = 1 k E X i 1 n k i = k + 1 n E X i = δ n n 1 α τ n 1 α ( 1 τ n ) α ( 1 τ * ) , i f k k * , δ n n 1 α ( 1 τ n ) 1 α τ n α τ * , i f k > k * ,
and:
E U k * ( α ) = δ n n 1 α ( τ * ) 1 α ( 1 τ * ) 1 α .
Therefore, we have by (3.11) of Kokoszka and Leipus [3] that:
| δ n | τ ¯ n 1 α | τ ^ n τ * | 2 max 1 k n 1 | U k ( α ) E U k ( α ) | ,
where τ ¯ : = ( 1 α ) ( τ * ) α ( 1 τ * ) α min { τ * , 1 τ * } . By (1) and (3), it is easy to see that:
n α 1 max 1 k n 1 | U k ( α ) E U k ( α ) | n α 1 max 1 k n 1 1 k α | i = 1 k ( X i E X i ) | + n α 1 max 1 k n 1 1 ( n k ) α | i = k + 1 n ( X i E X i ) | = n α 1 max 1 k n 1 1 k α | i = 1 k Z i | + n α 1 max 1 k n 1 1 ( n k ) α | i = k + 1 n Z i | : = D 1 + D 2 .
By (5), (17), and (18), in order to prove (6), we have to prove that:
D i = O P ( g n ( α , p ) ) , i = 1 , 2 ,
where g n ( α , p ) is defined (5). On the one hand, for any ε > 0 , it follows from Lemma 1 with sup n 1 E | Z n | p < that:
P max 1 k n 1 1 k α | i = 1 k Z i | > ε n 1 α C 1 ( ε n 1 α ) p i = 1 n E | Z i | p i α p C 2 ε p n p α p i = 1 n E | Z i | p i α p C 3 ε p n 1 p i f 0 α < 1 p , C 4 ε p n 1 p log n i f α = 1 p , C 5 ε p n p ( α 1 ) i f 1 p < α < 1 ,
where C i , i = 1 , , 5 , are positive constants independentof n. Consequently, by (18)–(20), we have:
D 1 = O P ( g n ( α , p ) ) .
On the other hand, it can be checked that:
D 2 = n α 1 max 1 k n 1 1 ( n k ) α | i = k + 1 n Z i | = n α 1 max 1 k < n 1 k α | i = 1 k Z n i + 1 | .
Therefore, one can obtain analogously the same result that
D 2 = O P ( g n ( α , p ) ) .
Thus, the proof of (6) is completed.  □
Proof of Corollary 1.
By taking δ n = δ 0 0 in Theorem 1, one can immediately obtain Corollary 1.  □

Author Contributions

Supervision W.Y.; software S.D. and X.D.; writing, original draft preparation, S.D., X.L., and W.Y. All authors read and agreed to the published version of the manuscript.

Funding

This work is supported by NNSF of China (11701004, 11801003), NSF of Anhui Province (2008085MA14, 1808085QA03, 1808085QA17), and Provincial Natural Science Research Project of Anhui Colleges (KJ2019A0006).

Acknowledgments

The authors are deeply grateful to the Editors and anonymous referees for their careful reading and insightful comments. The comments led to the significant improvement of the paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Csörgő, M.; Horváth, L. Limit Theorems in Change-Point Analysis; Wiley: Chichester, UK, 1997; pp. 170–181. [Google Scholar]
  2. Shiryaev, A. On stochastic models and optimal methods in the quickest detection problems. Theory Probab. Appl. 2009, 53, 385–401. [Google Scholar] [CrossRef]
  3. Kokoszka, P.; Leipus, R. Change-point in the mean of dependent observations. Stat. Probab. Lett. 1998, 40, 385–393. [Google Scholar] [CrossRef]
  4. Block, H.W.; Savits, T.H.; Shaked, M. Some concepts of negative dependence. Ann. Probab. 1982, 10, 765–772. [Google Scholar] [CrossRef]
  5. Chandra, T.K.; Ghosal, S. The strong law of large numbers for weighted averages under dependence assumptions. J. Theoret. Probab. 1996, 9, 797–809. [Google Scholar] [CrossRef] [Green Version]
  6. Hu, T.C.; Chiang, C.Y.; Taylor, R.L. On complete convergence for arrays of rowwise m-negatively associated random variables. Nonlinear Anal. 2009, 71, e1075–e1081. [Google Scholar] [CrossRef]
  7. Nam, T.; Hu, T.; Volodin, A. Maximal inequalities and strong law of large numbers for sequences of m-asymptotically almost negatively associated random variables. Commun. Stat. Theory Methods 2017, 46, 2696–2707. [Google Scholar] [CrossRef]
  8. Ko, M. Hájek-Rényi inequality for m-asymptotically almost negatively associated random vectors in Hilbert space and applications. J. Inequal. Appl. 2018, 2018, 80. [Google Scholar] [CrossRef] [Green Version]
  9. Bulinski, A.V.; Shaskin, A. Limit Theorems for Associated Random Fields and Related Systems; World Scientific: Singapore, 2007; pp. 1–20. [Google Scholar]
  10. Chen, P.; Hu, T.C.; Volodin, A. On complete convergence for arrays of row-wise negatively associated random variables. Theory Probab. Appl. 2008, 52, 323–328. [Google Scholar] [CrossRef]
  11. Yuan, D.M.; An, J. Rosenthal type inequalities for asymptotically almost negatively associated random variables and applications. Sci. China Ser. A 2009, 52, 1887–1904. [Google Scholar] [CrossRef]
  12. Chen, Z.Y.; Wang, X.J.; Hu, S.H. Strong laws of large numbers for weighted sums of asymptotically almost negatively associated random variables. Rev. Real Acad. Cienc. Exactas Fis. Nat. Ser. A Mat. 2015, 109, 135–152. [Google Scholar] [CrossRef]
  13. Wu, Y.F.; Hu, T.C.; Volodin, A. Complete convergence and complete moment convergence for weighted sums of m-NA random variables. J. Inequal. Appl. 2015, 2015, 200. [Google Scholar] [CrossRef] [Green Version]
  14. Xi, M.M.; Deng, X.; Wang, X.J.; Cheng, Z.Y. Lp convergence and complete convergence for weighted sums of AANA random variables. Commun. Stat. Theory Methods 2018, 47, 5604–5613. [Google Scholar] [CrossRef]
  15. Ye, R.Y.; Liu, X.S.; Yu, Y.C. Pointwise optimality of wavelet density estimation for negatively associated biased sample. Mathematics 2020, 8, 176. [Google Scholar] [CrossRef] [Green Version]
  16. Shi, X.; Wu, Y.; Miao, B. Strong convergence rate of estimators of change point and its application. Comput. Stat. Data Anal. 2009, 53, 990–998. [Google Scholar] [CrossRef]
  17. Antoch, J.; Hušková, M.; Veraverbeke, N. Change-point problem and bootstrap. J. Nonparametr. Stat. 1995, 5, 123–144. [Google Scholar] [CrossRef]
  18. Lee, S.; Ha, J.; Na, O. The cusum test for parameter change in time series models. Scand. J. Stat. 2003, 30, 781–796. [Google Scholar] [CrossRef]
  19. Chen, J.; Gupta, A. Parametric Sstatistical Change Point Analysiswith Applications to Genetics Medicine and Finance, 2nd ed.; Birkhäuser: Boston, MA, USA, 2012; pp. 1–30. [Google Scholar]
  20. Horváth, L.; Hušková, M. Change-point detection in panel data. J. Time Ser. Anal. 2012, 33, 631–648. [Google Scholar] [CrossRef]
  21. Horváth, L.; Rice, G. Extensions of some classical methods in change point analysis. Test 2014, 23, 219–255. [Google Scholar] [CrossRef]
  22. Messer, M.; Albert, S.; Schneider, G. The multiple filter test for change point detection in time series. Metrika 2018, 81, 589–607. [Google Scholar] [CrossRef]
  23. Xu, M.; Wu, Y.; Jin, B. Detection of a change-point in variance by a weighted sum of powers of variances test. J. Appl. Stat. 2019, 46, 664–679. [Google Scholar] [CrossRef]
  24. Abbas, N.; Abujiya, M.A.R.; Riaz, M.; Mahmood, T. Cumulative sum chart modeled under the presence of outliers. Mathematics 2020, 8, 269. [Google Scholar] [CrossRef] [Green Version]
  25. Shiryaev, A. Stochastic Disorder Problems; Springer: Berlin/Heidelberg, Germany, 2019; pp. 367–388. [Google Scholar]
  26. Zeileis, Z.; Kleiber, C.; Krämer, W.; Hornik, K. Testing and dating of structural changes in practice. Comput. Stat. Data Anal. 2003, 44, 109–123. [Google Scholar] [CrossRef] [Green Version]
  27. Gao, M.; Ding, S.S.; Wu, S.P.; Yang, W.Z. The asymptotic distribution of CUSUM estimator based on α-mixing sequences. Commun. Stat.-Simul. Comput. 2020. [Google Scholar] [CrossRef]
Figure 1. The box plots of τ ^ n ( α ) τ * with different α and δ n .
Figure 1. The box plots of τ ^ n ( α ) τ * with different α and δ n .
Mathematics 08 02113 g001aMathematics 08 02113 g001b
Figure 2. The plot graph of monthly mean temperatures based on June and October data.
Figure 2. The plot graph of monthly mean temperatures based on June and October data.
Mathematics 08 02113 g002
Figure 3. The plot graph of the annual flow of the Nile River from 1871 to 1970.
Figure 3. The plot graph of the annual flow of the Nile River from 1871 to 1970.
Mathematics 08 02113 g003
Figure 4. The plot graph of the mean returns of Tesla stock from 2016 to 2017.
Figure 4. The plot graph of the mean returns of Tesla stock from 2016 to 2017.
Mathematics 08 02113 g004
Table 1. The values of k ^ n ( α ) based on the temperature data.
Table 1. The values of k ^ n ( α ) based on the temperature data.
α 00.10.20.30.40.50.60.70.80.9
k ^ n ( α ) 76767676767676767676
Table 2. The values of k ^ n ( α ) based on the Nile River data.
Table 2. The values of k ^ n ( α ) based on the Nile River data.
α 00.10.20.30.40.50.60.70.80.9
k ^ n ( α ) 28282828282828282828
Table 3. The values of k ^ n ( α ) and k ˜ n ( α ) based on Tesla’s returns data.
Table 3. The values of k ^ n ( α ) and k ˜ n ( α ) based on Tesla’s returns data.
α 00.10.20.30.40.50.60.70.80.9
k ^ n ( α ) 86868686868686868686
k ˜ n ( α ) 86868686868686868686
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ding, S.; Li, X.; Dong, X.; Yang, W. The Consistency of the CUSUM-Type Estimator of the Change-Point and Its Application. Mathematics 2020, 8, 2113. https://doi.org/10.3390/math8122113

AMA Style

Ding S, Li X, Dong X, Yang W. The Consistency of the CUSUM-Type Estimator of the Change-Point and Its Application. Mathematics. 2020; 8(12):2113. https://doi.org/10.3390/math8122113

Chicago/Turabian Style

Ding, Saisai, Xiaoqin Li, Xiang Dong, and Wenzhi Yang. 2020. "The Consistency of the CUSUM-Type Estimator of the Change-Point and Its Application" Mathematics 8, no. 12: 2113. https://doi.org/10.3390/math8122113

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop