Related papers: Almost everywhere continuity of conditional expect…

We consider Arveson's problem on the maximality of subdiagonal algebras. We prove that a subdiagonal algebra is maximal if it is invariant under the modular group of a faithful normal state which is preserved by the conditional expectation…

Let $S$ be a Polish space and $(X_n:n\geq1)$ an exchangeable sequence of $S$-valued random variables. Let $\alpha_n(\cdot)=P(X_{n+1}\in \cdot\mid X_1,\...,X_n)$ be the predictive measure and $\alpha$ a random probability measure on $S$ such…

The standard conditional probability definition formula is derived as a consequence of the Insufficient Reason Principle expressed as the Maximum Relative Divergence Principle for grading (order-comonotonic) functions on a totally ordered…

A predictive distribution over a sequence of $N+1$ events is said to be "frequency mimicking" whenever the probability for the final event conditioned on the outcome of the first $N$ events equals the relative frequency of successes among…

This paper presents an investigation on the structure of conditional events and on the probability measures which arise naturally in this context. In particular we introduce a construction which defines a (finite) {\em Boolean algebra of…

Let $\Lambda$ be a complete metric space, and let $\{S_\lambda(\cdot):\ \lambda\in\Lambda\}$ be a parametrised family of semigroups with global attractors ${\mathscr A}_\lambda$. We assume that there exists a fixed bounded set $D$ such that…

A necessary and sufficient condition for fractional Orlicz-Sobolev spaces to be continuously embedded into $L^\infty(\mathbb R^n)$ is exhibited. Under the same assumption, any function from the relevant fractional-order spaces is shown to…

We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We…

Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…

We establish an approximate zero-one law for sentences of continuous logic over finite metric spaces of diameter at most $1$. More precisely, we axiomatize a complete metric theory $T_{\mathrm{as}}$ such that, given any sentence $\sigma$ in…

We prove that if (X,\mathfrakA,P) is an arbitrary probability space with countably generated \sigma-algebra \mathfrakA, (Y,\mathfrakB,Q) is an arbitrary complete probability space with a lifting \rho and \hat R is a complete probability…

Many practical problems need the output of a machine learning model to satisfy a set of constraints, $K$. Nevertheless, there is no known guarantee that classical neural network architectures can exactly encode constraints while…

The classical theorem of Birkhoff states that the $T^N f(x) = (1/N)\sum_{k=0}^{N-1} f(\sigma^k x)$ converges almost everywhere for $x\in X$ and $f\in L^{1}(X)$, where $\sigma$ is a measure preserving transformation of a probability measure…

By well known results of probability theory, any sequence of random variables with bounded second moments has a subsequence satisfying the central limit theorem and the law of the iterated logarithm in a randomized form. In this paper we…

A sequence $x_1,\dots,x_n,\dots$ of discrete-valued observations is generated according to some unknown probabilistic law (measure) $\mu$. After observing each outcome, one is required to give conditional probabilities of the next…

We generalize McDiarmid's inequality for functions with bounded differences on a high probability set, using an extension argument. Those functions concentrate around their conditional expectations. We further extend the results to…

We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…

In this paper, we associate, to any submartingale of class $(\Sigma)$, defined on a filtered probability space $(\Omega, \mathcal{F}, \mathbb{P}, (\mathcal{F}_t)_{t \geq 0})$, which satisfies some technical conditions, a $\sigma$-finite…

We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma$ and a first order theory $T$ for $\sigma$ composed of symmetry and…

It is proved that every normalized weakly null \sq\ has a sub\sq\ which is convexly unconditional. Further, an Hierarchy of summability methods is introduced and with this we give a complete classification of the complexity of weakly null…