Related papers: A Kolmogorov Consistency Theorem in the Multiple P…
In literature on imprecise probability little attention is paid to the fact that imprecise probabilities are precise on a set of events. We call these sets systems of precision. We show that, under mild assumptions, the system of precision…
Let $E$ be a space of observables in a sequence of trials $\xi_n$ and define $m_n$ to be the empirical distributions of the outcomes. We discuss the almost sure convergence of the sequence $m_n$ in terms of the $\psi$-weak topology of…
The quantum probabilistic convergence in measurement, distinct from mathematical convergence, is derived for indeterminate probabilities from the weak quantum law of large numbers. This is presented in three theorems. The first establishes…
Separability conditions for a bipartite quantum system of finite-dimensional subsystems are formulated in terms of R\'{e}nyi and Tsallis entropies. Entropic uncertainty relations often lead to entanglement criteria. We propose new approach…
Conditional specification of distributions is a developing area with many applications. In the finite discrete case, a variety of compatible conditions can be derived. In this paper, we propose an alternative approach to study the…
We show that if a real $x$ is strongly Hausdorff $h$-random, where $h$ is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure $\mu$ such that the $\mu$-measure of the basic open…
The technique of degree of randomness is used to model the correlations in sequences containing various subsignals and noise. Kolmogorov stochasticity parameter enables to quantify the randomness in number sequences and hence appears as an…
We establish connections between the requirement of measurability of a probability space and the principle of complimentarity in quantum mechanics. It is shown that measurability of a probability space implies the dependence of results of…
Consider $n$ iid random variables, where $\xi_1, \ldots, \xi_n$ are $n$ realisations of a random variable $\xi$ and $\zeta_1, \ldots, \zeta_n$ are $n$ realisations of a random variable $\zeta$. The distribution of each realisation of $\xi$,…
While probability theory is normally applied to external environments, there has been some recent interest in probabilistic modeling of the outputs of computations that are too expensive to run. Since mathematical logic is a powerful tool…
We endow the set of persistence diagrams with the strong topology (the topology of countable direct limit of increasing sequence of bounded subsets considered in the bottleneck distance). The topology of the obtained space is described.…
For control systems in discrete time, this paper discusses measure-theoretic invariance entropy for a subset Q of the state space with respect to a quasi-stationary measure obtained by endowing the control range with a probability measure.…
The stability problem of a class of nonlinear switched systems defined on compact sets with state-dependent switching is considered. Instead of the Caratheodory solutions, the general Filippov solutions are studied. This encapsulates…
We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…
Within the Kolmogorov theory of probability, Bayes' rule allows one to perform statistical inference by relating conditional probabilities to unconditional probabilities. As we show here, however, there is a continuous set of alternative…
The Kolmogorov-Sinai (K-S) entropy is a central measure of complexity and chaos. Its calculation for many-body systems is an interesting and important challenge. In this paper, the evaluation is formulated by considering $N$-dimensional…
Let $X$ be a Bernoulli random variable with the success probability $p$. We are interested in tight bounds on $\mathbb{E}[f(X_1,X_2)]$, where $X_i=\mathbb{E}[X| \mathcal{F}_i]$ and $\mathcal{F}_i$ are some sigma-algebras. This problem is…
We introduce a general framework for analysing general probabilistic theories, which emphasises the distinction between the dynamical and probabilistic structures of a system. The dynamical structure is the set of pure states together with…
In 1974 Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let data be finite binary strings and models be finite sets of binary strings. Consider model classes consisting of models of given maximal…
The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discrete universal distribution. There are conditional versions referred to in several publications but as yet there exist no written proofs in…