A kernel estimator of the squared -norm of the intensity function of a Poisson random field is defined. It is proved that the estimator is asymptotically unbiased and strongly consistent. The problem of estimating the squared -norm of a function disturbed by a Wiener random field is also considered.
We study the impact of certain transformations within the class of Archimedean copulas. We give some admissibility conditions for these transformations, and define some equivalence classes for both transformations and generators of Archimedean copulas. We extend the r-fold composition of the diagonal section of a copula, from r ∈ N to r ∈ R. This extension, coupled with results on equivalence classes, gives us new expressions of transformations and generators. Estimators deriving directly from these...
Continuous convergence and epi-convergence of sequences of random functions are crucial assumptions if mathematical programming problems are approximated on the basis of estimates or via sampling. The paper investigates “almost surely” and “in probability” versions of these convergence notions in more detail. Part I of the paper presents definitions and theoretical results and Part II is focused on sufficient conditions which apply to many models for statistical estimation and stochastic optimization....
Part II of the paper aims at providing conditions which may serve as a bridge between existing stability assertions and asymptotic results in probability theory and statistics. Special emphasis is put on functions that are expectations with respect to random probability measures. Discontinuous integrands are also taken into account. The results are illustrated applying them to functions that represent probabilities.
The notion of the counting process is recalled and the idea of the ‘cumulative’ process is presented. While the counting process describes the sequence of events, by the cumulative process we understand a stochastic process which cumulates random increments at random moments. It is described by an intensity of the random (counting) process of these moments and by a distribution of increments. We derive the martingale – compensator decomposition of the process and then we study the estimator of the...
In this paper, we analyze the celebrated EM algorithm from the point of view of proximal point algorithms. More precisely, we study a new type of generalization of the EM procedure introduced in [Chretien and Hero (1998)] and called Kullback-proximal algorithms. The proximal framework allows us to prove new results concerning the cluster points. An essential contribution is a detailed analysis of the case where some cluster points lie on the boundary of the parameter space.
A method of estimation of intrinsic volume densities for stationary random closed sets in based on estimating volumes of tiny collars has been introduced in T. Mrkvička and J. Rataj, On estimation of intrinsic volume densities of stationary random closed sets, Stoch. Proc. Appl. 118 (2008), 2, 213-231. In this note, a stronger asymptotic consistency is proved in dimension 2. The implementation of the method is discussed in detail. An important step is the determination of dilation radii in the...
We want to recover a signal based on noisy inhomogeneous data (the amount of data can vary strongly on the estimation domain). We model the data using nonparametric regression with random design, and we focus on the estimation of the regression at a fixed point x0 with little, or much data. We propose a method which adapts both to the local amount of data (the design density is unknown) and to the local smoothness of the regression function. The procedure consists of a local polynomial...