相关论文: The stochastic order of probability measures on or…
Weak values are usually associated with weak measurements of an observable on a pre- and post-selected ensemble. We show that more generally, weak values are proportional to the correlation between two pointers in a successive measurement.…
We introduce and study a natural notion of probabilistic 1-Lipschitz maps. We prove that the space of all probabilistic 1-Lipschitz maps defined on a probabilistic metric space G is also a probabilistic metric space. Moreover, when G is a…
We investigate the conditional distributions of two Banach space valued, jointly Gaussian random variables. In particular, we show that these conditional distributions are again Gaussian and that their means and covariances can be…
The random measures on the space of continuous functions are considered. Stationary random measures are described. The weak solutions of the stochastic equations are substituted by the strong measure-valued solutions.
The phenomenon of concentration of measure on high dimensional structures is usually stated in terms of a metric space with a Borel measure, also called an mm-space. We extend some of the mm-space concepts to the setting of a quasi-metric…
The basic tool for solving problems in metric geometry and isotonic regression is the metric projection onto closed convex cones. Isotonicity of these projections with respect to a given order relation can facilitate finding the solutions…
Probability metrics constitute an important tool in probability theory and statistics \cite{DKS91}, \cite{R91}, \cite{Z83} as they are specific metrics on spaces of random variables which, by satisfying an extra condition, concord well with…
This paper provides conditions on the observation probability distribution in Bayesian localization and optimal filtering so that the conditional mean estimate satisfies convex stochastic dominance. Convex dominance allows us to compare the…
We provide a formal definition and study the basic properties of partially ordered chains (POC). These systems were proposed to model textures in image processing and to represent independence relations between random variables in…
Convex combinations of i.i.d. random variables without a finite mean can behave in a strikingly different way from the finite-mean case: as the weight vector becomes more balanced, the resulting combination may become stochastically larger,…
Several methods are available in the literature to stochastically compare random variables and random vectors. We introduce the notion of asymptotic stochastic order for random processes and define four such orders. Various properties and…
Constrained quantization for a Borel probability measure refers to the idea of estimating a given probability by a discrete probability with a finite number of supporting points lying on a specific set. The specific set is known as the…
WWe define the notion of a random metric space and prove that with probability one such a space is isometricto the Urysohn universal metric space. The main technique is the study of universal and random distance matrices; we relate the…
Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of…
The classical approach to system identification is based on stochastic assumptions about the measurement error, and provides estimates that have random nature. Worst-case identification, on the other hand, only assumes the knowledge of…
Stochastic dominance is a crucial tool for the analysis of choice under risk. It is typically analyzed as a property of two gambles that are taken in isolation. We study how additional independent sources of risk (e.g. uninsurable labor…
We introduce a new type of norm for ordered vector spaces majorized by a proper (convex) cone that generalizes the notions of order unit norm and base norm. Then we give sufficient conditions to ensure its completeness. In the case of…
Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…
Information theory is built on probability measures and by definition a probability measure has total mass 1. Probability measures are used to model uncertainty, and one may ask how important it is that the total mass is one. We claim that…
This paper aims to study a new stochastic order based upon discrete Laplace transforms. By this order, in a setup where the sample size is random, having discrete delta and nabla distributions, we obtain some ordering results involving…