Related papers: A Weak Law of Large Numbers for Dependent Random V…
We prove that the spectral radius of an i.i.d.\ random walk on $\GL_d(\C)$ satisfies a strong law of large numbers under finite second moment assumption and a weak law of large numbers under finite first moment. No irreducibility assumption…
We investigate the power of weak measurements in the framework of quantum state discrimination. First, we define and analyze the notion of weak consecutive measurements. Our main result is a convergence theorem whereby we demonstrate when…
Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…
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…
We study the first passage time $\tau_u = \inf \{ n \geq 1: |V_n| > u \}$ for the multivariate perpetuity sequence $V_n = Q_1 + M_1 Q_2 + \cdots + (M_1 \ldots M_{n-1}) Q_n$, where $(M_n, Q_n)$ is a sequence of independent and identically…
A beautiful theorem of Zeckendorf states that every positive integer can be uniquely decomposed as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, where $F_1 = 1$, $F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$. For general recurrences…
The theory of stochastic approximations form the theoretical foundation for studying convergence properties of many popular recursive learning algorithms in statistics, machine learning and statistical physics. Large deviations for…
The weak saturation number $\mathrm{wsat}(n,F)$ is the minimum number of edges in a graph on $n$ vertices such that all the missing edges can be activated sequentially so that each new edge creates a copy of $F$. A usual approach to prove a…
We investigate the variance of the length of the longest common subsequences of two independent random words of size $n$, where the letters of one word are i.i.d. uniformly drawn from $\{\alpha_1, \alpha_2, \cdots, \alpha_m\}$, while the…
We provide a permutation invariant version of the strong law of large numbers for exchangeable sequences of random variables. The proof consists of a combination of the Koml\'{o}s-Berkes theorem, the usual strong law of large numbers for…
The paper proves the Strong Law of Large Numbers for integral functionals of random fields with unboundedly increasing covariances. The case of functional data and increasing domain asymptotics is studied. Conditions to guarantee that the…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
This paper provides a quantitative version of de Finetti law of large numbers. Given an infinite sequence $\{X_n\}_{n \geq 1}$ of exchangeable Bernoulli variables, it is well-known that $\frac{1}{n} \sum_{i = 1}^n X_i…
We consider $n\times n$ random matrices $M_{n}=\sum_{\alpha =1}^{m}{\tau _{\alpha }}\mathbf{y}_{\alpha }\otimes \mathbf{y}_{\alpha }$, where $\tau _{\alpha }\in \mathbb{R}$, $\{\mathbf{y}_{\alpha }\}_{\alpha =1}^{m}$ are i.i.d. isotropic…
We consider random sub-graphs of a fixed graph $G=(V,E)$ with large minimum degree. We fix a positive integer $k$ and let $G_k$ be the random sub-graph where each $v\in V$ independently chooses $k$ random neighbors, making $kn$ edges in…
Let M be a subset of {0, .., n} and F be a family of subsets of an n element set such that the size of A intersection B is in M for every A, B in F. Suppose that l is the maximum number of consecutive integers contained in M and n is…
We show that in the setting of fair-coin measure on the power set of the natural numbers, each sufficiently random set has an infinite subset that computes no random set. That is, there is an almost sure event $\mathcal A$ such that if…
In the spirit of a classical results for Crump-Mode-Jagers processes, we prove a strong law of large numbers for homogenous fragmentation processes. Specifically, for self-similar fragmentation processes, including homogenous processes, we…
Let $X_1,\ldots,X_n$ be a sequence of independent random points in $\mathbb{R}^d$ with common Lebesgue density $f$. Under some conditions on $f$, we obtain a Poisson limit theorem, as $n \to \infty$, for the number of large probability…
Limit theorems for non-additive probabilities or non-linear expectations are challenging issues which have raised progressive interest recently. The purpose of this paper is to study the strong law of large numbers and the law of the…