Change-Point Detection With Non-Parametric Regression

We consider the regression model y_i = ?(x_i ) + ε in which the function ? or its pth derivative ?^(p) may have a discontinuity at some unknown point τ. By fitting local polynomials from the left and right, we test the null that ?^(p) is continuous against the alternative that ?^(p)(τ?) ≠ ?^(p)(τ+). We obtain Darling-Erdös type limit theorems for the test statistics under the null hypothesis of no change, as well as their limits in probability under the alternative. Consistency of the related change-point estimators is also established.     

ON TRANSITION PROBABILITIES OF SKIP-FREE MARKOV CHAINS

Consider an ergodic Markov chain X(t) in continuous time with an infinitesimal matrix Q = (q_ij) defined on a finite state space {0, 1,…, N}. In this note, we prove that if X(t) is skip-free positive (negative, respectively), i.e., q_ij, = 0 for j > i+ 1 (i > j+ 1), then the transition probability p_ij(t) = Pr[X(t)=j | X(0) =i] can be represented as a linear combination of p_0N(t) (p^(m)_(N0)(t)), 0 ≤ m ≤N, where f^(m)(t) denotes the mth derivative of a function f(t) with f⁽⁰⁾(t) =f(t). If X(t) is a birth-death process, then p_ij(t) is represented as a linear combination of p_0N^(m)(t), 0 ≤m≤N - |i-j|.     

Detection of a change point with local polynomial fits for the random design case

Regression functions may have a change or discontinuity point in the ν th derivative function at an unknown location. This paper considers a method of estimating the location and the jump size of the change point based on the local polynomial fits with one‐sided kernels when the design points are random. It shows that the estimator of the location of the change point achieves the rate n^?1/(2ν+1) when ν is even. On the other hand, when ν is odd, it converges faster than the rate n^?1/(2ν+1) due to a property of one‐sided kernels. Computer simulation demonstrates the improved performance of the method over the existing ones.     

Bounds for Expectations of Differences of Generalized Order Statistics Based on General and Life Distributions

Let X _? ^(r), r ≥ 1, denote generalized order statistics based on an arbitrary distribution function F with finite pth absolute moment for some 1 ≤ p ≤ ∞. We present sharp upper bounds on E(X _? ^(s) ? X _? ^(r)), 1 ≤ r < s, for F being either general or life distribution. The bounds are expressed in various scale units generated by pth central absolute or raw moments of F, respectively. The distributions achieving the bounds are specified.     

Algorithms for the construction of optimizing distributions

We will consider the following problem.Maximise Φ(p)over P={p=(p₁,P₂,…,p_j):P_j≧0,∑p_j=1}". We require to calcute an optimizing distribution. Examples arise in optimal regression design,maximum likelihood estimation and stratified sazmpling problems. A class of multiplicative algorithms, indexed by functions which depend on the derivatives of Φ(·)is considered for solving this problem.Iterations are of the form:p_j ^(r+1)αp_j ^(r)f(x_j ^(r)), where x_{j (r)}=d_j ^(r) or F_j ^(r)and d_j ^(r)=?Φ/?p_j While F_j ^(r)=D_j ^(r)?∑p_i ^(r)d_i ^(r) (a directional derivative)at p=p^(r)f(·)satisfies some suitable properties and may depend on one or more free parameters. These iterations neatly submit to the constraints ofv the problem. Some results will be reported and extensions to problems dependin on two or more distributions and to problems with additional constraints will be considered.     

Non-parametric recursive estimates of a probability density function and its derivatives

Recursive estimates of a probability density function (pdf) are known. This paper presents recursive estimates of a derivative of any desired order of a pdf. Let f be a pdf on the real line and p?0 be any desired integer. Based on a random sample of size n from f, estimators f^(p)_n of f^(p), the pth order derivatives of f, are exhibited. These estimators are of the form $\text{n}{}^{\mathrm{?1}}\text{∑n}\text{j=1}\text{δ}{}_{\mathrm{jp}}$, where δ_jp depends only on p and the jth observation in the sample, and hence can be computed recursively as the sample size increases. These estimators are shown to be asymptotically unbiased, mean square consistent and strongly consistent, both at a point and uniformly on the real line. For pointwise properties, the conditions on f^(p) have been weakened with a little stronger assumption on the kernel function.     

