pith. sign in

arxiv: 1401.1553 · v1 · pith:CFW7WZKNnew · submitted 2014-01-08 · 🧮 math.PR

A Simple Direct Proof of Billingsley's Theorem

classification 🧮 math.PR
keywords factorprimerandombillingsleylargestprocessprooftheorem
0
0 comments X
read the original abstract

Billingsley's theorem (1972) asserts that the Poisson--Dirichlet process is the limit, as $n \to \infty$, of the process giving the relative log sizes of the largest prime factor, the second largest, and so on, of a random integer chosen uniformly from 1 to $n$. In this paper we give a new proof that directly exploits Dickman's asymptotic formula for the number of such integers with no prime factor larger than $n^{1/u}$, namely $\Psi(n,n^{1/u}) \sim n \rho(u)$, to derive the limiting joint density functions of the finite-dimensional projections of the log prime factor processes. Our main technical tool is a new criterion for the convergence in distribution of non-lattice discrete random variables to continuous random variables.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.