Displaying 141 – 160 of 654

Showing per page

On estimation of intrinsic volume densities of stationary random closed sets via parallel sets in the plane

Tomáš Mrkvička, Jan Rataj (2009)

Kybernetika

A method of estimation of intrinsic volume densities for stationary random closed sets in d 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...

On estimation of parameters in the bivariate linear errors-in-variables model

Anna Czapkiewicz (1999)

Applicationes Mathematicae

We discuss some methods of estimation in bivariate errors-in-variables linear models. We also suggest a method of constructing consistent estimators in the case when the error disturbances have the normal distribution with unknown parameters. It is based on the theory of estimating variance components in linear models. A simulation study is presented which compares this estimator with the maximum likelihood one.

On extremal dependence of block vectors

Helena Ferreira, Marta Ferreira (2012)

Kybernetika

Due to globalization and relaxed market regulation, we have assisted to an increasing of extremal dependence in international markets. As a consequence, several measures of tail dependence have been stated in literature in recent years, based on multivariate extreme-value theory. In this paper we present a tail dependence function and an extremal coefficient of dependence between two random vectors that extend existing ones. We shall see that in weakening the usual required dependence allows to...

On factorization of probability distributions over directed graphs

František Matúš, Bernhard Strohmeier (1998)

Kybernetika

Four notions of factorizability over arbitrary directed graphs are examined. For acyclic graphs they coincide and are identical with the usual factorization of probability distributions in Markov models. Relations between the factorizations over circuits are described in detail including nontrivial counterexamples. Restrictions on the cardinality of state spaces cause that a factorizability with respect to some special cyclic graphs implies the factorizability with respect to their, more simple,...

On fine properties of mixtures with respect to concentration of measure and Sobolev type inequalities

Djalil Chafaï, Florent Malrieu (2010)

Annales de l'I.H.P. Probabilités et statistiques

Mixtures are convex combinations of laws. Despite this simple definition, a mixture can be far more subtle than its mixed components. For instance, mixing gaussian laws may produce a potential with multiple deep wells. We study in the present work fine properties of mixtures with respect to concentration of measure and Sobolev type functional inequalities. We provide sharp Laplace bounds for Lipschitz functions in the case of generic mixtures, involving a transportation cost diameter of the mixed...

Currently displaying 141 – 160 of 654