An Estimation Problem with Poisson Processes

For n independent Poisson processes such that the i th process has intensity function lM_i(t) =δ_iρ(t; α) we consider estimation of p(t; α) =∫_oρ:(u; α) du. Two procedures are developed, one using exact arrival times, the other using categorical arrival times. Two instances where p(t; α) =p(α t) are investigated further. An example applying the methodology to the active life of a judicial opinion is described.     

Estimation of the location of a 0-type or ∞-type singularity by Poisson observations

We consider an inhomogeneous Poisson process X on [0, T]. The intensity function of X is supposed to be strictly positive and smooth on [0, T] except at the point θ, in which it has either a 0-type singularity (tends to 0 like |x| ^p , p∈(0, 1)), or an ∞-type singularity (tends to ∞ like |x| ^p , p∈(?1, 0)). We suppose that we know the shape of the intensity function, but not the location of the singularity. We consider the problem of estimation of this location (shift) parameter θ based on n observations of the process X. We study the Bayesian estimators and, in the case p>0, the maximum-likelihood estimator. We show that these estimators are consistent, their rate of convergence is n ^1/(p+1), they have different limit distributions, and the Bayesian estimators are asymptotically efficient.     

Attainability of the Upper Bounds for the Mean Past Lifetime of Parallel System Components

Among reliability systems, one of the basic systems is a parallel system. In this article, we consider a parallel system consisting of n identical components with independent lifetimes having a common distribution function F. Under the condition that the system has failed by time t, with t being 100pth percentile of F(t = F ^?1(p), 0 < p < 1), we characterize the probability distributions based on the mean past lifetime of the components of the system. These distributions are described in the form of a specific shape on the left of t and arbitrary continuous function on the right tail.     

Expected Absolute Error of the Usual Estimator of the Binomial Parameter

For X with binomial (n, p) distribution the usual measure of the error of X/n as an estimator of p is its standard error S_n(p) = √{E(X/n – p)²} = √{p(1 – p)/n}. A somewhat more natural measure is the average absolute error D_n(p) = E‖X/n – p‖. This article considers use of D_n(p) instead of S_n(p) in a student's first introduction to statistical estimation. Exact and asymptotic values of D_n(p), and the appearance of its graph, are described in detail. The same is done for the Poisson distribution.     

On moments of the supremum of normed weighted averages

Let {X, X_n; n ≥ 1} be a sequence of real-valued iid random variables, 0 < r < 2 and p > 0. Let D = { A = (a_nk; 1 ≤ k ≤ n, n ≥ 1); a_nk, ? R and sup_{n, k} |a_n,k| < ∞}. Set S_n( A ) = ∑ⁿ_k=1a_{n, k}X_k for A ? D and n ≥ 1. This paper is devoted to determining conditions whereby E{sup_{n ≥ 1}, |S_n( A )|/n^1/r}^p < ∞ or E{sup_{n ≥ 2} |S_n( A )|/2n log n)^1/2}^p < ∞ for every A ? D. This generalizes some earlier results, including those of Burkholder (1962), Choi and Sung (1987), Davis (1971), Gut (1979), Klass (1974), Siegmund (1969) and Teicher (1971).     

An asymptotic representation of a ratio of two statistics and its applications

Some statistics in common use take a form of a ratio of two statistics.In this paper, we will discuss asymptotic properties of the ratio statistic.We obtain an asymptotic representation of the ratio with remainder term o _p(n ^-1) and a Edgeworth expansion with remainder term o(n ^-1/2) And as example, the asymptotic representation and the Edgeworth expansion of the jackknife skewness estimator for U-statistics are established and we discuss the biases of the skewness estimator theoretically.We also apply the result to an estimator of Pearson’s coefficient of variation and the sample correlation coefficient.     

