In this paper we define f − αβ-statistical convergence of order γ in probability and αβ-strong p-Ces`aro summability for a sequence random variables under unbounded modulus function examine the relation between these two concepts. We show by an example that notion is stronger than probability.

We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a probability distribution and that of the corresponding distribution function are discussed. It is carried out through attempts to effectivize some classical fundamental theorems concerning probability distributions. We th...

The estimation of probability density functions (PDF) using approximate maps is a fundamental building block in computational probability. We consider forward problems uncertainty quantification: the inputs or parameters deterministic model are random with known distribution. scalar quantity interest fixed measurable function parameters, and therefore variable as well. Often, map not explicitly...