All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2 Next

Displaying 21 – 40 of 268

Showing per page

A note on the interval-valued marginal problem and its maximum entropy solution

Jiřina Vejnarová (1998)

Kybernetika

This contribution introduces the marginal problem, where marginals are not given precisely, but belong to some convex sets given by systems of intervals. Conditions, under which the maximum entropy solution of this problem can be obtained via classical methods using maximum entropy representatives of these convex sets, are presented. Two counterexamples illustrate the fact, that this property is not generally satisfied. Some ideas of an alternative approach are presented at the end of the paper.

A short note on multivariate dependence modeling

Vladislav Bína, Radim Jiroušek (2013)

Kybernetika

As said by Mareš and Mesiar, necessity of aggregation of complex real inputs appears almost in any field dealing with observed (measured) real quantities (see the citation below). For aggregation of probability distributions Sklar designed his copulas as early as in 1959. But surprisingly, since that time only a very few literature have appeared dealing with possibility to aggregate several different pairwise dependencies into one multivariate copula. In the present paper this problem is tackled...

Average convergence rate of the first return time

Geon Choe, Dong Kim (2000)

Colloquium Mathematicae

The convergence rate of the expectation of the logarithm of the first return time R n , after being properly normalized, is investigated for ergodic Markov chains. I. Kontoyiannis showed that for any β > 0 we have l o g [ R n ( x ) P n ( x ) ] = o ( n β ) a.s. for aperiodic cases and A. J. Wyner proved that for any ε >0 we have - ( 1 + ε ) l o g n ≤ l o g [ R n ( x ) P n ( x ) ] ≤ l o g l o g n eventually, a.s., where P n ( x ) is the probability of the initial n-block in x. In this paper we prove that E [ l o g R ( L , S ) - ( L - 1 ) h ] converges to a constant depending only on the process where R ( L , S ) is the modified first return time with...

Binomial-Poisson entropic inequalities and the M/M/∞ queue

Djalil Chafaï (2006)

ESAIM: Probability and Statistics

This article provides entropic inequalities for binomial-Poisson distributions, derived from the two point space. They appear as local inequalities of the M/M/∞ queue. They describe in particular the exponential dissipation of Φ-entropies along this process. This simple queueing process appears as a model of “constant curvature”, and plays for the simple Poisson process the role played by the Ornstein-Uhlenbeck process for Brownian Motion. Some of the inequalities are recovered by semi-group ...

Bound on extended f -divergences for a variety of classes

Pietro Cerone, Sever Silvestru Dragomir, Ferdinand Österreicher (2004)

Kybernetika

The concept of f -divergences was introduced by Csiszár in 1963 as measures of the ‘hardness’ of a testing problem depending on a convex real valued function f on the interval [ 0 , ∞ ) . The choice of this parameter f can be adjusted so as to match the needs for specific applications. The definition and some of the most basic properties of f -divergences are given and the class of χ α -divergences is presented. Ostrowski’s inequality and a Trapezoid inequality are utilized in order to prove bounds for an extension...

Bounds for f -divergences under likelihood ratio constraints

Sever Silvestru Dragomir (2003)

Applications of Mathematics

In this paper we establish an upper and a lower bound for the f -divergence of two discrete random variables under likelihood ratio constraints in terms of the Kullback-Leibler distance. Some particular cases for Hellinger and triangular discimination, χ 2 -distance and Rényi’s divergences, etc. are also considered.

Currently displaying 21 – 40 of 268