STRONG APPROXIMATION FOR MOVING AVERAGE PROCESSES UNDER DEPENDENCE ASSUMPTIONS

Let {Xt,t ≥ 1} be a moving average process defined by Xt = ∑^∞ k=0 αkξt-k, where {αk,k ≥ 0} is a sequence of real numbers and {ξt,-∞ 〈 t 〈 ∞} is a doubly infinite sequence of strictly stationary dependent random variables. Under the conditions of {αk, k ≥ 0} which entail that {Xt, t ≥ 1} is either a long memory process or a linear process, the strong approximation of {Xt, t ≥ 1} to a Gaussian process is studied. Finally, the results are applied to obtain the strong approximation of a long memory process to a fractional Brownian motion and the laws of the iterated logarithm for moving average processes.     

RATE OF CONVERGENCE FOR MULTIPLE CHANGEPOINTS ESTIMATION OF MOVING-AVERAGE PROCESSES

In this paper, the least square estimator in the problem of multiple change points estimation is studied. Here, the moving-average processes of ALNQD sequence in the mean shifts are discussed. When the number of change points is known, the rate of convergence of change-points estimation is derived. The result is also true for p-mixing, φ-mixing, a-mixing, associated and negatively associated sequences under suitable conditions.     

滑动平均过程的Spitzer和Baum-Katz律的精确渐近

