Related papers: A Generalization of the Erd\H{o}s-Kac Theorem

In $1946$, Mark Kac proved a Central Limit type theorem for a sequence of random variables that were not independent. The random variables under consideration were obtained from the angle-doubling map. The idea behind Kac's proof was to…

Two models of a random digraph on $n$ vertices, $D(n,\text{Prob}(\text{arc})=p)$ and $D(n,\text{number of arcs}=m)$ are studied. In 1990, Karp for $D(n,p)$ and independently T. \L uczak for $D(n,m=cn)$ proved that for $c>1$, with…

Let $n$ be a large integer, and let $G$ be the standard Gaussian vector in $R^n$. Paouris, Valettas and Zinn (2015) showed that for all $p\in[1,c\log n]$, the variance of the $\ell_p^n$--norm of $G$ is equivalent, up to a constant multiple,…

Let $\Sigma=\{a_1, \ldots , a_n\}$ be a set of positive integers with $a_1 < \ldots < a_n$ such that all $2^n$ subset sums are pairwise distinct. A famous conjecture of Erd\H{o}s states that $a_n>C\cdot 2^n$ for some constant $C$, while the…

This article offers a simplified approach to the distribution theory of randomly weighted averages or $P$-means $M_P(X):= \sum_{j} X_j P_j$, for a sequence of i.i.d.random variables $X, X_1, X_2, \ldots$, and independent random weights $P:=…

Kac's lemma determines the expected return time to a set of positive measure under iterations of an ergodic probability preserving transformations. We introduce the notion of an \emph{allocation} for a probability preserving action of a…

Recently, the use of Polynomial Chaos Expansion (PCE) has been increasing to study the uncertainty in mathematical models for a wide range of applications and several extensions of the original PCE technique have been developed to deal with…

Consider the complete graph \(K_n\) on \(n\) vertices where each edge \(e\) is independently open with probability \(p_n(e)\) or closed otherwise. Here \(\frac{C-\alpha_n}{n} \leq p_n(e) \leq \frac{C+\alpha_n}{n}\) where \(C > 0\) is a…

A new, constructive proof with a small explicit constant is given to the Erd\H{o}s-Pyber theorem which says that the edges of a graph on $n$ vertices can be partitioned into complete bipartite subgraphs so that every vertex is covered at…

Let $n\geq 1$ and $X_{n}$ be the random variable representing the size of the smallest component of a random combinatorial object made of $n$ elements. A combinatorial object could be a permutation, a monic polynomial over a finite field, a…

Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erd\H{o}s-Gallai Theorem in random graphs. In particular, we determine, up to a constant…

Given a positive integer $n$, an unlabeled graph $G$ on $n$ vertices, and a vertex $v$ of $G$, let $N_G(v)$ be the subgraph of $G$ induced by vertices of $G$ of distance at most one from $v$. We show that there are universal constants…

Let $f(n)$ be the number of distinct exponents in the prime factorization of the natural number $n$. We prove some results about the distribution of $f(n)$. In particular, for any positive integer $k$, we obtain that $$ \#\{n \leq x : f(n)…

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

The \emph{generalized sorting problem} is a restricted version of standard comparison sorting where we wish to sort $n$ elements but only a subset of pairs are allowed to be compared. Formally, there is some known graph $G = (V, E)$ on the…

In this paper we study Kac's 1D particle system, consisting of the velocities of $N$ particles colliding at constant rate and randomly exchanging energies. We prove uniform (in time) propagation of chaos in Wasserstein distance with…

Let $(X_{jk})_{j,k\geq 1}$ be an infinite array of i.i.d. complex random variables, with mean 0 and variance 1. Let $\la_{n,1},...,\la_{n,n}$ be the eigenvalues of $(\frac{1}{\sqrt{n}}X_{jk})_{1\leq j,k\leq n}$. The strong circular law…

The mean ergodic theorem is equivalent to the assertion that for every function K and every epsilon, there is an n with the property that the ergodic averages A_m f are stable to within epsilon on the interval [n,K(n)]. We show that even…

For a Haar-distributed element $H$ of a compact Lie group \(L\), Eric Rains proved that there is a natural number $D = D_L$ such that, for all $d\ge D$, the eigenvalue distribution of $H^d$ is fixed, and Rains described this fixed…

Given a set $A=\{a_1,\ldots,a_n\}$ of real numbers and real coefficients $b_1,\ldots,b_n$, consider the distribution of the sum obtained by pairing the $a_i$'s with the $b_i$'s according to a uniformly random permutation. A recent theorem…