Related papers: Strong limit theorems in the multi-color generaliz…
The main purpose of this paper is to obtain strong laws of large numbers for arrays or weighted sums of random variables under a scenario of dependence. Namely, for triangular arrays $\{X_{n,k}, \, 1 \leqslant k \leqslant n, \, n \geqslant…
Based on the probability distribution observed in complex systems and an assumption that the probability distributions of complex systems satisfy a new generalized multiplication, it is proved that the statistical theory of complex systems…
We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…
We propose and study a new model for competitions, specifically sports multi-player leagues where the initial strengths of the teams are independent i.i.d. random variables that evolve during different days of the league according to…
The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…
We study two models of the Majority problem. We are given n balls and an unknown coloring of them with two colors. We can ask sets of balls of size k as queries, and in the so-called General Model the answer to a query shows if all the…
The strong law of large numbers for linear combinations of functions of order statistics ($L$-statistics) based on weakly dependent random variables is proven. We also establish the Glivenko--Cantelli theorem for $\phi$-mixing sequences of…
In many empirical studies of a large two-sided matching market (such as in a college admissions problem), the researcher performs statistical inference under the assumption that they observe a random sample from a large matching market. In…
We extend the methods and results of [arXiv 1603.04896] to the setting of multinomial distributions satisfying certain properties. These include all the multinomial distributions arising from the direct proof of the Central Limit Theorem…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
A uniform law of large numbers and a central limit theorem are established via a martingale approach for a univariate Hawkes process with immigration given by a renewal process. The results are obtained for renewal processes with absolutely…
We consider the sum of power weighted nearest neighbor distances in a sample of size n from a multivariate density f of possibly unbounded support. We give various criteria guaranteeing that this sum satisfies a law of large numbers for…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…
The purpose of this paper is to establish a general strong law of large numbers (SLLN) for arbitrary sequences of random variables (rv's) based on the squared indice method and to provide applications to SLLN of associated sequences. This…
The arm of this paper is to establish the strong law of large numbers (SLLN) of $m$-dependent random variables under the framework of sub-linear expectations. We establish the SLLN for a sequence of independent, but not necessarily…
We revisit the random allocation model in which $n$ balls are independently placed into $N$ boxes with probabilities $q_1,\ldots,q_N$. A classical asymptotic result due to Kolchin, Sevastyanov, and Chistyakov for the expectations,…
In this paper, we give the rigidity theorem for a log morphism as an extension of a fixed scheme morphism. We also give several applications of the rigidity theorem.
The validity of the strong law of large numbers for multiple sums $S_n$ of independent identically distributed random variables $Z_k$, $k\leq n$, with $r$-dimensional indices is equivalent to the integrability of $|Z|(\log^+|Z|)^{r-1}$,…
The paper is a sketch of systematic presentation of distributional limit theorems and their refinements for compound sums. When analyzing, e.g., ergodic semi-Markov systems with discrete or continuous time, this allows us to separate those…