Related papers: Strong limit theorems in the multi-color generaliz…
Q-balls -- whether in the single-field or multi-field context -- are usually studied in theories containing only one stabilising symmetry. However, this is not the most general scenario. In this paper, we study a class of theories with…
For a large class of statistical systems a geometric mean value of the observables is constrained. These observables are characterized by a power-law statistical distribution.
We investigate three kinds of strong laws of large numbers for capacities with a new notion of independently and identically distributed (IID) random variables for sub-linear expectations initiated by Peng. It turns out that these theorems…
This is a research endeavor in two parts. We study a class of balanced urn schemes on balls of two colours (say white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn, and ball addition rules are applied. We…
Distributive laws are important for algebraic reasoning in arithmetic and logic. They are equally important for algebraic reasoning about concurrent programs. In existing theories such as Concurrent Kleene Algebra, only partial correctness…
The problem we are considering is the following. A colorblind player is given a set $B = \{b_1,b_2,...,b_N\}$ of $N$ colored balls. He knows that each ball is colored either red or green, and that there are less green balls (this will be…
We give a complete expansion, at any accuracy order, for the iterated convolution of a complex valued integrable sequence in one space dimension. The remainders are estimated sharply with generalized Gaussian bounds. The result applies in…
By applying results obtained from the new versions of the classical Levy, Ottaviani, and Hoffmann-Jorgensen (1974) inequalities proved by Li and Rosalsky(2013) and by using techniques developed by Hechner and Heinkel (2010), we provide a…
We prove a strong law of large numbers for random sets with bounded and closed values contained in an arbitrary (not necessarily separable) Banach space. We make use of a notion of convergence of sets introduced by Fisher, which is stronger…
The law of large numbers is one of the most fundamental results in Probability Theory. In the case of independent sequences, there are some known characterizations; for instance, in the independent and identically distributed setting it is…
This paper takes the so-called probabilistic approach to the Strong Renewal Theorem (SRT) for multivariate distributions in the domain of attraction of a stable law. A version of the SRT is obtained that allows any kind of…
We study the limit theory of large threshold graphs and apply this to a variety of models for random threshold graphs. The results give a nice set of examples for the emerging theory of graph limits.
This paper describes a large set of related theorem proving problems obtained by translating theorems from the HOL4 standard library into multiple logical formalisms. The formalisms are in higher-order logic (with and without type…
The frequency allocation problem that appeared in the design of cellular telephone networks can be regarded as a multicoloring problem on a weighted hexagonal graph, which opened some still interesting mathematical problems. We generalize…
We examine a generalization of the binomial distribution associated with a strictly increasing sequence of numbers and we prove its Poisson-like limit. Such generalizations might be found in quantum optics with imperfect detection. We…
In this paper, under some weaker conditions, we give three laws of large numbers under sublinear expectations (capacities), which extend Peng's law of large numbers under sublinear expectations in [8] and Chen's strong law of large numbers…
We review briefly the concepts underlying complex systems and probability distributions. The later are often taken as the first quantitative characteristics of complex systems, allowing one to detect the possible occurrence of regularities…
We study the problem of designing multiwinner voting rules that are candidate monotone and proportional. We show that the set of committees satisfying the proportionality axiom of proportionality for solid coalitions is candidate monotone.…
A strongly polynomial sequence of graphs $(G_n)$ is a sequence $(G_n)_{n\in\mathbb{N}}$ of finite graphs such that, for every graph $F$, the number of homomorphisms from $F$ to $G_n$ is a fixed polynomial function of $n$ (depending on $F$).…
We present a multiple colour generalisation of the model of graph interacting urns studied by Benaim et. al., Random Struct. Alg., 46: 614-634, 2015. We show that for complete graphs and for a broad class of reinforcement functions…