In this paper the class of ARCH$(\infty)$ models is generalized to the nonstationary class of ARCH$(\infty)$ models with time-varying coefficients. For fixed time points, a stationary approximation is given leading to the notation ``locally stationary ARCH$(\infty)$ process.'' The asymptotic properties of weighted quasi-likelihood estimators of time-varying ARCH$(p)$ processes ($p<\infty$) are studied, including asymptotic normality. In particular, the extra bias due to nonstationarity of the process is investigated. Moreover, a Taylor expansion of the nonstationary ARCH process in terms of stationary processes is given and it is proved that the time-varying ARCH process can be written as a time-varying Volterra series.
In this paper, we develop a complete methodology for detecting time-varying/non time-varying parameters in ARCH processes. For this purpose, we estimate and test various semiparametric versions of the time-varying ARCH model (tv-ARCH) which include two well known non stationary ARCH type models introduced in the econometric literature. Using kernel estimation, we show that non time-varying parameters can be estimated at the usual parametric rate of convergence and for a Gaussian noise, we construct estimates that are asymptotically efficient in a semiparametric sense. Then we introduce two sta…
There exist very few results on mixing for non-stationary processes. However, mixing is often required in statistical inference for non-stationary processes such as time-varying ARCH (tvARCH) models. In this paper, bounds for the mixing rates of a stochastic process are derived in terms of the conditional densities of the process. These bounds are used to obtain the $α$, 2-mixing and $β$-mixing rates of the non-stationary time-varying $\operatorname {ARCH}(p)$ process and $\operatorname {ARCH}(\infty)$ process. It is shown that the mixing rate of the time-varying $\operatorname {ARCH}(p)$ proc…
We study semiparametric varying-coefficient partially linear models when some linear covariates are not observed, but ancillary variables are available. Semiparametric profile least-square based estimation procedures are developed for parametric and nonparametric components after we calibrate the error-prone covariates. Asymptotic properties of the proposed estimators are established. We also propose the profile least-square based ratio test and Wald test to identify significant parametric and nonparametric components. To improve accuracy of the proposed tests for small or moderate sample size…
We describe the asymptotic behavior of the conditional least squares estimator of the offspring mean for subcritical strongly stationary Galton--Watson processes with regularly varying immigration with tail index $α\in (1,2)$. The limit law is the ratio of two dependent stable random variables with indices $α/2$ and $2α/3$, respectively, and it has a continuously differentiable density function. We use point process technique in the proofs.
In this paper we propose a recursive online algorithm for estimating the parameters of a time-varying ARCH process. The estimation is done by updating the estimator at time point $t-1$ with observations about the time point $t$ to yield an estimator of the parameter at time point $t$. The sampling properties of this estimator are studied in a non-stationary context -- in particular, asymptotic normality and an expression for the bias due to non-stationarity are established. By running two recursive online algorithms in parallel with different step sizes and taking a linear combination of the e…
We investigate the time-varying ARCH (tvARCH) process. It is shown that it can be used to describe the slow decay of the sample autocorrelations of the squared returns often observed in financial time series, which warrants the further study of parameter estimation methods for the model. Since the parameters are changing over time, a successful estimator needs to perform well for small samples. We propose a kernel normalized-least-squares (kernel-NLS) estimator which has a closed form, and thus outperforms the previously proposed kernel quasi-maximum likelihood (kernel-QML) estimator for small…
We consider stationary time series $\{X_j, j \in Z\} whose finite dimensional distributions are regularly varying with extremal independence. We assume that for each $h \geq 1$, conditionally on $X_0$ to exceed a threshold tending to infinity, the conditional distribution of $X_h$ suitably normalized converges weakly to a non degenerate distribution. We consider in this paper the estimation of the normalization and of the limiting distribution.
We establish asymptotic properties of $M$-estimators, defined in terms of a contrast function and observations from a continuous-time locally stationary process. Using the stationary approximation of the sequence, $θ$-weak dependence, and hereditary properties, we give sufficient conditions on the contrast function that ensure consistency and asymptotic normality of the $M$-estimator. As an example, we obtain consistency and asymptotic normality of a localized least squares estimator for observations from a sequence of time-varying Lévy-driven Ornstein-Uhlenbeck processes. Furthermore, for a s…
Statistical estimation and inference for marginal hazard models with varying coefficients for multivariate failure time data are important subjects in survival analysis. A local pseudo-partial likelihood procedure is proposed for estimating the unknown coefficient functions. A weighted average estimator is also proposed in an attempt to improve the efficiency of the estimator. The consistency and asymptotic normality of the proposed estimators are established and standard error formulas for the estimated coefficients are derived and empirically tested. To reduce the computational burden of the…
We introduce and show the existence of a Hawkes self-exciting point process with exponentially-decreasing kernel and where parameters are time-varying. The quantity of interest is defined as the integrated parameter $T^{-1}\int_0^Tθ_t^*dt$, where $θ_t^*$ is the time-varying parameter, and we consider the high-frequency asymptotics. To estimate it naïvely, we chop the data into several blocks, compute the maximum likelihood estimator (MLE) on each block, and take the average of the local estimates. The asymptotic bias explodes asymptotically, thus we provide a non-naïve estimator which is const…
In this paper, we provide non-parametric statistical tools to test stationarity of microstructure noise in general hidden Ito semimartingales, and discuss how to measure liquidity risk using high frequency financial data. In particular, we investigate the impact of non-stationary microstructure noise on some volatility estimators, and design three complementary tests by exploiting edge effects, information aggregation of local estimates and high-frequency asymptotic approximation. The asymptotic distributions of these tests are available under both stationary and non-stationary assumptions, th…
Quantile regression has been successfully used to study heterogeneous and heavy-tailed data. Varying-coefficient models are frequently used to capture changes in the effect of input variables on the response as a function of an index or time. In this work, we study high-dimensional varying-coefficient quantile regression models and develop new tools for statistical inference. We focus on development of valid confidence intervals and honest tests for nonparametric coefficients at a fixed time point and quantile, while allowing for a high-dimensional setting where the number of input variables e…
We develop a new statistical model to analyse time-varying ranking data. The model can be used with a large number of ranked items, accommodates exogenous time-varying covariates and partial rankings, and is estimated via the maximum likelihood in a straightforward manner. Rankings are modelled using the Plackett-Luce distribution with time-varying worth parameters that follow a mean-reverting time series process. To capture the dependence of the worth parameters on past rankings, we utilise the conditional score in the fashion of the generalised autoregressive score (GAS) models. Simulation e…
University of Michigan（密歇根大学）；University of Southern California（南加州大学）
In this paper, we study the problem of inferring time-varying Markov random fields (MRF), where the underlying graphical model is both sparse and changes sparsely over time. Most of the existing methods for the inference of time-varying MRFs rely on the regularized maximum likelihood estimation (MLE), that typically suffer from weak statistical guarantees and high computational time. Instead, we introduce a new class of constrained optimization problems for the inference of sparsely-changing MRFs. The proposed optimization problem is formulated based on the exact $\ell_0$ regularization, and c…
Dynamic networks are commonly used in applications where relational data is observed over time. Statistical models for such data should capture not only the temporal dependencies between networks observed in time, but also the structural dependencies among the nodes and edges in each network. As a consequence, effectively making inference on dynamic networks is a computationally challenging task, and many models established for dynamic networks are intractable even for moderately sized networks. In this paper, we propose and investigate a family of dynamic network models, known as varying-coef…
Dramatic increases in the size and complexity of modern datasets have made traditional "centralized" statistical inference prohibitive. In addition to computational challenges associated with big data learning, the presence of numerous data types (e.g. discrete, continuous, categorical, etc.) makes automation and scalability difficult. A question of immediate concern is how to design a data-intensive statistical inference architecture without changing the basic statistical modeling principles developed for "small" data over the last century. To address this problem, we present MetaLP, a flexib…
Modern technological advances have expanded the scope of applications requiring analysis of large-scale datastreams that comprise multiple indefinitely long time series. There is an acute need for statistical methodologies that perform online inference and continuously revise the model to reflect the current status of the underlying process. In this manuscript, we propose a dynamic statistical inference framework--named dynamic tracking and screening (DTS)--that is not only able to provide accurate estimates of the underlying parameters in a dynamic statistical model, but also capable of rapid…
We introduce the exchangeable rewiring process for modeling time-varying networks. The process fulfills fundamental mathematical and statistical properties and can be easily constructed from the novel operation of random rewiring. We derive basic properties of the model, including consistency under subsampling, exchangeability, and the Feller property. A reversible sub-family related to the Erdős-Rényi model arises as a special case.
We consider a stationary regularly varying time series which can be expressedas a function of a geometrically ergodic Markov chain. We obtain practical conditionsfor the weak convergence of the tail array sums and feasible estimators ofcluster statistics. These conditions include the so-called geometric drift or Foster-Lyapunovcondition and can be easily checked for most usual time series models witha Markovian structure. We illustrate these conditions on several models and statisticalapplications. A counterexample is given to show a different limiting behaviorwhen the geometric drift conditio…
A statistical inference for random coefficient first-order autoregressive model $[RCAR(1)]$ was investigated by P.M. ROBINSON (1978) in which the coefficients varying over individuals. In this paper we attempt to generalize this result to random coefficient autoregressive model of order $p$ $[RCAR(p)]$. The stationarity condition will derived for this model.
A general class of time-varying regression models is considered in this paper. We estimate the regression coefficients by using local linear M-estimation. For these estimators, weak Bahadur representations are obtained and are used to construct simultaneous confidence bands. For practical implementation, we propose a bootstrap based method to circumvent the slow logarithmic convergence of the theoretical simultaneous bands. Our results substantially generalize and unify the treatments for several time-varying regression and auto-regression models. The performance for ARCH and GARCH models is s…
A new class of stochastic processes called independent and periodically identically distributed (i.p.i.d.) processes is defined to capture periodically varying statistical behavior. Algorithms are proposed to detect changes in such i.p.i.d. processes. It is shown that the algorithms can be computed recursively and are asymptotically optimal. This problem has applications in anomaly detection in traffic data, social network data, and neural data, where periodic statistical behavior has been observed.
Conditional heteroscedastic (CH) models are routinely used to analyze financial datasets. The classical models such as ARCH-GARCH with time-invariant coefficients are often inadequate to describe frequent changes over time due to market variability. However we can achieve significantly better insight by considering the time-varying analogues of these models. In this paper, we propose a Bayesian approach to the estimation of such models and develop computationally efficient MCMC algorithm based on Hamiltonian Monte Carlo (HMC) sampling. We also established posterior contraction rates with incre…
The Internet, as a global system of interconnected networks, carries an extensive array of information resources and services. Key requirements include good quality-of-service and protection of the infrastructure from nefarious activity (e.g. distributed denial of service--DDoS--attacks). Network monitoring is essential to network engineering, capacity planning and prevention / mitigation of threats. We develop an open source architecture, AMON (All-packet MONitor), for online monitoring and analysis of multi-gigabit network streams. It leverages the high-performance packet monitor PF RING and…
