相关论文: A Variant of Probabilistic Topology

We introduce the notion of p*-values (p*-variables), which generalizes p-values (p-variables) in several senses. The new notion has four natural interpretations: operational, probabilistic, Bayesian, and frequentist. A main example of a…

In 1982, the theory of rough sets proposed by Pawlak and in 2013, Luay concerned a rough probability by using the notion of Topology. In this paper, we study the rough probability in the stochastic approximation spaces by using set-valued…

Abstract argumentation offers an appealing way of representing and evaluating arguments and counterarguments. This approach can be enhanced by a probability assignment to each argument. There are various interpretations that can be ascribed…

In this paper we study Appell polynomials by connecting them to random variables. This probabilistic approach yields, e.g., the mean value property which is fundamental in the sense that many other properties can be derived from it. We also…

We revisit and generalize the concept of composite likelihood as a method to make a probabilistic inference by aggregation of multiple Bayesian agents, thereby defining a class of predictive models which we call composite Bayesian. This…

Let $K$ be a countable field. Then $K$ is large in the sense of Pop if and only if it admits a field topology which is "generalized t-henselian" (gt-henselian) in the sense of Dittmann, Walsberg, and Ye, meaning that the implicit function…

We define the topological multiplicity of an invertible topological system $(X,T)$ as the minimal number $k$ of real continuous functions $f_1,\cdots, f_k$ such that the functions $f_i\circ T^n$, $n\in\mathbb Z$, $1\leq i\leq k,$ span a…

We develop an analogue of probability theory for probabilities taking values in topological groups. We generalize Kolmogorov's method of axiomatization of probability theory: main distinguishing features of frequency probabilities are taken…

In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…

This paper presents an offering of some of the myriad connections between Combinatorics and Probability, directed in particular toward combinatorialists. The choice of material was dictated by the author's own interests, tastes and…

This text presents an unified approach of probability and statistics in the pursuit of understanding and computation of randomness in engineering or physical or social system with prediction with generalizability. Starting from elementary…

For $1\le p \le \infty$, the Fr\'echet $p$-mean of a probability measure on a metric space is an important notion of central tendency that generalizes the usual notions in the real line of mean ($p=2$) and median ($p=1$). In this work we…

A hierarchical structure of isomorphic arithmetics is defined by a bijection $g_\mathbb{R}:\mathbb{R}\to \mathbb{R}$. It entails a hierarchy of probabilistic models, with probabilities $p_k=g^k(p)$, where $g$ is the restriction of…

A review of various definitions of "compatibility" expressed in terms of ordinary probability, and a discussion of the occurrence of incompatibility (and the related phenomenon of interference) in non-quantal probabilistic systems.

We examine topological and algebraic genericity and spaceability for any pair $(X,Y)$, $X\subset Y$, $X\neq Y$ belonging to an extended chain of sequence spaces which contains the $\ell^p$ spaces, $0<p\leq \infty$.

We show that a topometric space $X$ is topometrically isomorphic to a type space of some continuous first-order theory if and only if $X$ is compact and has an open metric (i.e., satisfies that $\{p : d(p,U) < \varepsilon\}$ is open for…

This paper deals with transportation polytopes in the probability simplex (that is, sets of categorical bivariate probability distributions with prescribed marginals). Information projections between such polytopes are studied, and a…

Given a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform…

Type inference refers to the task of inferring the data type of a given column of data. Current approaches often fail when data contains missing data and anomalies, which are found commonly in real-world data sets. In this paper, we propose…

The following selection theorem is established:\\ Let $X$ be a compactum possessing a binary normal subbase $\mathcal S$ for its closed subsets. Then every set-valued $\mathcal S$-continuous map $\Phi\colon Z\to X$ with closed $\mathcal…