A test for the equality of k medians against the simple tree alternative under right censorship

We consider a test for the equality of k population medians, θ_i i=1,2,….,k, when it is believed a priori, that θ _i: The observations are subject to right censorhip. The distributions of the censoring variables for each population are assumed to be equal. This test is compared with the general k-sample test proposed by Breslow     

Computations of Bayesian t-values for multiple comparisons

Results from a simulation study of the power of eight statistics for testing that a sample is form a uniform distribution on the unit interval are reported. Power is given for each statistic against four classes if alternatives. The statistics studied include the discrete Pearson chi-square with ten and twenty cells, X² ₁₀ and X² ₂₀; Kolmogorov-smirov, D; Cramer-Von Mises, W²; Watson, U²; Anderson-Darling, A; Greenwood. G;and a new statistic called O A modified form of each of these statistic is also studied by first transforming the sample using a transformation given by Durbin. On the basis of the results observed in this study, the Watson U² statistic is recommended as a general test for uniformity.     

A bayesian analysis for less smooth departures from polynomial regression models

Observations y_i are made at points t_i according to the model _i=θ(t_i)+e_i where the e_i are independent normals with constant variance. It is conjec tured that the function θ lies in a set G of functions spanned by the basis functions φ₁,φ₂,…,φ_p. A prior distribution is developed whereby the proba bility assigned to a function θ is a decreasing function of a particular measure of the distance of θ from the set G. Bayes' theorem is used to construct an estimateθ. A marginal likelihood is derived which is used to estimate the parameter of the prior and also for testing the null hypothesis H_o θ ? G. The new methodology is tested in a Monte Carlo study and applied to a set of data representing the average weight to height ratio of a group of boys recorded at one month intervals.     

Non-parametric estimation of an acceleration parameter

Let X₁,… X_m be a random sample of m failure times under normal conditions with the underlying distribution F(x) and Y₁,…,Y_n a random sample of n failure times under accelerated condititons with underlying distribution G(x);G(x)=1?[1?F(x)]^θ with θ being the unknown parameter under study.Define:U_ij=1 otherwise.The joint distribution of _ijdoes not involve the distribution F and thus can be used to estimate the acceleration parameter θ.The second approach for estimating θ is to use the ranks of the Y-observations in the combined X- and Y-samples.In this paper we establish that the rank of the Y-observations in the pooled sample form a sufficient statistic for the information contained in the U_ii 's about the parameter θ and that there does not exist an unbiassed estimator for the parameter θ.We also construct several estimators and confidence interavals for the parameter θ.     

Adaptive parametric test in a semiparametric regression model

Consider the semiparametric regression model Y_i = x′_iβ +g(t_i)+e_i for i=1,2, …,n. Here the design points (x_i,t_i) are known and nonrandom and the e_i are iid random errors with Ee₁ = 0 and Ee² ₁ = α²<∞. Based on g(.) approximated by a B-spline function, we consider using atest statistic for testing H₀ : β = 0. Meanwhile, an adaptive parametric test statistic is constructed and a large sample study for this adaptive parametric test statistic is presented.     

Local asymptotic normality of intermediate and central order statistics

Consider n independent random variables Z_i,…, Z_n on R with common distribution function F, whose upper tail belongs to a parametric family F(t) = F_θ(t),t ≥ x₀, where θ ∈ ? ? R ^d. A necessary and sufficient condition for the family F_θ, θ ∈ ?, is established such that the k-th largest order statistic Z_n?k+1:n alone constitutes the central sequence yielding local asymptotic normality ( LAN ) of the loglikelihood ratio of the vector (Z_n?i+1:n)¹ _i=kof the k largest order statistics. This is achieved for k = k(n)→_n→∞∞ with k/n→_n→∞ 0.

In the case of vectors of central order statistics ( Z_r:n, Z_r+1:n,…, Z_s:n ), with r/n and s/n both converging to q ∈ ( 0,1 ), it turns out that under fairly general conditions any order statistic Z_m:n with r ≤ m ≤s builds the central sequence in a pertaining LAN expansion.These results lead to asymptotically optimal tests and estimators of the underlying parameter, which depend on single order statistics only     