本文讨论了滑动和过程的Spitzer和Baum-Katz律的精确渐近,其中{ξ,ξi-∞相似文献   

线性过程方差变点的平方累计和SCUSUM估计(英文)

This paper considers the estimation problem of a variance change-point in linear process.Consistency of a SCUSUM type change-point estimator is proved and its rate of convergence is established.The mean-unknown case is also considered.     

PA随机变量产生的移动平均过程的矩完全收敛性

设{ε_i:-∞i∞}是同分布正相协随机变量序列,{a_i:-∞i+∞}是绝对可和的常数列.在一定的条件下得到了移动平均过程(?)的矩完全收敛的精确渐近性.把有关负相协条件下的结果推广到正相协情形.     

Precise Asymptotics in the Law of Large Numbers and the Law of Iterated Logarithm of Moving-Average Process Generated by ALNQD Sequences

In this paper, we discuss the precise asymptotics of moving-average process Xt =∞∑j=0 ajEt-j under some suitable conditions, where {εt, t∈ Z} is a sequence j=0 of stationary ALNQD random variables with mean zeros and finite variances.     

A Fast Estimation Method for Mean Change Point in Massive Data Sets

When the sample size is $N$, the computational complexity of the least squares estimate of mean change point is O(N^2), and it's necessary to reduce the computational complexity in the case of huge data. In this paper, a two-stage fast scanning algorithm is proposed for the estimation of mean change point, and it is proved that this method has the same convergence speed and limiting distribution as the least squares estimation of mean change point, and the optimal complexity of the new algorithm is O(N^{4/3}\cdot b_n^{2/3}). We have conducted sufficient data experiments in terms of computation time and estimated efficiency, and the results show that the estimated efficiency of the new and old methods is similar, but the computation time of our method is obviously shortened.     

由ALNQD序列生成的移动平均过程的大数定律及重对数律的精确渐近性

In this paper,we discuss the precise asymptotics of moving-average process Xt =∞∑j=0 ajεt-j under some suitable conditions,where {εt,t ∈ Z} is a sequence of stationary ALNQD randomvariables with mean zeros and finite variances.     

负相依样本平滑移动过程的完全收敛性

设{Yi;－∞＜i＜∞}为一负相伴的同分布随机变量序列，{ai；－∞＜i＜∞}为绝对可和的实数序列。本文在适当的条件下。证明了平滑移动过程{∑k=1^n∑i=-∞^∞ai kYi/n^1/t;n≥1}的完全收敛性。     

线性过程关于大数律的精确渐近性

该文主要讨论的是滑线性过程 $X_k=\sum\limits_{i=-\infty}^\infty a_{i+k}\varepsilon_i$,其中 $\{\varepsilon_i; -\infty$\varphi$ -混合或负相伴随机变量序列,$\{a_i;-\inftyp$, 若 $E|\varepsilon_1|^r<\infty$$\lim_{\epsilon\searrow 0}\epsilon^{2(r-p)/(2-p)}\sum\limits_{n=1}^\infty n^{r/p-2}P\{|S_n|\geq \epsilonn^{1/p}\}=\frac{p}{r-p}E|Z|^{2(r-p)/(2-p)},$ 其中 $Z$ 是服从均值为零,方差为 $\tau^2=\sigma^2\cdot(\sum\limits_{i=-\infty}^\infty a_i)^2$的正态分布.     

监测均值变动的多重控制图方法

本文证明了当受控平均运行长度充分大时, 多重控制图有两个优点: 一是相比较GLR (广义似然比) 和GEWMA (广义指数权重移动平均)控制图它可以大大降低运算的复杂性; 二是能够较快地监测均值变化的大小. 数值模拟也表明: 多重控制图不仅优于其构成的单个控制图, 而且在监测未知的均值变动方面也优于单个的CUSUM, EWMA, 多重EWMA和GLR控制图.     

线性过程关于矩的重对数律的精确率

讨论线性过程Xk=∑∞i=-∞ai+kεi,其中{εi;-∞＜i＜∞}是均值为零,方差有限为σ2的双侧无穷独立同分布随机变量序列,{ai;-∞＜ i＜∞}为绝对可和的实数序列.令Sn=∑nl=1Xk,n≥1,假设|ε1|3＜∞,证明了对任意的δ＞-1,lim ∈↘0∈2δ+2∑∞n=1(㏒ ㏒ n)δ/n3/2㏒ nE{|Sn|-∈τ√2n ㏒ ㏒ n}+=√2τ√/√π(δ+1)(2δ+3)Γ(δ+2),其中τ2=σ2(∑∞i=-∞ai)2以及Γ(·)为Gamma函数.     

负相关样本平滑移动过程的矩完全收敛性(英文)

本文研究了负相关样本平滑移动过程Xk=∑∞i=-∞ai+kYi的矩完全收敛性,这里{Yi,-∞相似文献   

无穷方差厚尾过程变点的小波估计

研究随机设计下噪声为厚尾随机变量时非参数函数中的变点估计问题.首先,通过设计变换将随机设计转化为等间距固定设计,进而利用小波方法估计变换后的变点的位置,再利用逆设计变换求得随机设计下变点位置的估计,并给出估计的收敛速度.模拟研究结果说明对于无穷方差厚尾过程中的变点估计问题小波方法是有效的.     

CUSUM,GLR,GEWMA以及RFCuscore控制图监测稳定过程均值漂移的效果比较(英)

本文给出了累积和控制图(CUSUM)监测稳定过程均值漂移的平均运行长度(ARL)的区间估计,并采用数字模拟的方法对CUSUM,GLR,GEWMA以及RFCuscore四种控制图监测稳定过程均值漂移的效果进行比较,结果显示CUSUM效果最好.     

CUSUM，GLR，GEWMA以及RFCuscore控制图监测稳定过程均值漂移的效果比较

本文给出了累积和控制图(CUSUM)监测稳定过程均值漂移的平均运行长度(ARL)的区间估计,并采用数字模拟的方法对CUSUM,GLR,GEWMA以及RFCuscore四种控制图监测稳定过程均值漂移的效果进行比较,结果显示CUSUM效果最好.     

固定设计下混合序列回归函数的小波估计

考虑非参数回归模型Ｙ_i＝ｒ（ｔ_i）＋ε_i,其中ｔ_i为固定设计点列,｛ε_i｝为ρ混合相依随机变量,本文用小波方法建立ｒ（ｔ）的估计ｒ（ｔ）,并讨沦了它的渐近无偏性,弱收敛,强收敛,及其收敛速度,     

长相依序列均值变点检测

研究了长相依序列均值变点检测问题.首先给出变点检验的Ratio统计量其次分别推导了原假设和备择假设下统计量的极限分布,最后用蒙特卡洛方法模拟出检验的临界值,并通过数值模拟和实例分析说明方法的有效性.     

Nonparametric Estimation of the Dependence Function in Bivariate Extreme Value Distributions

The paper considers the problem of estimating the dependence function of a bivariate extreme survival function with standard exponential marginals. Nonparametric estimators for the dependence function are proposed and their strong uniform convergence under suitable conditions is demonstrated. Comparisons of the proposed estimators with other estimators are made in terms of bias and mean squared error. Several real data sets from various applications are used to illustrate the procedures.     

Cluster Algorithms for Spatial Point Processes with Symmetric and Shift Invariant Interactions

Abstract

In this article, Swendsen–Wang–Wolff algorithms are extended to simulate spatial point processes with symmetric and stationary interactions. Convergence of these algorithms is considered. Some further generalizations of the algorithms are discussed. The ideas presented in this article can also be useful in handling some large and complicated systems.