强混合样本下回归加权估计的一致渐近正态性

在强混合样本下,讨论固定设计回归模型的加权函数估计的一致渐近正态性,给出一致渐近正态性的收敛速度,这个速度接近n-1／6．     

On the Weak Invariance Principle for Stationary Sequences under Projective Criteria

In this paper, we study the central limit theorem and its weak invariance principle for sums of a stationary sequence of random variables, via a martingale decomposition. Our conditions involve the conditional expectation of sums of random variables with respect to the distant past. The results contribute to the clarification of the central limit question for stationary sequences. Magda Peligrad is supported in part by a Charles Phelps Taft research support grant at the Univeristy of Cincinnati and the NSA grant H98230-05-1-0066.     

固定设计下一类半参数回归模型的渐近性质

对固定设计下的一类半参数回归模型yi=xiβ+g(xi)+ei,i=1,2,…,n,综合最小二乘和非参数权函数估计方法,定义了,βg的估计量β∧n,gn∧及误差方差σ2的估计量σ2n∧.在适当条件下,证明它们具有强相合性和p(2)阶平均相合性.模拟的结果表明所得结果具有优良的性质.     

非参数回归函数之改良基于分割的估计的强相合性（英）

设(X,Y),(X1,Y1),…,(XnYn)为取值于 Rd× R的 i．i．d．随机变量,E(|Y|) ＜∞．设mn(x)为回归函数m(x)=E(|Y|X=x)基于分割的估计,本文在对mn(x)进行改良的条件下得到改良的基于分割的强相合估计．     

正相协列乘积和的重对数律与强大数律

证明了强平稳正相协列乘积和的重对数律与不同分布正相协列乘积和的强大数律,指出了部分和服从强大数律但乘积和未必服从强大数律这一事实,并讨论了定理2中一个条件的必要性．     

B值鞅型序列的一些极限定理

本文讨论了一些B值鞅型序列的强大数定律 ,弱大数定律 ,Lr收敛性及完全收敛性 ,推广了许多熟知的结果 .     

QUENCHING PROBLEMS OF DEGENERATE FUNCTIONAL REACTION-DIFFUSION EQUATION

This paper is concerned with the quenching problem of a degenerate functional reaction-diffusion equation. The quenching problem and global existence of solution for the reaction-diffusion equation are derived and, some results of the positive steady state solutions for functional elliptic boundary value are also presented.     

Resolvent estimates in W−1,p related to strongly coupled‐linear parabolic systems with coupled nonsmooth capacities

We investigate linear parabolic systems with coupled nonsmooth capacities and mixed boundary conditions. We prove generalized resolvent estimates in W^{?1, p} spaces. The method is an appropriate modification of a technique introduced by Agmon to obtain L^p estimates for resolvents of elliptic differential operators in the case of smooth boundary conditions. Moreover, we establish an existence and uniqueness result. Copyright © 2007 John Wiley & Sons, Ltd.     

Towards Strong Duality in Integer Programming

We consider in this paper the Lagrangian dual method for solving general integer programming. New properties of Lagrangian duality are derived by a means of perturbation analysis. In particular, a necessary and sufficient condition for a primal optimal solution to be generated by the Lagrangian relaxation is obtained. The solution properties of Lagrangian relaxation problem are studied systematically. To overcome the difficulties caused by duality gap between the primal problem and the dual problem, we introduce an equivalent reformulation for the primal problem via applying a pth power to the constraints. We prove that this reformulation possesses an asymptotic strong duality property. Primal feasibility and primal optimality of the Lagrangian relaxation problems can be achieved in this reformulation when the parameter p is larger than a threshold value, thus ensuring the existence of an optimal primal-dual pair. We further show that duality gap for this partial pth power reformulation is a strictly decreasing function of p in the case of a single constraint. Dedicated to Professor Alex Rubinov on the occasion of his 65th birthday. Research supported by the Research Grants Council of Hong Kong under Grant CUHK 4214/01E, and the National Natural Science Foundation of China under Grants 79970107 and 10571116.