具有AR(1)误差的均值漂移模型的Score检验和似然比检验

讨论了具有AR(1)误差的线性均值漂移模型,研究了自相关性的检验问题,导出了关于误差相关性的Score检验统计量和似然比检验统计量,并把它推广到误差项为AR(1)非线性均值漂移模型.本文还给出了一个数值例子说明检验方法的实用性.     

具有AR(1)误差的线性随机效应模型中方差齐性和自相关性的检验

在回归分析中，方差齐性是一个很基本的假设．本文对具有AR(1)误差的线性随机效应模型，研究了方差齐性和自相关性的检验问题．我们分别讨论了随机误差异方差、随机效应异方差、多元异方差以及自相关性的检验问题，并用score检验方法给出了三种方差齐性和自相关性的检验统计量．随机模拟的结果表明，当样本容量较大时，检验的功效较好．本文还给出一个数值例子说明检验方法的实用性．另外，模型的结果也可以推广到非线性情形．     

幂变换门限GARCH模型变点问题的贝叶斯分析

用贝叶斯方法对幂变换门限GARCH (PTTGARCH)模型变点问题进行统计分析.构造了变点模型参数的满条件分布并且采用MCMC的Griddy-Gibbs抽样算法对参数进行了估计.分别就不同的变点位置、模型不存在变点以及模型接近非平稳的情况进行数值模拟.结果表明:变点处于序列中间位置时,估计效果较好,当变点位置越靠近序列两端时,所得估计的误差越大;当模型不存在变点时,所设变点位置τ后验分布的峰度接近均匀分布的峰度;当模型存在变点时,τ后验分布的峰度大于2,且模型越平稳,τ的后验分布的峰度越大,因此可以通过判断τ的后验分布的峰度来判断模型是否存在变点.最后以GARCH模型对上证指数日收益率进行分析,得到变点发生时刻的概率分布,该结果与市场的变化背景符合.     

加权均值方差准则下的最优资本分配

本文考虑相依风险情形下的最优资本分配问题.采用随机加权损失函数,在期望-方差准则下,研究最优资本分配解的存在性,分析加权随机变量选取.进一步,文章提出了以破产概率作为模型评价标准,采用随机模拟的方法分别求解不同模型最优资本分配和相应的破产概率,对模型做出评价.最后,在假设相依风险分别为多元正态分布和多元t分布的情形下,用数值模拟的方法对本文提出的加权期望-方差模型与Dhaene提出的加权均值模型和XU和MAO提出的尾部均值方差模型进行比较,结果显示在破产概率准则下,本文提出的加权期望-方差模型所给出的资金分配比例显著优于其他模型.     

基于非参数方法的交通流变点问题分析

考虑到交通流数据的分布形式不确定及其变点数目未知的实际情形,以基于非参数方法的交通流变点问题为研究对象,拟通过基于Kolmogorov-Smirnov(KS)检验和Mann-Whitney U检验的滑动窗口法实现变点存在与否的检验,进一步结合二分法对交通流数据变点数目及其位置进行估计.正态分布模拟仿真显示,两种方法对于均值变点检验和估计效果较好,而对于方差变点检验和估计,Mann-Whitney U方法不及K-S方法.最后,贵阳市中心道路车流量数据实例分析,表明方法对于交通流突变分析效果较好,可为相关部门提供可靠的决策依据.     

具有随机效应和AR(1)误差的非线性纵向数据模型中组间方差和自相关系数的齐性检验

组间方差和自相关系数的齐性是纵向数据分析的基本假设之一,然而这种假设需要进行统计检验. Zhang \&; Weiss$^{[15]}$ 讨论了线性随机效应模型的组间和组内方差齐性的检验问题;林金官 \&; 韦博成$^{[10]}$ 研究了具有AR(1)误差但没有随机效应的非线性模型的自相关系数的齐性检验.该文研究具有随机效应和AR(1)误差的非线性模型的组间方差和自相关系数的齐性检验问题,构造了几个score检验统计量, 并通过Monte Carlo模拟方法研究了检验统计量的性质.最后利用该文的方法分析一组实际数据和一组模拟数据.     

非参数回归模型均值与方差双重变点的估计

本文基于核估计和小波方法研究异方差非参数回归模型中均值函数和方差函数均存在变点的估计问题.首先,构造基于均值函数的核估计量,求出均值变点位置及跳跃度的估计.其次,利用小波方法构造方差变点的估计量,运用该估计量获得方差变点位置与跳跃度的估计,给出变点估计量的渐近性质.最后数值模拟并通过比较验证了方法的有效性.     

