Minimum distance regression-type estimates with rates under weak dependence

Under weak dependence, a minimum distance estimate is obtained for a smooth function and its derivatives in a regression-type framework. The upper bound of the risk depends on the Kolmogorov entropy of the underlying space and the mixing coefficient. It is shown that the proposed estimates have the same rate of convergence, in the L 1-norm sense, as in the independent case

Kaplan–Meier Estimator under Association

AbstractConsider a long term study, where a series of possibly censored failure times is observed. Suppose the failure times have a common marginal distribution functionF, but they exhibit a mode of dependence characterized by positive or negative association. Under suitable regularity conditions, it is shown that the Kaplan–Meier estimatorFnofFis uniformly strongly consistent; rates for the convergence are also provided. Similar results are established for the empirical cumulative hazard rate function involved. Furthermore, a stochastic process generated byFnis shown to be weakly convergent to an appropriate Gaussian process. Finally, an estimator of the limiting variance of the Kaplan–Meier estimator is proposed and it is shown to be weakly convergent

An introduction to probability and statistical inference

"The text is wonderfully written and has the mostcomprehensive range of exercise problems that I have ever seen." - Tapas K. Das, University of South Florida"The exposition is great; a mixture between conversational tones and formal mathematics; the appropriate combination for a math text at [this] level. In my examination I could find no instance where I could improve the book." - H. Pat Goeters, Auburn, University, Alabama* Contains more than 200 illustrative examples discussed in detail, plus scores of numerical examples and applications* Chapters 1-8 can be used independently for an introductory course in probability* Provides a substantial number of proof