Related papers: A Variant of Probabilistic Topology

We introduce the concept of numeraires of convex sets in the nonnegative orthant of the topological vector space of all random variables built over a probability space. A necessary and sufficient condition for an element of a convex set to…

We study here the topology of information on the space of probability measures over Polish spaces that was defined in [1]. We show that under this topology, a convergent sequence of probability measures satisfying a conditional independence…

The commuting probability of a finite group is defined to be the probability that two randomly chosen group elements commute. Let P \subset (0,1] be the set of commuting probabilities of all finite groups. We prove that every point of P is…

Let X be a topological space. The closure of \Delta = {(x, x) : x \in X} in X \times X is a symmetric relation on X. We characterise those equivalence relations on an infinite set that arise as the closure of the diagonal with respect to a…

In this paper ideas of different types of convergence of a sequence of random variables in probability, namely, statistical convergence of order $\alpha$ in probability, strong $p$-Ces$\grave{\mbox{a}}$ro summability of order $\alpha$ in…

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

In this paper we present a variant of the well known Skorokhod Representation Theorem. In our main result, given $S$ a Polish space, to a given continous path $\alpha$ in the space of probability measures on $S$, we associate a continuous…

We observe a subtle and apparently generally unnoticed difficulty with the definition of the relative topology on a subset of a topological space, and with the weak topology defined by a function.

Let $p$ be a fixed prime. We estimate the number of elements of a set $A \subseteq \mathbb{F}^*_p$ for which $$ s_1s_2 \equiv a \pmod{p} \quad \mbox{for some}\quad a \in [-X,X] \quad \mbox{for all}\quad s_1,s_2 \in A. $$ We also consider…

The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are…

The notion of topological entropy can be conceptualized in terms of the number of forward trajectories that are distinguishable at resolution $\varepsilon$ within $T$ time units. It can then be formally defined as a limit of a limit…

We look at the topology of the tiling space of locally random Fibonacci substitution, which is defined as a-->ba with probability p, a-->ab with probability 1-p and b-->a for 0<p<1. We show that its Cech cohomology group is not finitely…

We introduce the concepts of max-closedness and numeraires of convex subsets in the nonnegative orthant of the topological vector space of all random variables built over a probability space, equipped with a topology consistent with…

The paper is devoted to a categorical study of the category of probabilistic metric spaces. The study is based on an isomorphic description of the category of probabilistic metric spaces. The isomorphic description was obtained in [3] and…

Let $X$ be the number of $k$-term arithmetic progressions contained in the $p$-biased random subset of the first $N$ positive integers. We give asymptotically sharp estimates on the logarithmic upper-tail probability $\log \Pr(X \ge E[X] +…

This book introduces to the theory of probabilities from the beginning. Assuming that the reader possesses the normal mathematical level acquired at the end of the secondary school, we aim to equip him with a solid basis in probability…

This note defines cones in homotopy probability theory and demonstrates that a cone over a space is a reasonable replacement for the space. The homotopy Gaussian distribution in one variable is revisited as a cone on the ordinary Gaussian.

For a sequence p=(p(1),p(2), ...) let G(n,p) denote the random graph with vertex set {1,2, ...,n} in which two vertices i, j are adjacent with probability p(|i-j|), independently for each pair. We study how the convergence of probabilities…

Theories of rough sets and soft sets are powerful mathematical tools for modelling various types of vagueness. Hybrid model combining a rough set with a soft set which is called soft rough set proposed by Feng et al. [3] in 2010. In this…

We explain the concept of p-values presupposing only rudimentary probability theory. We also use the occasion to introduce the notion of p-function, so that p-values are values of a p-function. The explanation is restricted to the discrete…