马尔可夫域变模型在我国季度GDP增长率序列建模中的应用

本文建立了我国季度GDP同比增长率序列的马尔可夫域变模型,通过与线性AR(X)、LSTAR和ARCH等模型的比较,结果表明它更好地刻画了研究对象的均值、波动性和动态结构存在域变行为的非线性特征.     

ARCH模型的多变点检验

研究自回归条件异方差(ARCH)模型的多变点检验问题.提出一种拟似然比检验统计量,并在原假设下给出统计量的极限分布.在假设检验过程中得到变点个数的一致估计.数值模拟与实例分析说明了方法的合理性.     

门限自回归滑动平均模型——TARMA

一、引言 近年来,时间序列的理论及应用得到了很大的发展,各种模型也应运而生。人们在实际应用中越来越感到现有的线性模型,如AR,ARMA模型等,难以很好地刻划复杂的物理现象。因此,对非线性模型的讨论越来越活跃,已经提出了一些非线性模型。但这些模型一般都较复杂,局限性强,建立模型很麻烦,难以推广。1977年,汤家豪提出的门限自回归模型,简称“TAR”(Threshold Autoregression),较好地克服了这些缺点。它的计算复杂性与一般的AR模型相当,且能刻划线性模型难以刻划的物理现象。本文就是基于这一思想,进一步发展了这一模型,提出了一种新的非线性模型——门限自回归滑动平均模型(TARMA)。     

Analyzing short time series data from periodically fluctuating rodent populations by threshold models: A nearest block bootstrap approach

The study of the rodent fluctuations of the North was initiated in its modern form with Elton’s pioneering work. Many scientific studies have been designed to collect yearly rodent abundance data, but the resulting time series are generally subject to at least two “problems”: being short and non-linear. We explore the use of the continuous threshold autoregressive (TAR) models for analyzing such data. In the simplest case, the continuous TAR models are additive autoregressive models, being piecewise linear in one lag, and linear in all other lags. The location of the slope change is called the threshold parameter. The continuous TAR models for rodent abundance data can be derived from a general prey-predator model under some simplifying assumptions. The lag in which the threshold is located sheds important insights on the structure of the prey-predator system. We propose to assess the uncertainty on the location of the threshold via a new bootstrap called the nearest block bootstrap (NBB) which combines the methods of moving block bootstrap and the nearest neighbor bootstrap. The NBB assumes an underlying finite-order time-homogeneous Markov process. Essentially, the NBB bootstraps blocks of random block sizes, with each block being drawn from a non-parametric estimate of the future distribution given the realized past bootstrap series. We illustrate the methods by simulations and on a particular rodent abundance time series from Kilpisjärvi, Northern Finland.     

An elementary approach to dynamics and bifurcations of skew tent maps

In this paper, the dynamics of skew tent maps are classified in terms of two bifurcation parameters. In time series analysis such maps are usually referred to as continuous threshold autoregressive models (TAR(1)-models) after Tong (Non-Linear Time Series, Clarendon Press, Oxford, UK, 1990). This study contains results simplifying the use of TAR(1)-models considerably, e.g. if a periodic attractor exists it is unique. On the other hand, we also claim that care must be exercised when TAR models are used. In fact, they possess a very special type of dynamical pattern with respect to the bifurcation parameters and their transition to chaos is far from standard.     

A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: Threshold-based alternate routing

This paper presents an efficient continuous real-time routing strategy, namely threshold-based alternate routing (TAR), to minimize mean flowtime of parts in a FMS with routing flexibility. TAR routes parts to alternate machines instead of their primary machines when the benefit in terms of waiting time obtained from routing to an alternate machine exceeds a pre-determined threshold value. This study proposes that the threshold value for each manufacturing system is unique and presents a methodology for determining its unique value. The threshold concept and the performance of TAR in minimizing mean flowtime are tested with extensive experimentation, involving intricate experimental design. TAR provides very significant improvements in system performance measures compared to other real-time rerouting methods and shows that the threshold value is unique and dependent on system parameters for each manufacturing system. The relationship between the threshold value and system parameters has also been determined.     

Bayesian Variable and Transformation Selection in Linear Regression

