Related papers: On regularities of mass random phenomena

In his constructive and well-informed commentary, Andrei Khrennikov acknowledges a privileged status of classical probability theory with respect to statistical analysis. He also sees advantages offered by the Contextuality-by-Default…

Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…

A semi-measure is a generalization of a probability measure obtained by relaxing the additivity requirement to super-additivity. We introduce and study several randomness notions for left-c.e. semi-measures, a natural class of effectively…

We register a random sequence which has the following properties: it has three segments being the homogeneous Markov processes. Each segment has his own one step transition probability law and the length of the segment is unknown and…

In 1974 Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let data be finite binary strings and models be finite sets of binary strings. Consider model classes consisting of models of given maximal…

In this article we provide a proof of the so called absolute continuity theorem for random dynamical systems on $R^d$ which have an invariant probability measure. First we present the construction of local stable manifolds in this case.…

Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…

The word "complexity" is most often used as a meta--linguistic expression referring to certain intuitive characteristics of a natural system and/or its scientific description. These characteristics may include: sheer amount of data that…

We study countable graphs that -- up to isomorphism and with probability one -- arise from a random process, in a similar fashion as the Rado graph. Unlike in the classical case, we do not require that probabilities assigned to pairs of…

The notion of density of a finite set is discussed. We proof a general theorem of set theory which refines Bose-Einstein distribution.

Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…

We show that the hypothesis of regularity of the conditional distribution of the empiric average of a finite sample of IID random variables, given all the sample "fluctuations", which appeared in our earlier manuscript |1] in the context of…

We prove a general multidimensional invariance principle for a family of U-statistics based on freely independent non-commutative random variables of the type $U_n(S)$, where $U_n(x)$ is the $n$-th Chebyshev polynomial and $S$ is a standard…

The rational base number system, introduced by Akiyama, Frougny, and Sakarovitch in 2008, is a generalization of the classical integer base number system. Within this framework two interesting families of infinite words emerge, called…

The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…

Commonly observed patterns typically follow a few distinct families of probability distributions. Over one hundred years ago, Karl Pearson provided a systematic derivation and classification of the common continuous distributions. His…

We describe a mathematical language for determining all possible patterns of contextuality in the dependence of stochastic outputs of a system on its deterministic inputs. The central notion is that of all possible couplings for…

The purpose of this work is to investigate various notions of regularity from the perspective of finiteness conditions, with the ultimate goal of identifying broad classes of rings that are $\mathsf{K}_0$-regular. In this direction, we…

In this paper the generalization of the Poisson distribution is derived for the case when each consecutive event changes event rate. A simple formula for the probability of observing of a given number of events for the selected period of…

The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discrete universal distribution. There are conditional versions referred to in several publications but as yet there exist no written proofs in…