Related papers: Spacings between integers having typically many pr…

The Poisson process of order $i$ is a weighted sum of independent Poisson processes and is used to model the flow of clients in different services. In the paper below we study some extensions of this process, for different forms of the…

The Erdos-Kac theorem, a foundational result in probabilistic number theory, states that the number of prime factors of an integer follows a Gaussian distribution. In this paper we develop and analyze probabilistic models for "random…

We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if the number of occurrences of blocks of symbols…

We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then…

For each $m\geq 1$, there exist infinitely many primes $p_1<p_2<\ldots<p_{m+1}$ such that $p_{m+1}-p_1=O(m^4e^{8m})$ and $p_j+2$ has at most $\frac{16m}{\log 2}+\frac{5\log m}{\log 2}+37$ prime divisors for each $j$.

Prime factorization is an outstanding problem in arithmetic, with important consequences in a variety of fields, most notably cryptography. Here we employ the intriguing analogy between prime factorization and optical interferometry in…

Consider an unlimited homogeneous medium disturbed by points generated via Poisson process. The neighborhood of a point plays an important role in spatial statistics problems. Here, we obtain analytically the distance statistics to $k$th…

In this paper we create a definition for prime gaps in the Gaussian integers using a boxcar metric. From this we used numerical methods to derive an asymptotic upper bound for the gaps in this scenario, namely O(log^2|p_{n}|).

Consider the family of power divergence statistics based on $n$ trials, each leading to one of $r$ possible outcomes. This includes the log-likelihood ratio and Pearson's statistic as important special cases. It is known that in certain…

Fix a base B and let zeta have the standard exponential distribution; the distribution of digits of zeta base B is known to be very close to Benford's Law. If there exists a C such that the distribution of digits of C times the elements of…

We give a sufficient condition for a random sequence in [0,1] generated by a $\Psi$-process to be equidistributed. The condition is met by the canonical example -- the $\max$-2 process -- where the $n$th term is whichever of two uniformly…

We consider simple exclusion processes on Z for which the underlying random walk has a finite first moment and a non-zero mean and whose initial distributions are product measures with different densities to the left and to the right of the…

We consider the distribution of the largest prime divisor of the integers in the interval $[2,x]$, and investigate in particular the mode of this distribution, the prime number(s) which show up most often in this list. In addition to giving…

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…

Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when…

The prime number graph is the set of points $(n,p_n)$ where $p_n$ denotes the $n^{\rm th}$ prime. Let $L(n)$ be the minimum number of straight line segments needed to cover the first $n$ points in this set. Let $B(n)$ be the largest number…

We consider a Zipf--Poisson ensemble in which $X_i\sim\poi(Ni^{-\alpha})$ for $\alpha>1$ and $N>0$ and integers $i\ge 1$. As $N\to\infty$ the first $n'(N)$ random variables have their proper order $X_1>X_2>...>X_{n'}$ relative to each…

Consider two independent Poisson point processes of unit intensity in the Euclidean space of dimension $d$ at least 3. We construct a perfect matching between the two point sets that is a factor (i.e., an equivariant measurable function of…

For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…

One of the main differences between the central limit theorem and the Poisson law of small numbers is that the former possesses the large sample property (LSP), i.e., the error of normal approximation to the sum of $n$ independent…