Almost Sure Convergence of Kernel Bivariate Distribution Function Estimator under Negative Association
author
Abstract:
Let {Xn ,n=>1} be a strictly stationary sequence of negatively associated random variables, with common distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1, Xk+1) for fixed $K /in N$ based on kernel type estimators. We introduce asymptotic normality and properties and moments. From these we derive the optimal bandwidth convergence rate, which is of order n-1. Besides of some usual conditions on the kernel function, the conditions typically impose a convenient increase rate on the covariances cov(X1,Xn).
similar resources
Almost sure convergence of the Bartlett estimator
We study the almost sure convergence of the Bartlett estimator for the asymptotic variance of the sample mean of a stationary weekly dependent process. We also study the a. s. behavior of this estimator in the case of long-range dependent observations. In the weakly dependent case, we establish conditions under which the estimator is strongly consistent. We also show that, after appropriate nor...
full textAlmost sure convergence of Titterington’s recursive estimator for mixture models
Titterington proposed a recursive parameter estimation algorithm for finite mixture models. However, due to the well known problem of singularities and multiple maximum, minimum and saddle points that are possible on the likelihood surfaces, convergence analysis has seldom been made in the past years. In this paper, under mild conditions, we show the global convergence of Titterington’s recursi...
full textJakimovski Methods and Almost-Sure Convergence
The classical summability methods of Borel (B) and Euler (E(λ), λ > 0) play an important role in many areas of mathematics. For instance, in summability theory they are perhaps the most important methods other than the Cesàro (Cα) and Abel (A) methods, and two chapters of the classic book of Hardy (1949) are devoted to them. In probability, the distinction between methods of Cesàro-Abel and Eul...
full textAlmost Sure Convergence for End Sequences and Its Application to M Estimator in Linear Models
In the paper, an almost sure convergence result for weighted sums of extended negatively dependent random variables is obtained. By using the almost sure convergence result, we further study the strong consistency of M estimator of the regression parameter in linear models based on extended negatively dependent random errors under some mild conditions. Mathematics subject classification (2010):...
full textAlmost sure convergence, convergence in probability and asymptotic normality
In the previous chapter we considered estimator of several different parameters. The hope is that as the sample size increases the estimator should get ‘closer’ to the parameter of interest. When we say closer we mean to converge. In the classical sense the sequence {xk} converges to x (xk → x), if |xk − x| → 0 as k → ∞ (or for every ε > 0, there exists an n where for all k > n, |xk − x| < ε). ...
full textProving Positive Almost Sure Termination Under Strategies
In last RTA, we introduced the notion of probabilistic rewrite systems and we gave some conditions entailing termination of those systems within a finite mean number of reduction steps. Termination was considered under arbitrary unrestricted policies. Policies correspond to strategies for non-probabilistic rewrite systems. This is often natural or more useful to restrict policies to a subclass....
full textMy Resources
Journal title
volume 6 issue 2
pages 243- 255
publication date 2010-03
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023