网络非对称链路带宽的测量

研究了数据分组在IP网络中传输时RTT时延的组成,给出了RTT时延与分组长度的线性表达式。分析了传统利用UDP测量分组RTT时延与测量分组长度的线性关系进行链路带宽测量的算法,针对该测量算法不能对非对称链路带宽进行测量的缺陷,提出了一种新的非对称链路带宽测量算法Asy_pathchar。同时使UDP报文和ICMP报文作为测量报文,Asy_pathchar能够对测量分组所经过的每一跳非对称链路的带宽进行测量,实验结果验证了算法的正确性。     

一种基于分组对的分层组播拥塞控制机制

分析了现有分层组播拥塞控制协议的基本原理,提出了一种基于分组对推测网络可用带宽的分层组播拥塞控制机制PLMCC。其中间节点和接收者利用逐级向下的分组对来推测本地可用带宽,实现对本地可用带宽的准确、快速推测。接收者只需向其父节点发送反馈报文,就可以在最短的时间内获得其允许的最佳接收速率。仿真试验证明,PLMCC不仅具有快速的收敛速度,同时具有良好的协议间公平性和可伸缩性。     

An iterative plug-in algorithm for decomposing seasonal time series using the Berlin Method

We propose a fast data-driven procedure for decomposing seasonal time series using the Berlin Method, the procedure used, e.g. by the German Federal Statistical Office in this context. The formula of the asymptotic optimal bandwidth h _A is obtained. Methods for estimating the unknowns in h _A are proposed. The algorithm is developed by adapting the well-known iterative plug-in idea to time series decomposition. Asymptotic behaviour of the proposal is investigated. Some computational aspects are discussed in detail. Data examples show that the proposal works very well in practice and that data-driven bandwidth selection offers new possibilities to improve the Berlin Method. Deep insights into the iterative plug-in rule are also provided.     

Asymptotic theory for local estimators based on Bregman divergence

This article is concerned with asymptotic theory for local estimators based on Bregman divergence. We consider a localized version of Bregman divergence induced by a kernel weight and minimize it to obtain the local estimator. We provide a rigorous proof for the asymptotic consistency of the local estimator in a situation where both the sample size and the bandwidth involved in the kernel weight increase. Asymptotic normality of the local estimator is also developed under the same asymptotic scenario. Monte Carlo simulations are also performed to confirm the theoretical results. The Canadian Journal of Statistics 47: 628–652; 2019 © 2019 Statistical Society of Canada     

The Dantzig Selector in Cox's Proportional Hazards Model

Abstract. The Dantzig selector (DS) is a recent approach of estimation in high‐dimensional linear regression models with a large number of explanatory variables and a relatively small number of observations. As in the least absolute shrinkage and selection operator (LASSO), this approach sets certain regression coefficients exactly to zero, thus performing variable selection. However, such a framework, contrary to the LASSO, has never been used in regression models for survival data with censoring. A key motivation of this article is to study the estimation problem for Cox's proportional hazards (PH) function regression models using a framework that extends the theory, the computational advantages and the optimal asymptotic rate properties of the DS to the class of Cox's PH under appropriate sparsity scenarios. We perform a detailed simulation study to compare our approach with other methods and illustrate it on a well‐known microarray gene expression data set for predicting survival from gene expressions.     

Nonparametric Estimation of Volatility Function with Variable Bandwidth Parameter

In this article, we introduce a new method for the volatility function estimation of continuous-time diffusion process dX _t  = μ(X _t )dt + σ(X _t )dW _t , which is based on combining the idea of local linear smoother and variable bandwidth. We give the expressions for the conditional MSE and MISE of the estimator and obtain the optimal variable bandwidth. An explicit formula for the optimal variable bandwidth is presented by minimizing the MISE, which extends the related results in Fan and Gijbels (1992 Fan , J. Q. , Gijbels , I. ( 1992 ). Variable bandwidth and local linear regression smoother . Ann. Statist. 20 ( 4 ): 2008 – 2036 .[Crossref], [Web of Science ®] , [Google Scholar]), etc. Finally, some simulations show that the performance of the proposed estimator with optimal variable bandwidth is often much better than that of the local linear estimator with invariable bandwidth.     

L 1-estimation for varying coefficient models

The varying coefficient model is a useful extension of linear models and has many advantages in practical use. To estimate the unknown functions in the model, the kernel type with local linear least-squares (L ₂) estimation methods has been proposed by several authors. When the data contain outliers or come from population with heavy-tailed distributions, L ₁-estimation should yield better estimators. In this article, we present the local linear L ₁-estimation method and derive the asymptotic distributions of the L ₁-estimators. The simulation results for two examples, with outliers and heavy-tailed distribution, respectively, show that the L ₁-estimators outperform the L ₂-estimators.     

Multistage plug—in bandwidth selection for kernel distribution function estimates

The use of a kernel estimator as a smooth estimator for a distribution function has been suggested by many authors An expression for the bandwidth that minimizes the mean integrated square error asymptotically has been available for some time. However, few practical data based methods ior estimating this bandwidth have been investigated. In this paper we propose multisstage plug-in type estimater for this optimal bandwith and derive its asymptotic properties. In particular we show that two stages are required for good asymptotic properties. This behavior is verified for finite samples using a simulation study.     

Symmetric maximum kernel likelihood estimation

We introduce an estimator for the population mean based on maximizing likelihoods formed from a symmetric kernel density estimate. Due to these origins, we have dubbed the estimator the symmetric maximum kernel likelihood estimate (smkle). A speedy computational method to compute the smkle based on binning is implemented in a simulation study which shows that the smkle at an optimal bandwidth is decidedly superior in terms of efficiency to the sample mean and other measures of location for heavy-tailed symmetric distributions. An empirical rule and a computational method to estimate this optimal bandwidth are developed and used to construct bootstrap confidence intervals for the population mean. We show that the intervals have approximately nominal coverage and have significantly smaller average width than the corresponding intervals for other measures of location.     

Gains from joint cross validation bandwidth selection for derivatives of conditional multidimensional densities

This paper studies bandwidth selection for kernel estimation of derivatives of multidimensional conditional densities, a non-parametric realm unexplored in the literature. This paper extends Baird [Cross validation bandwidth selection for derivatives of multidimensional densities. RAND Working Paper series, WR-1060; 2014] in its examination of conditional multivariate densities, derives and presents criteria for arbitrary kernel order and density dimension, shows consistency of the estimators, and investigates a minimization criterion which jointly estimates numerator and denominator bandwidths. I conduct a Monte Carlo simulation study for various orders of kernels in the Gaussian family and compare the new cross validation criterion with those implied by Baird [Cross validation bandwidth selection for derivatives of multidimensional densities. RAND Working Paper series, WR-1060; 2014]. The paper finds that higher order kernels become increasingly important as the dimension of the distribution increases. I find that the cross validation criterion developed in this paper that jointly estimates the derivative of the joint density (numerator) and the marginal density (denominator) does orders of magnitude better than criteria that estimate the bandwidths separately. I further find that using the infinite order Dirichlet kernel tends to have the best results.