Estimated Generalized Least Squares for a Heteroscedastic Regression Model

This paper considers the general linear regression model yc = X₁β+u_t under the heteroscedastic structure E(u_t) = 0, E(u²) =σ²- (X_tβ)², E(u_t u_s) = 0, tæs, t, s= 1, T. It is shown that any estimated GLS estimator for β is asymptotically equivalent to the GLS estimator under some regularity conditions. A three-step GLS estimator, which calls upon the assumption E(u_t²) =s?²(X,β)² for the estimation of the disturbance covariance matrix, is considered.     

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.     

Nonlinear filters based on taylor series expansions ∗

The nonlinear filters based on Taylor series approximation are broadly used for computational simplicity, even though their filtering estimates are clearly biased. In this paper, first, we analyze what is approximated when we apply the expanded nonlinear functions to the standard linear recursive Kalman filter algorithm. Next, since the state variable α_t and α_t-t are approximated as a conditional normal distribution given information up to time t - 1 (i.e., I_t-1) in approximation of the Taylor series expansion, it might be appropriate to evaluate each expectation by generating normal random numbers of α_t and α_t-1 given I_t-1 and those of the error terms θ and η_t. Thus, we propose the Monte-Carlo simulation filter using normal random draws. Finally we perform two Monte-Carlo experiments, where we obtain the result that the Monte-Carlo simulation filter has a superior performance over the nonlinear filters such as the extended Kalman filter and the second-order nonlinear filter.     

SOME LAW OF THE ITERATED LOGARITHM TYPE RESULTS FOR THE EMPIRICAL PROCESS

We consider Z^±_n= sup_{0< t ≤ 1/2}2 U^±_n (t)/(t(1- t))^1/2, where + and -denote the positive and negative parts respectively of the sample paths of the empirical process U_n. U^±_n and U_n are seen to behave rather differently, which is tied to the asymmetry of the binomial distribution, or to the asymmetry of the distribution of small order statistics. Csáki (1975) showed that log Z^±_n/log₂n is the appropriate normalization for a law of the iterated logarithm (LIL) for Z^±_n we show that Z^-_n/(2 log₂n)^1/2 is the appropriate normalization for Z^-_n. Csörgö & Révész (1975) posed the question: if we replace the sup over (0,1/2) above, by -the sup over [a_n, 1-a_n] where a_n→0, how fast can a_n→0 and still have |Z_n|/(2 log₂n)^1/2 maintain a finite lim sup a.s.? This question is answered herein. The techniques developed are then used in Section 4 to give an interesting new proof of the upper class half of a result of Chung (1949) for |U_n(t)|. The proofs draw heavily on James (1975); two basic inequalities of that paper are strengthened to their potential, and are felt to be of independent interest.     

Geometric ergodicity of nonlinear autoregressive models with changing conditional variances

The authors give easy‐to‐check sufficient conditions for the geometric ergodicity and the finiteness of the moments of a random process x_t = ?(x_t‐1,…, x_t‐p) + ?_tσ(x_t‐1,…, x_t‐q) in which ?: R^p → R, σ R^q → R and (?_t) is a sequence of independent and identically distributed random variables. They deduce strong mixing properties for this class of nonlinear autoregressive models with changing conditional variances which includes, among others, the ARCH(p), the AR(p)‐ARCH(p), and the double‐threshold autoregressive models.     

On the bounded regret of empirical bayes estimators

Let (θ₁,x₁),…,(θ_n,x_n) be independent and identically distributed random vectors with E(xθ) = θ and Var(x|θ) = a + bθ + cθ². Let t_i be the linear Bayes estimator of θ_i and θ~_i be the linear empirical Bayes estimator of θ_i as proposed in Robbins (1983). When Ex and Var x are unknown to the statistician. The regret of using θ~_i instead of t_i because of ignorance of the mean and the variance is r_i = E(θ_i ? θ_i)² ?E(t_i ?θ_i)². Under appropriate conditions cumulative regret R_n = r₁+…r_n is shown to have a finite limit even when n tends to infinity. The limit can be explicitly computed in terms of a,b,c and the first four moments of x.     

