Dickman approximation in simulation, summations and perpetuities

Abstract

The generalized Dickman distribution Dθ with parameter θ>0 is the unique solution to the distributional equality W=d W*, where eqnarray W*=d U1/θ(W+1) (1) eqnarray with W non-negative with probability one, U U[0,1] independent of W, and =d denoting equality in distribution. Members of this family appear in number theory, stochastic geometry, perpetuities and the study of algorithms. We obtain bounds in Wasserstein type distances between Dθ and eqnarray Wn= 1n Σi=1n Yk Bk (2) eqnarray where B1,…,Bn, Y1, …, Yn are independent with Bk Ber(1/k), E[Yk]=k, Var(Yk)=σk2 and provide an application to the minimal directed spanning tree in R2, and also obtain such bounds when the Bernoulli variables in (2) are replaced by Poissons. We also give simple proofs and provide bounds with optimal rates for the Dickman convergence of the weighted sums, arising in probabilistic number theory, of the form eqnarray Sn=1(pn) Σk=1n Xk (pk) eqnarray where (pk)k 1 is an enumeration of the prime numbers in increasing order and Xk is Geometric with parameter (1-1/pk), Bernoulli with success probability 1/(1+pk) or Poisson with mean λk. In addition, we broaden the class of generalized Dickman distributions by studying the fixed points of the transformation eqnarray* s(W*)=d U1/θs(W+1) eqnarray* generalizing (1), that allows the use of non-identity utility functions s(·) in Vervaat perpetuities. We obtain distributional bounds for recursive methods that can be used to simulate from this family.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…