This article suggests a method for variable and transformation selection based on posterior probabilities. Our approach allows for consideration of all possible combinations of untransformed and transformed predictors along with transformed and untransformed versions of the response. To transform the predictors in the model, we use a change-point model, or “change-point transformation,” which can yield more interpretable models and transformations than the standard Box–Tidwell approach. We also address the problem of model uncertainty in the selection of models. By averaging over models, we account for the uncertainty inherent in inference based on a single model chosen from the set of models under consideration. We use a Markov chain Monte Carlo model composition (MC³) method which allows us to average over linear regression models when the space of models under consideration is very large. This considers the selection of variables and transformations at the same time. In an example, we show that model averaging improves predictive performance as compared with any single model that might reasonably be selected, both in terms of overall predictive score and of the coverage of prediction intervals. Software to apply the proposed methodology is available via StatLib.     

A Combinatorial Approach to Piecewise Linear Time Series Analysis

Over recent years, several nonlinear time series models have been proposed in the literature. One model that has found a large number of successful applications is the threshold autoregressive model (TAR). The TAR model is a piecewise linear process whose central idea is to change the parameters of a linear autoregressive model according to the value of an observable variable, called the threshold variable. If this variable is a lagged value of the time series, the model is called a self-exciting threshold autoregressive (SETAR) model. In this article, we propose a heuristic to estimate a more general SETAR model, where the thresholds are multivariate. We formulate the task of finding multivariate thresholds as a combinatorial optimization problem. We develop an algorithm based on a greedy randomized adaptive search procedure (GRASP) to solve the problem. GRASP is an iterative randomized sampling technique that has been shown to quickly produce good quality solutions for a wide variety of optimization problems. The proposed model performs well on both simulated and real data.     

ARCH过程的均值变点估计

研究ARCH过程的均值变点估计.在较弱的条件下证明了变点估计的一致性,并得到了估计的收敛率;为构造变点的置信区间给出了变点的极限分布.模拟结果表明方法的有效性.     

Geometric ergodicity of the Gibbs sampler for the Poisson change-point model

Poisson change-point models have been widely used for modelling inhomogeneous time-series of count data. There are a number of methods available for estimating the parameters in these models using iterative techniques such as MCMC. Many of these techniques share the common problem that there does not seem to be a definitive way of knowing the number of iterations required to obtain sufficient convergence. In this paper, we show that the Gibbs sampler of the Poisson change-point model is geometrically ergodic. Establishing geometric ergodicity is crucial from a practical point of view as it implies the existence of a Markov chain central limit theorem, which can be used to obtain standard error estimates. We prove that the transition kernel is a trace-class operator, which implies geometric ergodicity of the sampler. We then provide a useful application of the sampler to a model for the quarterly driver fatality counts for the state of Victoria, Australia.     

Exploring the latent segmentation space for the assessment of multiple change-point models

This paper addresses the retrospective or off-line multiple change-point detection problem. Multiple change-point models are here viewed as latent structure models and the focus is on inference concerning the latent segmentation space. Methods for exploring the space of possible segmentations of a sequence for a fixed number of change points may be divided into two categories: (i) enumeration of segmentations, (ii) summary of the possible segmentations in change-point or segment profiles. Concerning the first category, a dynamic programming algorithm for computing the top $N$ most probable segmentations is derived. Concerning the second category, a forward-backward dynamic programming algorithm and a smoothing-type forward-backward algorithm for computing two types of change-point and segment profiles are derived. The proposed methods are mainly useful for exploring the segmentation space for successive numbers of change points and provide a set of assessment tools for multiple change-point models that can be applied both in a non-Bayesian and a Bayesian framework. We show using examples that the proposed methods may help to compare alternative multiple change-point models (e.g. Gaussian model with piecewise constant variances or global variance), predict supplementary change points, highlight overestimation of the number of change points and summarize the uncertainty concerning the position of change points.     

Bayesian analysis of multiple thresholds autoregressive model

Bayesian analysis of threshold autoregressive (TAR) model with various possible thresholds is considered. A method of Bayesian stochastic search selection is introduced to identify a threshold-dependent sequence with highest probability. All model parameters are computed by a hybrid Markov chain Monte Carlo method, which combines Metropolis–Hastings algorithm and Gibbs sampler. The main innovation of the method introduced here is to estimate the TAR model without assuming the fixed number of threshold values, thus is more flexible and useful. Simulation experiments and a real data example lend further support to the proposed approach.     

双阀值LSTAR模型及其非线性检验

本文首先简要介绍了平滑转换回归模型(STR)的含义和检验其非线性的程序,然后以汇率均值回复问题为例说明目前流行的单阀值STR模型有其局限性,存在研究双阀值STR模型的必要。为此,本文对双阀值LSTAR模型的非线性检验进行了分析。结果表明,不同于单阀值STAR模型需要对转换函数进行三阶Taylor展开,双阀值LSTAR模型只需对转换函数进行一阶展开即可,因此大大节省了自由度。