Page 1 Next

Displaying 1 – 20 of 301

Showing per page

A nonstandard modification of Dempster combination rule

Ivan Kramosil (2002)


It is a well-known fact that the Dempster combination rule for combination of uncertainty degrees coming from two or more sources is legitimate only if the combined empirical data, charged with uncertainty and taken as random variables, are statistically (stochastically) independent. We shall prove, however, that for a particular but large enough class of probability measures, an analogy of Dempster combination rule, preserving its extensional character but using some nonstandard and boolean-like...

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

Jiřina Vejnarová (1998)


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 probabilistic ergodic decomposition result

Albert Raugi (2009)

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

Let ( X , 𝔛 , μ ) be a standard probability space. We say that a sub-σ-algebra 𝔅 of 𝔛 decomposes μ in an ergodic way if any regular conditional probability 𝔅 P with respect to 𝔅 andμ satisfies, for μ-almost every x∈X, B 𝔅 , 𝔅 P ( x , B ) { 0 , 1 } . In this case the equality μ ( · ) = X 𝔅 P ( x , · ) μ ( d x ) , gives us an integral decomposition in “ 𝔅 -ergodic” components. For any sub-σ-algebra 𝔅 of 𝔛 , we denote by 𝔅 ¯ the smallest sub-σ-algebra of 𝔛 containing 𝔅 and the collection of all setsAin 𝔛 satisfyingμ(A)=0. We say that 𝔅 isμ-complete if 𝔅 = 𝔅 ¯ . Let { 𝔅 i i I } be a non-empty family...

Currently displaying 1 – 20 of 301

Page 1 Next