Asymptotics for multisample statistics

Consider a family of square-integrable R^d-valued statistics S_k = S_k(X_1,k1; X_2,k2;…; X_m,km), where the independent samples X_i,kj respectively have k_i i.i.d. components valued in some separable metric space X_i. We prove a strong law of large numbers, a central limit theorem and a law of the iterated logarithm for the sequence {S_k}, including both the situations where the sample sizes tend to infinity while m is fixed and those where the sample sizes remain small while m tends to infinity. We also obtain two almost sure convergence results in both these contexts, under the additional assumption that S_k is symmetric in the coordinates of each sample X_i,kj. Some extensions to row-exchangeable and conditionally independent observations are provided. Applications to an estimator of the dimension of a data set and to the Henze-Schilling test statistic for equality of two densities are also presented.     

Statistical inference on the drift parameter in fractional Brownian motion with a deterministic drift

In statistical inference on the drift parameter a in the fractional Brownian motion W^H_t with the Hurst parameter H ∈ (0, 1) with a constant drift Y^H_t = at + W^H_t, there is a large number of options how to do it. We may, for example, base this inference on the properties of the standard normal distribution applied to the differences between the observed values of the process at discrete times. Although such methods are very simple, it turns out that more appropriate is to use inverse methods. Such methods can be generalized to non constant drift. For the hypotheses testing about the drift parameter a, it is more proper to standardize the observed process, and to use inverse methods based on the first exit time of the observed process of a pre-specified interval until some given time. These procedures are illustrated, and their times of decision are compared against the direct approach. Other generalizations are possible when the random part is a symmetric stochastic integral of a known, deterministic function with respect to fractional Brownian motion.     

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|.     

DECOMPOSITION OF A SEMI-MARKOV PROCESS UNDER A MARKOVIAN RULE

Consider a semi-Markov process {X(t), t>0} with transition epochs T₀ T₁, T₂…. Suppose that at each one of the epochs {T_n} one of R possible events, E₁, E₂,…, E_R can happen, where the occurrences of successive events form a Markov chain. for a fixed r, let the times the event E_r happens be U_o U₁, U₂,…. In this paper we are interested in the process {Y(t), t>0)} where Y(t)=X(U_k) if and only if U_k≤tk+1. It will be shown that {Y(t)} is a semi-Markov process, and its properties with respect to those of {X(t)} will be examined.     

Limit theory for moderate deviations from a unit root with a break in variance

Consider the model y_t = ρ_ny_{t ? 1} + u_t, t = 1, …, n with ρ_n = 1 + c/k_n and u_t = σ₁?_tI{t ? k₀} + σ₂?_tI{t > k₀}, where c is a non-zero constant, σ₁ and σ₂ are two positive constants, I{ · } denotes the indicator function, k_n is a sequence of positive constants increasing to ∞ such that k_n = o(n), and {?_t, t ? 1} is a sequence of i.i.d. random variables with mean zero and variance one. We derive the limiting distributions of the least squares estimator of ρ_n and the t-ratio of ρ_n for the above model in this paper. Some pivotal limit theorems are also obtained. Moreover, Monte Carlo experiments are conducted to examine the estimators under finite sample situations. Our theoretical results are supported by Monte Carlo experiments.     

Optimal Designs for Approximating a Stochastic Process with Respect to a Minimax Criterion

We study the problem of approximating a stochastic process Y = {Y(t: t ∈ T} with known and continuous covariance function R on the basis of finitely many observations Y(t ₁,), …, Y(t _n ). Dependent on the knowledge about the mean function, we use different approximations ? and measure their performance by the corresponding maximum mean squared error sub _t∈T E(Y(t) ? ?(t))². For a compact T ? ? ^p we prove sufficient conditions for the existence of optimal designs. For the class of covariance functions on T ² = [0, 1]² which satisfy generalized Sacks/Ylvisaker regularity conditions of order zero or are of product type, we construct sequences of designs for which the proposed approximations perform asymptotically optimal.