Results 61 to 70 of about 2,896,920 (185)

Weighting order and disorder on complexity measures

Journal of Taibah University for Science, 2017
The initial ideas regarding measuring complexity appeared in computer science, with the concept of computational algorithms. As a consequence, the equivalence between algorithm complexity and informational entropy was shown.
José Roberto C. Piqueira
doaj   +1 more source

Partitioning General Probability Measures

The Annals of Probability, 1987
Consider n probability measures \(\mu_ 1,...,\mu_ n\) on the same measurable space. It is the aim to split the whole sample set \(\Omega\) into n measurable parts \(A_ 1,...,A_ n\) such that \(A_ j\) has nearly the same probability for each distribution. Here the author considers the case when the atoms have not too large mass.
openaire   +3 more sources

Constrained Quantization for Probability Distributions

Mathematics
In this work, we extend the classical framework of quantization for Borel probability measures defined on normed spaces Rk by introducing and analyzing the notions of the nth constrained quantization error, constrained quantization dimension, and ...
Megha Pandey, Mrinal Kanti Roychowdhury
doaj   +1 more source

Mixing and double recurrence in probability groups

, 2017
We define a class of groups equipped with an invariant probability measure, which includes all compact groups and is closed under taking ultraproducts with the induced Loeb measure. We call these probability groups and develop the basics of the theory of
Tserunyan, Anush
core  

Rational probability measures

, 2011
In this paper we introduce the concept of rational probability measures. These are probabilitymeasures that map every Borel event to a rational number. We show that a rational probabilitymeasure has a finite support. As a consequence we prove a new version of Kolmogorov extensiontheorem.
openaire   +2 more sources

Probability measure monad on the category of ultrametric spaces

Applied General Topology, 2008
The set of all probability measures with compact support on an ultrametric space can be endowed with a natural ultrametric. We show that the functor of probability measures with finite supports (respectively compact supports) forms a monad in the ...
O.B. Hubal, M.M. Zarichnyi
doaj   +1 more source

Agreeing Probability Measures for Comparative Probability Structures

The Annals of Statistics, 1981
It is proved that fine and tight comparative probability structures (where the set of events is assumed to be an algebra, not necessarily a a-algebra) have agreeing probability measures. Although this was often claimed in the literature, all proofs the author encountered are not valid for the general case, but only for a-algebras.
openaire   +3 more sources

Nonhomogeneous distributions and optimal quantizers for Sierpi\'nski carpets

, 2016
The purpose of quantization of a probability distribution is to estimate the probability by a discrete probability with finite support. In this paper, a nonhomogeneous probability measure $P$ on $\mathbb R^2$ which has support the Sierpi\'nski carpet ...
Roychowdhury, Mrinal Kanti
core  

Conditional Optimal Sets and the Quantization Coefficients for Some Uniform Distributions

Mathematics
Bucklew and Wise (1982) showed that the quantization dimension of an absolutely continuous probability measure on a given Euclidean space is constant and equals the Euclidean dimension of the space, and the quantization coefficient exists as a finite ...
Evans Nyanney, Megha Pandey, Mrinal Kanti Roychowdhury   +2 more
doaj   +1 more source

Foundations of Inference

Axioms, 2012
We present a simple and clear foundation for finite inference that unites and significantly extends the approaches of Kolmogorov and Cox. Our approach is based on quantifying lattices of logical statements in a way that satisfies general lattice ...
Kevin H. Knuth, John Skilling
doaj   +1 more source