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

In 1944, P. Erd\H{o}s \cite{1} proved that if $n$ is a large highly composite number (HCN) and $n_1$ is the next HCN, then $$n<n_1<n+n(\log n)^{-c},$$ where $c>0$ is a constant. In this paper, using numerical results by D. A. Corneth, we…

Previously referred to as `miraculous' in the scientific literature because of its powerful properties and its wide application as optimal solution to the problem of induction/inference, (approximations to) Algorithmic Probability (AP) and…

A. Kagan introduced classes of distributions $\mathcal{D}_{m,k}$ in $m$-dimensional space $\mathbb{R}^m$. He proved that if the joint distribution of $m$ linear forms of $n$ independent random variables belong to the class…

The distribution of the sum of independent identically distributed uniform random variables is well-known. However, it is sometimes necessary to analyze data which have been drawn from different uniform distributions. By inverting the…

We consider the adjacency matrix of the ensemble of Erd\H{o}s-R\'enyi random graphs which consists of graphs on $N$ vertices in which each edge occurs independently with probability $p$. We prove that in the regime $pN \gg 1$ these matrices…

We obtain uniform estimates for $N_k(x,y)$, the number of positive integers $n$ up to $x$ for which $\omega_y(n)=k$, where $\omega_y(n)$ is the number of distinct prime factors of $n$ which are $<y$. The motivation for this problem is an…

We prove general exponential moment inequalities for averages of [0,1]-valued iid random variables and use them to tighten the PAC Bayesian Theorem. The logarithmic dependence on the sample count in the enumerator of the PAC Bayesian bound…

We study divisibility properties of a set $\{f_1(\mathbf{U}_n^{(s)}),\ldots,f_m(\mathbf{U}_n^{(s)})\}$, where $f_1,\ldots,f_m$ are polynomials in $s$ variables over $\mathbb{Z}$ and $\mathbf{U}_n^{(s)}$ is a point picked uniformly at random…

Given a normalized Orlicz function $M$ we provide an easy formula for a distribution such that, if $X$ is a random variable distributed accordingly and $X_1,...,X_n$ are independent copies of $X$, then the expected value of the p-norm of…

The statistical problem of the distribution of $s$ quanta of equal energy $\epsilon_0$ and total energy $E$ among $N$ distinguishable particles is resolved using the conventional theory based on Boltzmann's principle of equal probabilities…

Consider a `dense' Erd\H{o}s--R\'enyi random graph model $G=G_{n,M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M/\binom{n}{2}$ is bounded away from 0 and 1. Fix $k=k(n)$ with $k/n$ bounded away from 0 and~1, and let…

The Central Limit Theorem states that, in the limit of a large number of terms, an appropriately scaled sum of independent random variables yields another random variable whose probability distribution tends to a stable distribution. The…

Let $G, G_1,\dots,G_N$ be independent copies of a standard gaussian random vector in $\mathbb{R}^d$ and denote by $\Gamma = \sum_{i=1}^N \langle G_i,\cdot\rangle e_i$ the standard gaussian ensemble. We show that, for any set $A\subset…

The norm of an integer partition is defined as the product of its parts. This statistic was recently introduced by Schneider in connection to partition zeta functions. In this note, we use the method of moments to study the distribution of…

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

Let $\Omega \in \mathbb{C}$ be a domain such that $K:= \mathbb{C} \setminus \Omega$ is compact and non-polar. Let $g_\Omega$ be the Green's function with a logarithmic pole at infinity, and let $\omega = \omega_K$ be the equilibrium…

Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…

A Langevin equation is suggested to describe a system driven by correlated Gaussian white noise as well as with positive and negative damping demarcated by a critical velocity. The equation can be transformed into the Fokker-Planck equation…

For a family $\mathcal{F}$ of graphs, a graph $G$ is called \emph{$\mathcal{F}$-universal} if $G$ contains every graph in $\mathcal{F}$ as a subgraph. Let $\mathcal{F}_n(d)$ be the family of all graphs on $n$ vertices with maximum degree at…

Using the replica method, we develop an analytical approach to compute the characteristic function for the probability $\mathcal{P}_N(K,\lambda)$ that a large $N \times N$ adjacency matrix of sparse random graphs has $K$ eigenvalues below a…