Kernel Estimation of Rate Function for Recurrent Event Data

Abstract.  Recurrent event data are largely characterized by the rate function but smoothing techniques for estimating the rate function have never been rigorously developed or studied in statistical literature. This paper considers the moment and least squares methods for estimating the rate function from recurrent event data. With an independent censoring assumption on the recurrent event process, we study statistical properties of the proposed estimators and propose bootstrap procedures for the bandwidth selection and for the approximation of confidence intervals in the estimation of the occurrence rate function. It is identified that the moment method without resmoothing via a smaller bandwidth will produce a curve with nicks occurring at the censoring times, whereas there is no such problem with the least squares method. Furthermore, the asymptotic variance of the least squares estimator is shown to be smaller under regularity conditions. However, in the implementation of the bootstrap procedures, the moment method is computationally more efficient than the least squares method because the former approach uses condensed bootstrap data. The performance of the proposed procedures is studied through Monte Carlo simulations and an epidemiological example on intravenous drug users.     

Moderate Deviations for Bayes Posteriors

Let ( X_k ) k be a sequence of i.i.d. random variables taking values in a set , and consider the problem of estimating the law of X₁ in a Bayesian framework. We prove, under mild conditions on the prior, that the sequence of posterior distributions satisfies a moderate deviation principle.     

Statistical and Combinatorial Aspects of Comparative Genomics*

Abstract. This document presents a survey of the statistical and combinatorial aspects of four areas of comparative genomics: gene order based measures of evolutionary distances between species, construction of phylogenetic trees, detection of horizontal transfer of genes, and detection of ancient whole genome duplications.     

翻译:意识形态的建构、解构、重建与解读

翻译不仅是语言之间信息转换的文化活动,而且是一系列复杂的思维活动。意识形态以不同的语言形式隐藏在语篇之中,以各种隐蔽方式潜移默化地影响着作者写作、译者翻译以及读者解读文本。本文拟以批评语言学为主要方法论,强调翻译中语言分析和社会分析相结合的重要性,同时主张翻译研究应以语篇为单位,特别注意考察作者、译者、读者在翻译过程中的三元关系及其在意识形态的建构、解构、重建和解读过程中的作用,以便弄清翻译的本质并有效地解释那些"不忠"的现象。     

On a Dualization of Graphical Gaussian Models: A Correction Note

Abstract.  We correct two proofs concerning Markov properties for graphs representing marginal independence relations.     

成人依恋研究

依恋是人类适应生存的重要方式,是人类长期生物进化的结果,它会影响到成年后亲密关系的建立、人际社会功能的表达以及人格功能和人格特质的形成。目前成人依恋的研究大概可以分为两个方面:成人依恋的个体差异和成人依恋的检测维度。     

Goodness of fit for the inverse Gaussian distribution

For testing the fit of the inverse Gaussian distribution with unknown parameters, the empirical distribution-function statistic A² is studied. Two procedures are followed in constructing the test statistic; they yield the same asymptotic distribution. In the first procedure the parameters in the distribution function are directly estimated, and in the second the distribution function is estimated by its Rao-Blackwell distribution estimator. A table is given for the asymptotic critical points of A². These are shown to depend only on the ratio of the unknown parameters. An analysis is provided of the effect of estimating the ratio to enter the table for A². This analysis enables the proposal of the complete operating procedure, which is sustained by a Monte Carlo study.     

Improving Convergence of the HastingsMetropolis Algorithm with an Adaptive Proposal

The HastingsMetropolis algorithm is a general MCMC method for sampling from a density known up to a constant. Geometric convergence of this algorithm has been proved under conditions relative to the instrumental (or proposal) distribution. We present an inhomogeneous HastingsMetropolis algorithm for which the proposal density approximates the target density, as the number of iterations increases. The proposal density at the n th step is a non-parametric estimate of the density of the algorithm, and uses an increasing number of i.i.d. copies of the Markov chain. The resulting algorithm converges (in n ) geometrically faster than a HastingsMetropolis algorithm with any fixed proposal distribution. The case of a strictly positive density with compact support is presented first, then an extension to more general densities is given. We conclude by proposing a practical way of implementation for the algorithm, and illustrate it over simulated examples.     

Markov Properties for Acyclic Directed Mixed Graphs

We consider acyclic directed mixed graphs, in which directed edges ( x → y ) and bi-directed edges ( x ↔ y ) may occur. A simple extension of Pearl's d -separation criterion, called m -separation, is applied to these graphs. We introduce a local Markov property which is equivalent to the global property resulting from the m -separation criterion for arbitrary distributions.     

Conditional Likelihood Estimators for Hidden Markov Models and Stochastic Volatility Models

ABSTRACT.  This paper develops a new contrast process for parametric inference of general hidden Markov models, when the hidden chain has a non-compact state space. This contrast is based on the conditional likelihood approach, often used for ARCH-type models. We prove the strong consistency of the conditional likelihood estimators under appropriate conditions. The method is applied to the Kalman filter (for which this contrast and the exact likelihood lead to asymptotically equivalent estimators) and to the discretely observed stochastic volatility models.