Related papers: A Weak Law of Large Numbers for Dependent Random V…
Let $\log^{2+\varepsilon} n \le d \le n/2$ for some fixed $\varepsilon \in (0,1)$, and let $M_n$ be an $n\times n$ random matrix with entries in ${0,1}$, where each row is independently and uniformly sampled from the set of all vectors in…
Let $(X_n)_{n\in \mathbb{N}}$ be a sequence of i.i.d. random variables with distribution $\mathbb P(X_1=1)=\mathbb P(X_1=-1)=1/2$. Let $F(\sigma)=\sum_{n=1}^\infty X_nn^{-\sigma}$. We prove that the following holds almost surely…
This paper studies a limit order book (LOB) model, in which the order dynamics depend on both, the current best available prices and the current volume density functions. For the joint dynamics of the best bid price, the best ask price, and…
We develop a formal theory of the weak values with emphasis on the consistency conditions and a probabilistic interpretation in the counter-factual processes. We present the condition for the choice of the post-selected state to give a…
We study the statistical properties of random numbers under the Martin-L\"of definition of randomness, proving that random numbers obey analogues of Strong Law of Large Numbers, the Law of the Iterated Logarithm, and that they are normal.…
For the partial sums formed from a sequence of i.i.d. random variables having a finite absolute p'th moment for some p in (0,2), we extend the recent and striking discovery of Hechner and Heinkel (Journal of Theoretical Probability (2010))…
Let $M_n^{(k)}$ denote the $k$th largest maximum of a sample $(X_1,X_2,...,X_n)$ from parent $X$ with continuous distribution. Assume there exist normalizing constants $a_n>0$, $b_n\in \mathbb{R}$ and a nondegenerate distribution $G$ such…
We consider moderately trimmed sums of non-negative i.i.d. random variables. We show that for every distribution function there exists a proper moderate trimming such that for the trimmed sum a non-trivial strong law of large numbers holds.…
Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…
A well-known discovery of Feige's is the following: Let $X_1, \ldots, X_n$ be nonnegative independent random variables, with $\mathbb{E}[X_i] \leq 1 \;\forall i$, and let $X = \sum_{i=1}^n X_i$. Then for any $n$, \[\Pr[X < \mathbb{E}[X] +…
For n>=1 let X_n be a vector of n independent Bernoulli random variables. We assume that X_n consists of M "blocks" such that the Bernoulli random variables in block i have success probability p_i. Here M does not depend on n and the size…
Many systems exhibit a digit bias. For example, the first digit base 10 of the Fibonacci numbers, or of $2^n$, equals 1 not 10% or 11% of the time, as one would expect if all digits were equally likely, but about 30% of the time. This…
We construct an increasing sequence of natural numbers $(m_n)_{n=1}^{+\infty}$ with the property that $(m_n \th [1])_{n\geq 1}$ is dense in $\T$ for any $\th \in \R\setminus \Q$, and a continuous measure on the circle $\mu$ such that…
This note proves a law of large numbers for predicting several steps ahead, which, in the case of uniformly bounded random variables, generalizes the standard law of large numbers for martingales; the standard law of large numbers…
Fix a constant $C\geq 1$ and let $d=d(n)$ satisfy $d\leq \ln^{C} n$ for every large integer $n$. Denote by $A_n$ the adjacency matrix of a uniform random directed $d$-regular graph on $n$ vertices. We show that, as long as $d\to\infty$ with…
We continue the line of research of random walks with barrier initiated by Iksanov and M{\"o}hle (2008). Assuming that the tail of the step of the underlying random walk has a power-like behavior at infinity with exponent $-\alpha$,…
In this work we investigate the asymptotic behaviour of weighted partial sums of a particular class of random variables related to Oppenheim series expansions. More precisely, we verify convergence in probability as well as almost sure…
Denote by $\P_n$ the set of $n\times n$ positive definite matrices. Let $D = D_1\oplus \dots \oplus D_k$, where $D_1\in \P_{n_1}, \dots, D_k \in \P_{n_k}$ with $n_1+\cdots + n_k=n$. Partition $C\in \P_n$ according to $(n_1, \dots, n_k)$ so…
We derive a necessary and sufficient condition for the sum of M independent continuous random variables modulo 1 to converge to the uniform distribution in L^1([0,1]), and discuss generalizations to discrete random variables. A consequence…
Let $\mathcal{I} \subset \mathbb{N}$ be an infinite subset, and let $\{a_i\}_{i \in \mathcal{I}}$ be a sequence of nonzero real numbers indexed by $\mathcal{I}$ such that there exist positive constants $m, C_1$ for which $|a_i| \leq C_1…