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

Let $P^{\left(\frac 12\right)}(n)$ denote the middle prime factor of $n$ (taking into account multiplicity). More generally, one can consider, for any $\alpha \in (0,1)$, the $\alpha$-positioned prime factor of $n$, $P^{(\alpha)}(n)$. It…

We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on $n$ integers. Under certain…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…

Building on B.Park and Vondrak's recent generalization of the J.Park-Pham Theorem (formerly known as Kahn-Kalai conjecture) to non-uniform probability measures, this paper introduces the notion of "spread" for the non-uniform setting. This…

We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of K\'atai's orthogonality criterion.…

We prove a generalization of van der Corput's Difference Theorem in the theory of uniform distribution by establishing a connection with unitary operators that have Lebesgue spectrum. This allows us to show, for example, that if $(x_n)_{n =…

This paper is concerned with the study of the random variable $K_n$ denoting the number of distinct elements in a random sample $(X_1, \dots, X_n)$ of exchangeable random variables driven by the two parameter Poisson-Dirichlet distribution,…

Let us denote the nth difference between consecutive primes by d_n. The Prime Number Theorem clearly implies that d_n is logn on average. Paul Erd\H{o}s conjectured about 60 years ago that the sequence d_n/logn is everywhere dense on the…

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

We consider the ensemble of adjacency matrices of Erd\H{o}s-R\'{e}nyi random graphs, that is, graphs on $N$ vertices where every edge is chosen independently and with probability $p\equiv p(N)$. We rescale the matrix so that its bulk…

Let omega(n) be the number of distinct prime factors dividing n and m > n natural numbers. We calculate a formula showing which prime numbers in which intervals divide a given binomial coefficient. From this formula we get an identity…

One of the main concepts in quantum physics is a density matrix, which is a symmetric positive definite matrix of trace one. Finite probability distributions are a special case where the density matrix is restricted to be diagonal. Density…

Let $d$ be a probability distribution. Under certain mild conditions we show that $$ \lim_{x\to\infty}x\sum_{n=1}^\infty \frac{d^{*n}(x)}{n}=1,\qquad\text{where}\quad d^{*n}:=\underbrace{\,d*d*\cdots*d\,}_{n\text{ times}}. $$ For a…

We study the asymptotic behavior of random variables of the form \begin{equation*} E_{\alpha}^i\left(x_1,\ldots,x_n\right)=\sum_{\left(b,d\right)\in \mathit{PH}_i\left(x_1,\ldots,x_n\right)} \left(d-b\right)^{\alpha} \end{equation*} where…

Let $E_0,\ldots,E_n$ be a partition of the set of prime numbers, and define $E_j(x) := \sum_{p \in E_j \atop p \leq x} \frac{1}{p}$. Define $\pi(x;\mathbf{E},\mathbf{k})$ to be the number of integers $n \leq x$ with $k_j$ prime factors in…

The Fundamental Theorem of PAC Learning asserts that learnability of a concept class $H$ is equivalent to the $\textit{uniform convergence}$ of empirical error in $H$ to its mean, or equivalently, to the problem of $\textit{density…

The well-known Hardy--Ramanujan inequality states that if $\omega(n)$ denotes the number of distinct prime factors of a positive integer $n$, then there is an absolute constant $C>0$ such that uniformly for $x\ge2$ and $k\in\mathbb{N}$,…

The Erd\"os-Taylor theorem [Acta Math. Acad. Sci. Hungar, 1960] states that if $\mathsf{L}_N$ is the local time at zero, up to time $2N$, of a two-dimensional simple, symmetric random walk, then $\tfrac{\pi}{\log N} \,\mathsf{L}_N$…

We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…

Let $K(=K_{n,\theta})$ be a positive integer-valued random variable whose distribution is given by ${\rm P}(K = x) = \bar{s}(n,x) \theta^x/(\theta)_n$ $(x=1,\ldots,n) $, where $\theta$ is a positive number, $n$ is a positive integer,…