Growth of tuber crops and almost sure band for quantiles

Some tuber crops are governed by memoryless property of exponential distribution leading to a mixture distribution with heavy tail. Quantile-based estimators may then be appropriate than mean as a measure of central tendency. We prove almost sure representation theorems for sample quantiles in a general setup of U statistics, under slightly stronger assumption than assuming the existence of a continuously differentiable distribution function F for the kernel h. We obtain almost sure (a.s.) upper and lower estimate for F^{? 1}(p), p ∈ (0, 1) as a band for p varying. As an application, dataset arising from two varieties of potato cultivation are analyzed.     

Locally minimax tests for multiple correlations

Let X be a normally distributed p-dimensional column vector with mean μ and positive definite covariance matrix σ. and let X α, α = 1,…, N, be a random sample of size N from this distribution. Partition X as ( X ₁, X ₍₂₎', X '₍₃₎)', where X₁ is one-dimension, X₍₂₎ is p₂- dimensional, and so 1 + p₁ + p₂ = p. Let ρ₁ and ρ be the multiple correlation coefficients of X₁ with X₍₂₎ and with ( X '₍₂₎, X '₍₃₎)', respectively. Write ρ2/2 = ρ² - ρ2/1. We shall cosider the following two problems     

Precise large deviations for the difference of two sums of END random variables with heavy tails

Assume that there are two types of insurance contracts in an insurance company, and the ith related claims are denoted by {X_ij, j ? 1}, i = 1, 2. In this article, the asymptotic behaviors of precise large deviations for non random difference ∑^n₁(t)_{j = 1}X_1j ? ∑^n₂(t)_{j = 1}X_2j and random difference ∑^N₁(t)_{j = 1}X_1j ? ∑^N₂(t)_{j = 1}X_2j are investigated, and under several assumptions, some corresponding asymptotic formulas are obtained.     

Lp solutions of anticipated BSDEs with weak monotonicity and general growth generators

In this article, we establish the stability theorems of L^p(1 < p ? 2) solutions for multidimensional anticipated backward stochastic differential equations (BSDEs), in which the generator g is p-order weak monotonic in y and Lipschitz continuous in (z, η, ?). Moreover, we present the existence and uniqueness of L^p solutions for this kind of anticipated BSDEs with the help of stability theorems when generator g also satisfies general growth condition in y.     

On the rate of convergence of recursive kernel estimates of probability densities

Recursive estimates f_n^r(x)of the rth derivative f^r(x)(r=0,1)of the univariate probability density f(x) for strictly stationary processes {X_j,} are considered. The asymptotic variance-covariance of f_n^r(x)is established for stationary triangular arrays of random variables satisfying various asymptotic independence-uncorrelatedness conditions.     

Improved minimax estimation of a normal precision matrix

Let S_{p × p} have a Wishart distribution with parameter matrix Σ and n degrees of freedom. We consider here the problem of estimating the precision matrix Σ^?1 under the loss functions L₁(σ) tr (σ) - log |σ| and L₂(σ) = tr (σ). James-Stein-type estimators have been derived for an arbitrary p. We also obtain an orthogonal invariant and a diagonal invariant minimax estimator under both loss functions. A Monte-Carlo simulation study indicates that the risk improvement of the orthogonal invariant estimators over the James-Stein type estimators, the Haff (1979) estimator, and the “testimator” given by Sinha and Ghosh (1987) is substantial.     

Box-Cox transformed linear models: A parameter-based asymptotic approach

A Box-Cox transformed linear model usually has the form y(λ) = μ + β₁x₁ +… + β_px_p + oe, where y(λ) is the power transform of y. Although widely used in practice, the Fisher information matrix for the unknown parameters and, in particular, its inverse have not been studied seriously in the literature. We obtain those two important matrices to put the Box-Cox transformed linear model on a firmer ground. The question of how to make inference on β = (β₁,…,β_p)^T when λ; is estimated from the data is then discussed for large but finite sample size by studying some parameter-based asymptotics. Both unconditional and conditional inference are studied from the frequentist point of view.