LOG-PERIODOGRAM ESTIMATION OF LONG MEMORY VOLATILITY DEPENDENCIES WITH CONDITIONALLY HEAVY TAILED RETURNS

ABSTRACT

Many recent papers have used semiparametric methods, especially the log-periodogram regression, to detect and estimate long memory in the volatility of asset returns. In these papers, the volatility is proxied by measures such as squared, log-squared, and absolute returns. While the evidence for the existence of long memory is strong using any of these measures, the actual long memory parameter estimates can be sensitive to which measure is used. In Monte-Carlo simulations, I find that if the data is conditionally leptokurtic, the log-periodogram regression estimator using squared returns has a large downward bias, which is avoided by using other volatility measures. In United States stock return data, I find that squared returns give much lower estimates of the long memory parameter than the alternative volatility measures, which is consistent with the simulation results. I conclude that researchers should avoid using the squared returns in the semiparametric estimation of long memory volatility dependencies.     

Extreme statistics from the cosine distribution

The cosine distribution serves as a very good teaching example for which exact moment properties of extreme order statistics can be expressed in terms of elementary functions. This article presents the limiting joint distribution of the extreme order statistics for the cosine distribution. It is shown that burrows'(1986) result is a special case of the result presented in this article.     

A simple method to obtain minimum aberration split-plot designs

ABSTRACT

Split-plot designs have been utilized in factorial experiments with some factors applied to larger units and others to smaller units. Such designs with low aberration are preferred when the experimental size and the number of factors considered in both whole plot and subplot are determined. The minimum aberration split-plot designs can be obtained using either computer algorithms or the exhausted search. In this article, we propose a simple, easy-to-operate approach by using two ordered sequences of columns from two orthogonal arrays in obtaining minimum aberration split-plot designs for experiments of sizes 16 and 32.     

Lattice path combinatorics for multiple product identities

Lattice paths are enumerated as walks on a lattice under the Delannoy criterion of vertical, horizontal and upward diagonal steps. Delannoy recursions are generalized for arbitrary weights in each of these directions, where the row elements of the Delannoy triangles correspond to lattice paths for all walks at a given length.     

The mean of linear signed rank statistics under alternatives

An expression is presented for the mean of a linear signed rank statistic for the one sample location model. Several examples are given to illustrate its application.     

从解一个古典概率问题所想到的

文章给出一个古典概率问题的两个解法，从而导出几个有趣的等式。     

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph

Given an undirected multigraph G = (V, E) and two positive integers and k, we consider the problem of augmenting G by the smallest number of new edges to obtain an -edge-connected and k-vertex-connected multigraph. In this paper, we show that the problem can be solved in Õ(mn²) time for any fixed and k = 3 if an input multigraph G is 2-vertex-connected, where n = |V| and m is the number of pairs of adjacent vertices in G.     

On Inverse Problems of Optimum Perfect Matching

As far as we know, for most polynomially solvable network optimization problems, their inverse problems under l ₁ or l norm have been studied, except the inverse maximum-weight matching problem in non-bipartite networks. In this paper we discuss the inverse problem of maximum-weight perfect matching in a non-bipartite network under l ₁ and l norms. It has been proved that the inverse maximum-weight perfect matching under l norm can be formulated as a maximum-mean alternating cycle problem of an undirected network, and can be solved in polynomial time by a binary search algorithm and in strongly polynomial time by an ascending algorithm, and under l ₁ norm it can be solved by the ellipsoid method. Therefore, inverse problems of maximum-weight perfect matching under l ₁ and l norms are solvable in polynomial time.     

Landau多项式算子与无界函数逼近

利用扩展乘数法构造了 Landau型多项式算子逼近全空间或有界集上无界函数的若干收敛定理 ,给出了具有一般性的结论 ,从而推广了已有文献的若干结果 .     

Admissible minimum bias estimation of response surfaces

The minimum bias estimator was introduced as an alternative to the least squares estimator for approximating response functions by low-order polynomials. Here we show how to obtain an admissible estimator with smaller squared bias.