Displaying 41 – 60 of 120

Showing per page

Equivalent or absolutely continuous probability measures with given marginals

Patrizia Berti, Luca Pratelli, Pietro Rigo, Fabio Spizzichino (2015)

Dependence Modeling

Let (X,A) and (Y,B) be measurable spaces. Supposewe are given a probability α on A, a probability β on B and a probability μ on the product σ-field A ⊗ B. Is there a probability ν on A⊗B, with marginals α and β, such that ν ≪ μ or ν ~ μ ? Such a ν, provided it exists, may be useful with regard to equivalent martingale measures and mass transportation. Various conditions for the existence of ν are provided, distinguishing ν ≪ μ from ν ~ μ.

Implicit Markov kernels in probability theory

Daniel Hlubinka (2002)

Commentationes Mathematicae Universitatis Carolinae

Having Polish spaces 𝕏 , 𝕐 and we shall discuss the existence of an 𝕏 × 𝕐 -valued random vector ( ξ , η ) such that its conditional distributions K x = ( η ξ = x ) satisfy e ( x , K x ) = c ( x ) or e ( x , K x ) C ( x ) for some maps e : 𝕏 × 1 ( 𝕐 ) , c : 𝕏 or multifunction C : 𝕏 2 respectively. The problem is equivalent to the existence of universally measurable Markov kernel K : 𝕏 1 ( 𝕐 ) defined implicitly by e ( x , K x ) = c ( x ) or e ( x , K x ) C ( x ) respectively. In the paper we shall provide sufficient conditions for the existence of the desired Markov kernel. We shall discuss some special solutions of the ( e , c ) - or ( e , C ) -problem and illustrate...

Kolmogorov complexity and probability measures

Jan Šindelář, Pavel Boček (2002)

Kybernetika

Classes of strings (infinite sequences resp.) with a specific flow of Kolmogorov complexity are introduced. Namely, lower bounds of Kolmogorov complexity are prescribed to strings (initial segments of infinite sequences resp.) of specified lengths. Dependence of probabilities of the classes on lower bounds of Kolmogorov complexity is the main theme of the paper. Conditions are found under which the probabilities of the classes of the strings are close to one. Similarly, conditions are derived under...

Kolmogorov complexity, pseudorandom generators and statistical models testing

Jan Šindelář, Pavel Boček (2002)

Kybernetika

An attempt to formalize heuristic concepts like strings (sequences resp.) “typical” for a probability measure is stated in the paper. Both generating and testing of such strings is considered. Kolmogorov complexity theory is used as a tool. Classes of strings “typical” for a given probability measure are introduced. It is shown that no pseudorandom generator can produce long strings from the classes. The time complexity of pseudorandom generators with oracles capable to recognize “typical” strings...

Limit shapes of Gibbs distributions on the set of integer partitions : the expansive case

Michael M. Erlihson, Boris L. Granovsky (2008)

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

We find limit shapes for a family of multiplicative measures on the set of partitions, induced by exponential generating functions with expansive parameters, ak∼Ckp−1, k→∞, p>0, where C is a positive constant. The measures considered are associated with the generalized Maxwell–Boltzmann models in statistical mechanics, reversible coagulation–fragmentation processes and combinatorial structures, known as assemblies. We prove a central limit theorem for fluctuations of a properly scaled partition...

Łukasiewicz tribes are absolutely sequentially closed bold algebras

Roman Frič (2002)

Czechoslovak Mathematical Journal

We show that each sequentially continuous (with respect to the pointwise convergence) normed measure on a bold algebra of fuzzy sets (Archimedean M V -algebra) can be uniquely extended to a sequentially continuous measure on the generated Łukasiewicz tribe and, in a natural way, the extension is maximal. We prove that for normed measures on Łukasiewicz tribes monotone (sequential) continuity implies sequential continuity, hence the assumption of sequential continuity is not restrictive. This yields...

Currently displaying 41 – 60 of 120