Related papers: Scott functions, their representations on domains,…
Introduced is the notion of minimality for spectral representations of sum- and max-infinitely divisible processes and it is shown that the minimal spectral representation on a Borel space exists and is unique. This fact is used to show…
Domain theory has a long history of applications in theoretical computer science and mathematics. In this article, we explore the relation of domain theory to probability theory and stochastic processes. The goal is to establish a theory in…
We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…
This paper generalizes the notion of stochastic order to a relation between probability measures over arbitrary measurable spaces. This generalization is motivated by the observation that for the stochastic ordering of two stationary Markov…
We show from a categorical point of view that probability measures on certain measurable or topological spaces arise canonically as the extension of probability distributions on countable sets. We do this by constructing probability monads…
In this article, the following results are obtained: the process of a randomly wandering particle having a size and a continuous trajectory of motion is considered; (b) based on the study of this probabilistic process, a derivation of the…
The Subspace Theorem due to Schmidt (1972) is a broad generalisation of Roth's Theorem in Diophantine Approximation (1955) which, in the same way as the latter, suffers a notorious lack of effectivity. This problem is tackled from a…
One of the main research areas in Bayesian Nonparametrics is the proposal and study of priors which generalize the Dirichlet process. Here we exploit theoretical properties of Poisson random measures in order to provide a comprehensive…
The famous Prohorov theorem for Radon probability measures is generalized in terms of usco mappings. In the case of completely metrizable spaces this is achieved by applying a classical Michael result on the existence of usco selections for…
Given a submodular capacity space, we prove the uniform convergence in capacity and also the uniform convergence in the Choquet-mean of order $p\ge1$ with a quantitative estimate, of the multivariate Bernstein polynomials associated to a…
Seifert derived an exact fluctuation relation for diffusion processes using the concept of "stochastic system entropy". In this note we extend his formalism to entropic transport. We introduce the notion of relative stochastic entropy, or…
We present a novel, yet rather simple construction within the traditional framework of Scott domains to provide semantics to probabilistic programming, thus obtaining a solution to a long-standing open problem in this area. Unlike current…
We establish a dilation-theoretic characterization of the Choquet order on the space of measures on a compact convex set using ideas from the theory of operator algebras. This yields an extension of Cartier's dilation theorem to the…
Scott continuity is a concept from domain theory that had an unexpected previous life in the theory of von Neumann algebras. Scott-continuous states are known as normal states, and normal states are exactly the states coming from density…
The aim of this paper is to present some properties of Choquet maximal Radon probability measures on compact, convex subsets of Hausdorff, locally convex, topological real vector spaces. Theorem 3.12 is the main result of the paper. While…
Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…
Stochastic approximation algorithms are iterative procedures which are used to approximate a target value in an environment where the target is unknown and direct observations are corrupted by noise. These algorithms are useful, for…
There are considered some corollaries of certain hypotheses on the observation process of microphenomena. We show that an enlargement of the phase space and of its motion group and an account for the diffusion motions of microsystems in the…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using It\^o's formula and on a new…
Within the last fifteen years, a program of establishing relationships between algorithmic randomness and almost-everywhere theorems in analysis and ergodic theory has developed. In harmonic analysis, Franklin, McNicholl, and Rute…