Skip to Content
AxiomsAxioms
  • Feature Paper
  • Article
  • Open Access

1 August 2026

35 Pages

Self-Decomposability and the Lambert Law

Department of Mathematics & Statistics, University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia
This article belongs to the Section Mathematical Analysis

Abstract

The Lambert W is a Bernstein function and hence the cumulant function of a positive infinitely divisible law, the Lambert law L ( Λ ) . The Lambert law is self-decomposable with a unit rate compound Poisson background driving Lévy process (BDLP) with a certain jump law L ( J ) . Thus, it satisfies the random perpetuity relation Λ = L U ( Λ + J ) , where U has the standard uniform law, as well as the relation Λ = L U S J , where S is the stationary-excess operator. If the law of J is unspecified, then these two in-law relations together characterise the law of Λ . Generalisations are pursued in which the Poisson jump rate a is arbitrary. If a ≠ 1 , the above two conditions determine a family of positive infinitely divisible laws for which the Laplace–Stieltjes transforms satisfy an algebraic trinomial equation investigated by Lambert and Euler. These laws occur as limiting distributions of shot noise processes and continuous-time branching processes. A sequence of n-times self-decomposable positive laws derived from a given subordinator is called a BDLP ladder. The BDLP ladder that includes the Lambert law has cumulant functions which are polynomial forms of the Lambert function. Under moment conditions, general BDLP ladder laws are asymptotically normal or stable.

1. Introduction

We begin by recalling some facts. The cumulant function (CF) of the law L ( X ) of a non-negative random variable is defined as C ( θ ) = − log E ( e − θ X ) , θ ≥ 0 . The law L ( X ) is infinitely divisible (infdiv) if C ( θ ) is a Bernstein function (written C ∈ B ), meaning that there is a constant δ ≥ 0 and a (Lévy) measure L ( d x ) on ( 0 , ∞ ) satisfying L ( { 0 } ) = 0 and ∫ 0 ∞ ( x ∧ 1 ) L ( d x ) < ∞ such that
C ( θ ) = δ θ + ∫ 0 ∞ 1 − e − θ x L ( d x ) .
In other words, C ′ ( θ ) is completely monotone.
If X = L c X + X c for all c ∈ ( 0 , 1 ] , where on the right-hand side X and X c are independent, then L ( X ) is called self-decomposable (SD). An analytic equivalence is that C ∈ B and λ ( d x ) = ℓ ( x ) d x , with x ℓ ( x ) non-increasing in ( 0 , ∞ ) . A particular case is where x ℓ ( x ) is completely monotone, with a representing measure ν ( d x ) (called the Thorin measure) satisfying ∫ 0 + 1 + log v ν ( v ) > − ∞ and ∫ 1 + ∞ y − 1 ν ( d y ) < ∞ . We say that C ( θ ) is Thorin–Bernstein, C ∈ T B , and the corresponding law L ( X ) is a generalised gamma convolution (GGC). The GGCs comprise the smallest class containing gamma laws while being closed under convolution and convergence in law. In recent decades, the infdiv nature of many laws has been exposed by showing they are GGCs; see, e.g., pp. 378–387 in [1] and the many examples in [2].
In this paper, we are concerned with some structural issues involving a special GGC, namely, the Lambert law. The Lambert W function is defined as a solution of the equation
W e W = θ .
A real-valued concave increasing solution W ( θ ) exists which maps [ − e − 1 , ∞ ) onto [ − 1 , ∞ ) . There is a second decreasing negative-valued solution W 1 ( θ ) which maps [ − e − 1 , 0 ) onto [ − 1 , − ∞ ) . We are concerned with the first of these, the principal solution. These solutions are respectively denoted by W p and W m in §4.13 of the standard reference [3]; see Corless et al. [4] for the fundamental properties of the Lambert W function and a description of some of its applications, [5] for a summary of some applications, and [6] for an extensive classification and listing of applications. Many of these occurrences of W arise because solving equations describing the situation at hand produces a functional equation which can be manipulated into the Lambert form (2).
A more recent insight has revealed that W has an integral representation which links to probability theory, specifically W ∈ B , i.e.,
W ( θ ) = ∫ 0 ∞ 1 − e − θ x ω ( x ) d x ,
where ω is the density of a Lévy measure. Consequently, there is a corresponding infdiv law L ( Λ ) , the Lambert law, for which the Laplace–Stieltjes transform (LST) is
λ ( θ ) : = E e − θ Λ = e − W ( θ ) .
It follows from (2) that λ ( θ ) = W ( θ ) / θ , and hence that Λ has the probability density function (pdf)
ℓ ( x ) = ∫ x ∞ ω ( y ) d y , ( x > 0 ) .
This is a pdf because
∫ 0 ∞ ℓ ( x ) d x = ∫ 0 ∞ y ω ( y ) d y = W ′ ( 0 ) = 1 .
Refining the assertion W ∈ B , it is known that W ∈ T B , and hence that the Lambert law is SD. There are many contributions leading to this outcome, and we briefly review them in Section 2.
Our point of departure is the stochastic integral representation enjoyed by any SD random variable X. In summary, X can be expressed as a random Laplace–Stieltjes transform in which the integrator function is a Lévy process, which conventionally is dubbed the background driving Lévy process (BDLP); see [7] or [8] for details. This representation for the Lambert law is
Λ = L ∫ 0 ∞ e − t d B t ,
where the BDLP ( B t ) is a compound Poisson with jumps that occur at unit rate and have the exponential mixture density
ω B ( y ) = ∫ 0 ∞ v e − y v ν ( d v ) .
This representation entails a characterisation result (Theorem 1) for L ( Λ ) as the unique solution up to scaling satisfying the random perpetuity relation X = L U ( X + J ) and subject to X = L U S J , where U has a standard uniform law, J has the jump density (6), S is the stationary excess operator (defined below), and the random variables on the right-hand sides of these relations are independent. This convention applies throughout the paper; random variables occurring in the right-hand side of stochastic representation formulae are mutually independent. We also investigate the generalisation obtained by allowing the BDLP in (5) to have an arbitrary rate a while retaining the jump law (6) (Theorems 2 and 3).
J.H. Lambert (1728–1777) is credited with being the first to treat a functional equation. He solved y − y m = q for y as a power series in q. Later, Euler expressed Lambert’s equation in a more symmetric form and derived the Lambert functional equation as a limiting case; see [4]. We express Lambert’s version as x − 1 / a − x − 1 = ( 1 − a ) θ with θ ≥ 0 and a > 0 . This degenerates when a = 1 , but can be understood for all positive a by expressing it as τ ( x ) = θ , where for 0 < s ≤ 1 we have
τ ( s ) = s − 1 / a − s − 1 1 − a if a ≠ 1 , − s − 1 log s if a = 1 .
The function satisfies τ ( 0 + ) = ∞ , τ ( 1 ) = 0 and τ is convex-decreasing. Hence, there is a unique convex-decreasing solution χ ( θ ) on [ 0 , ∞ ) satisfying χ ( 0 ) = 1 ; additionally, χ ( ∞ − ) = 0 . If a = 1 , then χ ( θ ) = θ − 1 W ( θ ) , the LST of the Lambert law. One may wonder whether χ is the LST of a probability law. We show in Section 4 that the answer is yes; in fact it specifies an infdiv law, embedding the Lambert law in a one-parameter family.
Our starting point in Section 4 is the above pair of in-law equalities (i.e., (15) and (16) below) where the uniform factor U is replaced with U 1 / a , where a is a positive constant. Equivalently, the BDLP in (5) has rate a and a more general jump law. With these alterations, the perpetuity relation has a scale family of infdiv solutions, so the question is whether there is a jump law which is compatible with the stationary excess constraint. We find that the two conditions lead to a first-order differential equation, the solution of which solves the above Lambert trinomial equation, (25) below. It turns out that this solution is indeed the LST of an infdiv law which has a nice stochastic representation. The principal existence results, comprising Theorem 4 and Remark 2, follow from Lemma 2. Corollary 1 exhibits a duality between the cases a < 1 and a > 1 . Theorem 6 shows that the laws so constructed are in fact GGCs, implying that the Lambert law is not a singular instance. Corollary 2 provides yet another proof that W ∈ T B . Section 4 concludes with some tail estimates for L ( X a ) , a relation with shot-noise processes and the BDLP representation, alternative random variable representations, and the specific cases a = 1 / 2 , its dual a = 2 , and a = 1 / 3 .
The BDLP representation of an SD law on the line can be iterated to give a sequence of SD laws { L ( X n ) : n ≥ 1 } , where for n ≥ 1 the Lévy process determined by L ( X n − 1 ) is the BDLP of L ( X n ) . This construction determines an operator I : L ( X n − 1 ) ↦ L ( X n ) (Iksanov et al. [9] and references therein), and is equivalent to an earlier formulation of Urbanik [10] in terms of limit laws of normed sums of independent random variables. The continued iteration of I requires that E [ ( log | 1 + X 0 | ) n ] < ∞ for all n ≥ 1 , called the log-condition. Starting with a given infdiv law L ( X 0 ) , we refer to the sequence { I n ( L ( X 0 ) ) : n ≥ 0 } as a BDLP ladder, reflecting the nesting relation L n + 1 ⊂ L n , where L 0 comprises all infdiv laws L ( X 0 ) satisfying the log-condition and L n = I n ( L 0 ) . Elements of L n are termed n-times SD laws in [9] (p. 1364). The collective term ‘multiply SD’ is used in other papers where the concept has been studied in very general settings. Note too that the operator I is often denoted by Φ .
We stress here that our indexing L 0 , L 1 , … is a unit shift from that in the cited formulations. Here, laws in L n could be termed as order n-SD, i.e., SD laws are order 1-SD. In addition, expressions obtained for our examples and results have a tidier form.
Our interest lies in the subsets L n + = I n ( L 0 + ) , where L 0 + comprises positive infdiv laws which, with no loss of generality, have no drift components; see Berg and Forst [11] for some representation results. These authors worked with an effectively equivalent formulation in terms of sets B n ( n ≥ 0 ) of CFs C n ( θ ) , where B 0 = { C ( θ ) ∈ B } and C n ( θ ) ∈ B n if, for each α ∈ ( 0 , 1 ) , there is a CF C α ( θ ) ∈ B n − 1 such that C n ( θ ) = C n ( α θ ) + C α ( θ ) . We define BDLP ladders more closely in Section 5 and illustrate the concept with the gamma and Lambert ladders. In particular, the Lambert ladder, which can be defined by X 1 = Λ , provides a sequence of polynomial forms in W ( θ ) which are Bernstein functions.
A little general theory for BDLP ladders is developed in Section 6 which supplements the representation results in [11]. If a : = E ( X 0 ) < ∞ , then E ( X n ) = a for all n and the Formula (50) for the Lévy density of L ( X n ) implies the length-bias representation (54) generalizing a representation for positive infdiv laws developed in [12]. Theorem 9 asserts a random variable interpretation for (50) which is used to show that L ( X n ) is asymptotically degenerate (Theorem 10) with normal fluctuations around the limit (Theorem 11).
It is known that the limit set L ∞ + = ∩ n ≥ 0 L n + is the smallest set containing positive stable laws while being closed under convolution and weak convergence. The CFs of its members have the mixture form ∫ 0 1 θ α d σ ( α ) , where σ is a finite measure on ( 0 , 1 ] (Theorem 1.6 in [11]). The positive stable laws correspond to point masses. In Theorem 12, we use a general stochastic representation of the CF C n ( θ ) of L ( X n ) under a fairly strong regular variation condition on C 0 ( θ ) to show that there is a norming sequence b n → 0 such that { b n X n } converges to a positive stable law. Examples 7 and 8 alter this condition in ways which cause a partial failure of the proof of Theorem 12. However, convergence to a stable law still holds, though with a rather different form of norming sequence. There is room for more work on the limiting behaviour of L ( X n ) . BDLP ladders are related in Lemma 5 and Theorems 13 and 14 to Urbanik’s [10] representations for spectrally positive laws in L n .
We show in Section 7 how the laws developed in Section 4 arise as so-called martingale limit laws for supercritical continuous-time branching processes.
Some notation changes from section to section, but no confusion should arise.

2. W ∈ B : A Review

Two proofs yielding W ∈ B are based on the derivative formula
W ( n ) ( θ ) = ( − 1 ) n − 1 P n ( W ( θ ) ) exp ( − n W ( θ ) ) ( 1 + W ( θ ) ) 2 n − 1 ,
where P n ( x ) is a polynomial of degree n − 1 which satisfies a certain recursion relation. A very simple argument [13] shows that these polynomials are positive-valued in ( e − 1 , ∞ ) , and hence that W ′ ( θ ) is completely monotone, whence (3). Kalugin and Jeffrey [14] independently established the same result by showing that the coefficients of each polynomial P n form a positive sequence which is log-concave and unimodal.
Another pair of proofs allow us to deduce from Stieltjes transform representations that W ∈ T B . We first observe that (2) and (8) with n = 1 yield
W ′ ( θ ) = W ( θ ) θ ( 1 + W ( θ ) ) .
Pakes [13] used a complex variable argument to show that the left-hand side has the integral representation
W ′ ( θ ) = ∫ 0 ∞ ν ( d v ) θ + v ,
giving the above representation, and also that
θ − 1 W ( θ ) = ∫ e − 1 ∞ N ( y ) y ( θ + y ) d y ,
where N ( x ) = ν [ 0 , x ] is a distribution function supported in [ e − 1 , ∞ ) . Independent related arguments [15] yield the above second representation with the identification N ( y ) = π − 1 ℑ W ( − y ) , and (10) follows as a consequence.
The coefficients in the power series expansion W ′ ( θ ) = ∑ n ≥ 1 c n ( − θ ) n − 1 , where c n = n n / n ! , have an integral representation (Nuttall’s integral), which yields another demonstration [16] that W ∈ T B . This approach proceeds from an explicit algebraic expression for the inverse (i.e., quantile) function of N ( y ) in (11) (see (1.12) in [16]), implying that N has a pdf n ( y ) such that
W ′ ( θ ) = ∫ e − 1 ∞ n ( y ) θ + y d y .
The left-hand side is the Laplace transform of x ω ( x ) ; hence,
x ω ( x ) = ∫ e − 1 ∞ e − x y n ( y ) d y .
Asymptotic estimates for N ( y ) and n ( y ) when y ≫ 1 and y ≈ e − 1 are further outcomes.
Finally, it was shown in [17] how W ∈ T B follows from results about continuous branching processes (CBPs). Implicit in that paper is possibly the shortest proof that W ∈ B . This follows from the fact that any CBP ( Z t : t ≥ 0 ) is constructed as a certain random-time transformation of a spectrally positive Lévy process ( Y t ) . Interpreting Z t as the mass of a randomly changing lump of material at time t, the characteristic branching property is that components of a finite partition of the lump evolve independently with the same overall process dynamics. This implies that L ( Z t ) is infdiv for each t. Assuming that Z 0 = 1 and that the log-growth rate m = t − 1 log E ( Z t ) ∈ ( 0 , ∞ ) , the process is supercritical. Then, there exists a function η t ↓ 0 as t ↑ ∞ such that η t Z t → a . s . M (the so-called martingale limit), which is almost surely finite non-degenerate and infdiv.
If C ( θ ) is the CF of ( Y t ) , then the CF Ω ( θ ) of M solves the differential equation Ω ′ ( θ ) = C ( Ω ( θ ) ) . An admissible form is Ω ( θ ) = θ / ( 1 + θ ) , i.e., ( Y t ) is the compound Poisson process with unit jump rate and jumps have the standard exponential law. In this case, the differential equation for Ω is the same as (11). Since W ( 0 ) = Ω ( 0 ) = 0 , it follows that Ω ( θ ) = W ( θ ) , whence W ∈ B . This example satisfies some general conditions for CBPs implying that L ( M ) is SD; see Theorem 4.1 in [17].
We end this section with some results about the infdiv innovation law L ( I c ) in the autoregression representation Λ = L c Λ + I c . Its CF is
W c ( θ ) = ∫ 0 ∞ 1 − e − θ x ω c ( x ) d x = W ( θ ) − W ( c θ ) ,
where from (3) and (12) we have
ω c ( x ) : = ω ( x ) − c − 1 ω ( x / c ) = x − 1 ∫ 0 ∞ e − x y − c − 1 e − x y / c n ( y ) d y = x − 1 ∫ 0 ∞ e − x y ( n ( y ) − c n ( c y ) ) d y .
Lemma 1. 
(a) The innovation law L ( I c ) is compound-Poisson; ∫ 0 ∞ ω c ( d y ) = W c ( ∞ − ) = A : = − log c < ∞ .
(b) The Lévy density ω c ( x ) satisfies the asymptotic relation as x ↓ 0 ,
∫ 0 x y ω c ( y ) d y ∼ A x ( log x ) 2 .
Proof. 
Assertion (a) follows from the large θ expansion, W ( θ ) = log θ − ( log log θ ) ( 1 + O ( 1 / log θ ) ) . Similarly, using (9), as θ → ∞ we have
W c ′ ( θ ) = ∫ 0 ∞ x ω c ( x ) e − θ x d x = W ′ ( θ ) − c W ′ ( c θ ) = θ − 1 W ( θ ) − W ( c θ ) ( 1 + W ( θ ) ) ( 1 + W ( c θ ) ) ∼ A θ log θ 2 .
Assertion (b) follows from the (Tauberian) Theorem 1.7.1′ in [18]. □
Formal differentiation in part (b) suggests that x ω c ( x ) ∼ A log x − 2 . This is supported by a tedious calculation which yields
θ W c ′ ( θ ) = A W 2 ( θ ) + A 2 − 2 A W 3 ( θ ) 1 + o ( 1 ) .
Observe that (13) exhibits x ω c ( x ) as a Laplace transform. However, n ( y ) − c n ( c y ) must change sign within its support, because if it is non-negative then ω c ( x ) would be the Lévy density of a Thorin–Bernstein function and hence L ( I c ) could not be compound-Poisson.

3. The Random Perpetuity Representation

Jurek [8] explains how the BDLP representation (5) yields a random perpetuity representation. Let τ n denote the n-th jump time of the compound Poisson BDLP. Since τ n is a stopping time with respect to ( B t ) , we have
Λ = e − τ n J n + ∫ 0 + ∞ e − t d B t + τ n . = L V n J n + Λ ˜ n ,
where Λ ˜ n is an independent copy of Λ , V n = e − τ n , J n = B ( τ n ) and is equal to the sum of n independent copies of J 1 , and V n , J n , and Λ ˜ n are all independent. In addition, V n has density v n ( u ) = ( − log u ) n − 1 / n ! , where 0 < u ≤ 1 . The random difference Equation (14) comprises the perpetuity relations satisfied by the Lambert law.
From now on, we consider only the case with n = 1 , writing (14) as
X = L U ( X + J ) ,
where U = V 1 has the standard uniform law, J = J 1 , and the random variables on the right-hand side are independent. Thus, L ( Λ ) satisfies (15) and E ( Λ ) = E ( J ) . Since E ( Λ ) = W ′ ( 0 ) = 1 , we have E ( J ) = 1 .
We need the following preliminaries for Theorem 1 below, which characterises the Lambert law: if X has a distribution function (DF) F supported in [ 0 , ∞ ) and a finite mean μ > 0 , then we define the stationary excess DF corresponding to F as
( S F ) ( x ) = μ − 1 ∫ 0 x F ¯ ( y ) d y ,
where S is called the stationary-excess operator; see Whitt [19]. In addition, S X denotes any random variable having the DF S F . If ψ ( θ ) = E e − θ X denotes the LST of X, then the LST of S X is ( 1 − ψ ( θ ) ) / ( μ θ ) . The LST of the product U X , where the factors are independent and U has the standard uniform law, is θ − 1 ∫ 0 θ ψ ( y ) d y . Finally, ( Λ t : t ≥ 0 ) denotes the Lambert subordinator; E ( e − θ Λ t ) = e − t W ( θ ) . Recall the definition of ω B in (6).
Theorem 1. 
(a) The Lambert law L ( Λ ) satisfies the perpetuity relation (15) and also satisfies Λ = L U S J . In addition, J = L Λ ϵ , where ϵ has the standard exponential law and is independent of ( Λ t ) .
(b) Conversely, suppose that J is a non-negative random variable with a finite mean μ > 0 . If X satisfies (15) and the stationary-excess condition
X = L U S J ,
then X = L μ Λ and J / μ has the density ω B .
Proof. 
If J has the density ω B , then its LST is
j ( θ ) = ω ^ B ( θ ) = ∫ 0 ∞ z θ + z ν ( d z ) .
Hence, the LST of S J is
1 − j ( θ ) θ = ∫ 0 ∞ ν ( d z ) θ + z = W ′ ( θ ) ,
using (10). Thus, the LST of U S J is θ − 1 ∫ 0 θ W ′ ( y ) d y = W ( θ ) / θ , i.e., Λ = L U S J . This proves the direct assertion. Note that in light of (9) and (17) the above LST of J can be expressed as
j ( θ ) = 1 + W ( θ ) − 1 ,
implying the second assertion of (a).
To prove the converse, let x ( θ ) and j ( θ ) denote the LSTs of X and J in the perpetuity relation (15); note that its LST version is
x ( θ ) = θ − 1 ∫ 0 θ x ( y ) j ( y ) d y .
Writing w ( θ ) = θ x ( θ ) , we have w ′ ( θ ) = w ( θ ) j ( θ ) / θ . The condition in (16) yields the relation
w ( θ ) = ∫ 0 θ 1 − j ( y ) μ y d y .
Differentiating and equating the two forms of w ′ yields
j ( θ ) = 1 + μ w ( θ ) − 1 ,
and hence the differential equation
w ′ ( θ ) = w ( θ ) θ ( 1 + μ w ( θ ) ) .
Separating variables and integrating yields log w ( θ ) + μ w ( θ ) = log ( K θ ) , where K is an arbitrary constant. Rearranging gives w ( θ ) exp ( μ w ( θ ) ) = K θ , so it follows from (2) that x ( θ ) = W ( K μ θ ) / ( μ θ ) . However, W ′ ( 0 ) = 1 together with the context requires that x ( 0 ) = 1 ; thus, it follows that K = 1 , and hence that X = μ Λ , as asserted. The assertion about L ( J ) follows by comparing (18) and (19). □
As motivation for the next section, we may ask which laws we obtain by running the compound Poisson process in (5) at rate a > 0 ? The answer is given by the following result, which extends Theorem 1.
Theorem 2. 
(a) If a > 0 and
Λ a : = ∫ 0 ∞ e − t d B a t = ∫ 0 ∞ e − t / a d B t ,
then L ( Λ a ) is the one-dimensional law of the Lambert subordinator at time a. It satisfies the perpetuity relation
Λ a = L U a ( Λ a + J ) ,
where U a : = U 1 / a has the density function a u a − 1 for 0 < u < 1 and L ( J ) has the LST (18).
(b) If a ≥ 1 , then the extended stationary excess relation holds:
Λ a = L U a ( Λ a − 1 + S J ) , ( a ≥ 1 ) .
Proof. 
Referring to (17), the CF of ( B a t ) is a ( 1 − j ( θ ) ) = a θ W ′ ( θ ) , and hence the CF of the SD law L ( Λ a ) is a W ( θ ) , proving the first assertion. The perpetuity relation (20) follows in the same way as (14).
Next, since Λ 0 = L 0 , (21) indeed reduces to (16) if a = 1 . To prove the general relation, observe first that if R is a positive random variable with LST r ( θ ) and independent of U a , then the LST of the product U a R is
E [ r ( U a θ ) ] = a ∫ 0 1 r ( u θ ) u a − 1 = a θ − a ∫ 0 θ r ( y ) y a − 1 d y .
Assuming that R can be chosen so that Λ a = L U a R , we can equate this product LST with ( W ( θ ) / θ ) a , the LST of Λ a , to obtain W a ( θ ) = a ∫ 0 θ r ( y ) y a − 1 d y . Differentiation yields r ( θ ) = ( W ( θ ) / θ ) a − 1 W ′ ( θ ) . The first factor is the LST of Λ a − 1 if a ≥ 1 , so in view of (17) we see that R = L Λ a − 1 + S J , and (21) follows. □
If a is sufficiently large, then the relation (21) can be iterated to express Λ a in terms of Λ ⟨ a ⟩ , where the subscript denotes the fractional part of a. For a trivial example, if a = 2 , then Λ ⟨ a ⟩ = 0 and
Λ 2 = L U 1 , 2 ( S J 1 + U 2 , 2 S J 2 ) ,
where for i = 1 , 2 we have U i , 2 as independent copies of U and J i as independent copies of J.
Canceling the factors U a between (20) and (21) yields the balance identity
Λ a + J = L Λ a − 1 + S J .
The designation is explained by the fact that Λ a is stochastically increasing in a; equating the identities (15) (with X = Λ ) and (16) shows that S J = L J + Λ , i.e., S J is stochastically larger than J.
We end this section with the following generalisation of (20). Given p ∈ [ 0 , 1 ] , let I p denote a random variable having the Bernoulli ( p ) law, i.e., P ( I p = 1 ) = p .
Theorem 3. 
Let γ be a positive constant, a ∈ ( 0 , γ ] and p = a / γ . Then,
Λ a = L U γ ( Λ a + I p J ) .
Proof. 
Following the idea leading to (21), we seek a random variable R such that Λ a = L U γ R . As above, this produces the identity θ γ − a W a ( θ ) = γ ∫ 0 θ r ( y ) y γ − 1 d y , and hence
r ( θ ) = ( 1 − p ) W ( θ ) θ a + p W ′ ( θ ) W ( θ ) θ a − 1 = W ( θ ) θ a 1 − p + p θ W ′ ( θ ) W ( θ ) .
It follows from (9) that
θ W ′ ( θ ) W ( θ ) = 1 1 + W ( θ ) = j ( θ ) ,
whence R = L Λ a + I p J and the assertion follows. □

4. Embedding the Lambert Law

In the last section, we tried to find a version of the stationary-excess condition (16) applicable to an arbitrary Poisson jump rate a while keeping the jump law of the Lambert BDLP fixed. Here, we fix the jump rate a and show that there is a scale family solution to the pair of in-law equations
X = L U a ( X + J ) & X = L U a S J ,
where we recall that U a = U 1 / a ; other notation and independence assumptions are as in Section 3, except that L ( X ) and L ( J ) will depend on a, a dependence we usually suppress in our notation.
Given L ( J ) having a finite mean μ , the perpetuity condition has a unique solution L ( X ) for which the LST is
χ ( θ ) = exp − a ∫ 0 ∞ 1 − e − θ x x − 1 F ¯ J ( x ) d x ,
where F ¯ J ( x ) = P ( J > x ) ; see, e.g., p. 764 in [20] and references therein. Note that the finite mean condition is sufficient but not necessary. Our restriction to this condition is to ensure that the stationary-excess condition is not vacuous. It is clear that L ( X ) is SD, and we will call it a perpetuity law. Thus, our problem is whether there is a law L ( J ) such that the second condition in (22) holds. Theorem 5 below gives an affirmative answer, following from the preliminary results in Lemma 2, Theorem 4, and Remark 2.
Given a positive constant μ , let L ( μ ) = { L ( J ) : P ( J ≥ 0 ) = 1 , E ( J ) = μ } . We also define the following parameter: if 0 < a ≠ 1 , then
q = a | 1 − a | .
Observe that
q / a = 1 + q if 0 < a < 1 , q − 1 if a > 1 .
Lemma 2. 
Fix positive constants a ≠ 1 and μ. If there exists L ( J ) in L ( μ ) such that the two conditions of (22) are satisfied, then the LST χ of L ( X ) solves the trinomial equation
χ − 1 / a − χ − 1 = ( 1 − a ) μ θ .
In addition, L ( J ) is infdiv and satisfies
P ( J = 0 ) = 0 if a < 1 , 1 − a − 1 if a > 1 .
Proof. 
The right-hand sides of the identities (22) are equal in law and the factors U a can be cancelled, yielding S J = L X + J . Defining j ( θ ) = E [ exp ( − θ J ) ] , it follows that χ ( θ ) j ( θ ) = ( 1 − j ( θ ) ) / ( μ θ ) , i.e.,
j ( θ ) = 1 1 + μ θ χ ( θ ) .
The stationary-excess condition yields the identity
μ θ a χ ( θ ) = a ∫ 0 θ ( 1 − j ( y ) ) y a − 2 d y .
Differentiating and eliminating j ( θ ) yields the first-order differential equation
χ ′ ( θ ) = − a μ χ 2 ( θ ) 1 + μ θ χ ( θ ) .
This can be recast as a linear first-order equation for θ as a function of χ ,
d θ d χ + θ a χ = − 1 a μ χ 2 .
Assuming now that a ≠ 1 , solving this subject to χ ( 0 ) = 1 yields (25).
Using (25) to eliminate μ θ in (26) yields the general expression
j ( θ ) = ( 1 − a ) χ − 1 ( θ ) χ − 1 / a ( θ ) − a χ − 1 ( θ ) .
If a < 1 , then
j ( θ ) = ( 1 − a ) χ 1 / q ( θ ) 1 − a χ 1 / q ( θ ) .
Let ( X t : t ≥ 0 ) denote the subordinator with X 1 = L X . It follows from (28) that J = L ∑ n = 1 N Y n , where Y n are independent copies of X 1 / q and independent of N, which has the geometric law P ( N = n ) = ( 1 − a ) a n − 1 for n ≥ 1 . Hence, j ( θ ) is an infdiv LST; see, e.g., p. 84 in [1].
If a > 1 , then we can let p = 1 / a and rearrange (27) to obtain
j ( θ ) = 1 − p 1 − p χ 1 / q ( θ ) ,
so j ( θ ) is again an infdiv LST.
We know from (23) that for arbitrary a, L ( X ) is SD; hence, χ ( ∞ − ) = 0 . The assertion about P ( J = 0 ) follows from (28) and (29). In particular, if a > 1 , then P ( J = 0 ) = 1 − p . □
Remark 1. 
We see from (25) that μ functions as a scale constant, so we can (and will, with no loss of generality) set μ = 1 in what follows; thus, E ( J ) = 1 .
We pause to remind the reader of Sato’s classification of infdiv laws on p. 65 of [21]. Here, we are concerned only with cases where there is no drift or Gaussian component and where, with reference to (1), the Lévy measure, say L , is supported in [ 0 , ∞ ) . We say that the corresponding law is of Type A if L ( [ 0 , 1 ) ) < ∞ , in which case the law is compound Poisson, and that it is of Type B if L ( [ 0 , 1 ) ) = ∞ and ∫ 0 1 x L ( d x ) < ∞ , in which case the infdiv law is supported on [ 0 , ∞ ) and assigns zero mass to { 0 } . The law is of Type C if ∫ 0 1 x L ( d x ) = ∞ , in which case there is an intrinsic negative drift which makes the law two-sided. For Types A and B, almost all sample paths of the corresponding Lévy processes have bounded variation in compact intervals and have unbounded variation for Type C.
We know from the results in Section 3 that with a = 1 (the Lambert case), L ( J ) is of Type B and Lemma 2 directly extends this outcome to the case with a ≤ 1 . The above discussion shows that despite the final assertion of Lemma 2, L ( J ) can be chosen to be Type B for all a. The case with a < 1 seems more fundamental in the sense that L ( X ) , as exhibited in Theorem 5 below, has a simpler form. The following corollary shows how the cases with a < 1 and a > 1 are related.
Corollary 1. 
Let χ ( θ ; a ) denote the solution of (25) for a ≠ 1 . If a > 1 , then
χ ( θ ; a ) = χ ( a θ ; a − 1 ) a .
Proof. 
Replace a in (25) with a − 1 to obtain χ ( θ ; a − 1 ) − a − χ ( θ ; a − 1 ) − 1 = ( 1 − a − 1 ) μ θ and then replace θ with α θ . The assertion follows. □
In order to show that the conditions in (22) are not vacuous, it remains to be shown that any solution of (25) satisfying χ ( 0 ) = 1 is the LST of a probability law. The constant μ functions as a scale parameter, and to lessen the notational burden we will, without loss of generality, set μ = 1 in (25). Below, we use the (formal) identity
d n − 1 d x n − 1 x r x = 1 = r ( r − 1 ) ⋯ ( r − n + 2 ) = Γ ( r + 1 ) Γ ( r − n + 2 ) .
Theorem 4. 
Let t > 0 and 0 < a < 1 (so q = a / ( 1 − a ) ); then, positive powers of the solution of (25) have a power series representation that converges for all complex-valued θ:
χ t ( θ ) = ∑ n = 0 ∞ [ − ( 1 − a ) θ ] n n ! · M n ; a , t ,
where
M ( s ; a , t ) = Γ ( 1 + q t ) Γ ( q t ) · Γ ( q t + q s / a ) Γ ( 1 + q t + q s ) .
In addition, M ( s ; a , t ) is the bilateral LST of a spectrally positive Type C infdiv law, say M ( s ; a , t ) = E e − Y ( a , t ) . Finally, χ t ( s ) is the LST of the infdiv random variable
X a , t = L ( 1 − a ) e − Y ( a , t ) .
Proof. 
Defining ζ = 1 − χ 1 / q , we can cast (25) (with μ = 1 ) into the canonical form ζ = θ ( 1 − a ) f ( ζ ) , where f ( ζ ) = ( 1 − ζ ) 1 + q is analytic in the open unit disc; in addition, χ t = ( 1 − ζ ) q t . The Lagrange expansion (e.g., p. 145 in [22]) is applicable with the outcome
χ t ( θ ) = 1 − q t ∑ n = 1 ∞ [ ( 1 − a ) θ ] n n ! C n
where, using (30),
C n = d n − 1 d ζ n − 1 ( 1 − ζ ) ( q + 1 ) n + q t − 1 ζ = 0 = ( − 1 ) ( n − 1 ) Γ ( ( q + 1 ) n + q t ) Γ ( ( q + 1 ) n + q t − 1 − n + 2 ) = ( − 1 ) n − 1 Γ ( q t + q n / a ) Γ ( 1 + q t + q n ) .
This establishes (31). It follows from the asymptotic equivalence Γ ( a + z ) / Γ ( b + z ) ∼ z a − b as z → ∞ (#5.11.12 in [3]) that C n = O n − 1 , and hence that χ t ( θ ) is an entire function.
The first gamma function quotient in (32) equals q t , and hence M ( n ; a , t ) = q t | C n | . We interpret the second gamma function quotient in (32) using Theorem 3.1 in [23], which asserts conditions under which such a quotient is the bilateral Laplace transform of a spectrally positive infdiv law and specifies an explicit expression for the corresponding Lévy density. This outcome is in essence a consequence of the integral representation of log Γ ( z ) derived by integrating the (Gauss) representation for the ψ -function, #5.9.12 in [3]. Comparing the algebraic form of (32) with (3.2) in [23], it follows that M ( s ; a , t ) is the bilateral LST of L ( Y ( a , t ) ) , as asserted, and that its Lévy density is
ℓ < 1 ( y ) = y − 1 e − a t y 1 − e − ( 1 − a ) y − e − ( t + 1 / q ) y 1 − e − y / q .
Moreover, the sequence ( M ( n ; a , t ) : n = 0 , 1 , … ) comprises the elements of the moment sequence of the positive random variable exp ( − Y ( a , t ) ) . The asymptotic estimate ( Γ ( A + q z ) ) 1 / z ∼ e − q ( q z ) q ( z → ∞ ) shows that ( M ( n ; a , t ) ) 1 / n converges to a positive constant as n → ∞ , and hence that χ t ( θ ) is an entire function of θ , meaning that this moment sequence is determinate. It follows for each t > 0 that χ t ( θ ) is the LST of L ( X a , t ) , as specified by (33). We conclude that χ ( θ ) is the LST of a positive infdiv random variable X a = X a , 1 , and hence that L ( X a , t ) is the law of a subordinator at time t. □
Remark 2. 
If a > 1 , then q = a / ( a − 1 ) and the above assertions hold with the following alterations. Defining ζ = 1 − χ 1 / q , we have χ t = ( 1 − ζ ) q t , and (25) becomes ζ = ( a − 1 ) θ ( 1 − ζ ) q . Lagrange reversion and arguing as above yields
χ t ( θ ) = ∑ n = 0 ∞ [ − ( a − 1 ) θ ] n n ! M ( n ; a , t ) ,
where
M ( s ; a , t ) = Γ ( 1 + q t ) Γ ( q t ) . Γ ( q t + q s ) Γ ( 1 + q t + q s / a )
is the bilateral LST of the Type-C infdiv random variable Y ( a , t ) , for which the Lévy density is
ℓ > 1 ( y ) = 1 y · e − t y 1 − e − t y / q − e − ( a − 1 + a t ) y 1 − e − ( a − 1 ) y = ℓ < 1 ( y : a − 1 , a t ) .
The relation connecting ℓ < 1 ( · ) and ℓ > 1 ( · ) reflects Corollary 1. Finally, X a , t = ( a − 1 ) exp ( − Y ( a , t ) ) .
The proof of Theorem 4 does not show whether or not L ( X a ) is SD. The next result shows that it is in fact a perpetuity law, and hence SD, as explained following (22). The proof is in essence a ‘reverse engineering’ of the proof of Lemma 2.
Theorem 5. 
If 0 < a ≠ 1 , then the law L ( X a ) of Theorem 4 and Remark 2 satisfies (22) with L ( J ) having the LST (29). In particular, L ( X a ) is SD and E ( X a ) = a .
Proof. 
Computing 1 − j ( θ ) from (26) yields
1 − j ( θ ) = 1 − χ 1 / q ( θ ) 1 − a χ 1 / q ( θ ) = χ 1 / a ( θ ) · χ − 1 / a ( θ ) − χ − 1 ( θ ) 1 − a χ 1 / q ( θ ) .
It follows from (25) that
1 − j ( θ ) θ = 1 − a χ − 1 / a ( θ ) − a χ − 1 ( θ ) .
On the other hand, differentiating (25) yields
− χ ′ ( θ ) a χ ( θ ) = 1 − a χ − 1 / a ( θ ) − a χ − 1 ( θ ) = 1 − j ( θ ) θ .
Recalling that E ( J ) = 1 , this identity implies that E ( X a ) = a .
Write the identity as θ χ ′ ( θ ) + a χ ( θ ) = a χ ( θ ) j ( θ ) , i.e., ( θ a χ ( θ ) ) ′ = a θ a − 1 χ ( θ ) j ( θ ) and integrate to obtain the identity
θ a χ ( θ ) = a ∫ 0 θ χ ( y ) j ( y ) y a − 1 d y = ∫ 0 θ χ ( y ) j ( y ) d y a .
Substituting y a = θ a u yields χ ( θ ) = ∫ 0 1 χ ( θ u 1 / a ) j ( θ u 1 / a ) d u , i.e.,
E e − θ X a = E e − θ U a ( X a + J ) ,
the LST version of the perpetuity condition in (22).
Finally, it follows from (25) and (34), and 1 / a = 1 + 1 / q that
1 − j ( θ ) θ = ( 1 − a ) χ 1 / a ( θ ) 1 − a χ 1 / q ( θ ) = χ ( θ ) j ( θ ) .
Hence, S J = L X a + J , implying that U a S J = L U a ( X a + J ) = L X a and both conditions of (22) hold. □
Our final general result shows that L ( X a ) is a GGC for all 0 < a ≠ 1 . We need the following concepts. First, let 0 < a ≤ 1 and L ( S a ) denote the standard positive stable law with index a. Denote its density function by σ a ( x ) . A known identity is E ( S a − s ) = Γ ( 1 + s / a ) / Γ ( 1 + s ) , which is finite if s ≥ 0 . Next, if Z ≥ 0 is a random variable with distribution function F ( z ) and moment function M ( s ) = E ( Z s ) which is finite at least for s ∈ [ 0 , r ] , some r > 0 , then the order-r length biased version of Z is the random variable L r Z for which the distribution function d F Z ( z ) ∝ z r d F ( z ) (equivalently, its moment function) is M ( r + s ) / M ( r ) .
Theorem 6. 
If 0 < a ≠ 1 , then L ( X a ) is a GGC.
Proof. 
The proof is in three parts. (a) Denote the CF of L ( X a ) by
ω ( θ ; a ) = − log χ ( θ ; a ) = ∫ 0 ∞ 1 − e − θ x l ( x , a ) d x ;
Theorem 4 implies that there is no drift term. It follows from Corollary 1 that if a > 1 , then ω ( θ ; a ) = a ω ( a θ ; a − 1 ) , i.e.,
∫ 0 ∞ 1 − e − θ x l ( x , a ) d x = a ∫ 0 ∞ 1 − e − a θ x l ( x , a − 1 ) d x .
It follows that l ( x ; a ) = l ( x / a ; a − 1 ) . Hence, if x l ( x ; a ) is completely monotone when a < 1 , then this also holds if a > 1 .
(b) Thus, it suffices to consider the case with a < 1 . Referring to the proof of Theorem 4, recall that we defined ζ = 1 − χ 1 / q so that ζ = θ ( 1 − a ) f ( ζ ) , where f ( ζ ) = ( 1 − ζ ) 1 + q . We seek an expression for the CF (suppressing explicit a dependence), say ω ( θ ) = − q − 1 log ( 1 − ζ ) = g ( ζ ) . Hence, g ′ ( ζ ) = q ( 1 − ζ ) − 1 . Lagrange reversion yields
ω ( θ ) = q − 1 ∑ n = 1 ∞ [ ( 1 − a ) θ ] n n ! Δ n ,
where
Δ n = d n − 1 d ζ n − 1 ( 1 − ζ ) n ( 1 + q ) − 1 ζ = 0 = ( − 1 ) n − 1 Γ ( ( 1 + q ) n ) Γ ( ( 1 + q ) n − 1 − n + 2 ) = ( − 1 ) n − 1 Γ ( q n / a ) Γ ( 1 + q n ) ,
where the last equality follows because 1 + q = q / a . Hence, term-wise differentiation, which is valid here, yields
ω ′ ( θ ) = ∫ 0 ∞ e − θ x x l ( x ) d x = 1 − a q ∑ n = 0 ∞ [ − ( 1 − a ) θ ] n n ! Γ ( q ( 1 + n ) / a ) Γ ( 1 + q + q n ) = 1 − a q 2 ∑ n = 0 ∞ [ − ( 1 − a ) θ ] n n ! · 1 n + 1 · Γ ( q ( 1 + n ) / a ) Γ ( q + q n ) .
Observing that E ( S a − q n ) = Γ ( q n / a ) / a Γ ( q n ) , we see that the last gamma function quotient is proportional to E ( T n ) , where T = L L 1 ( S a − q ) . Hence, ω ′ ( θ ) ∝ E e − θ ( 1 − a ) Z , where Z = L U T .
Recalling that σ a ( x ) denotes the pdf of S a , it follows that the pdf of S a − q is q − 1 x − 1 − 1 / q σ a x − 1 / q , and hence that the pdf of T is ∝ x − 1 / q σ a x − 1 / q . We conclude that
x l ( x ) = K ∫ x ∞ y − 1 − 1 / q σ a y − 1 / q d y .
(c) Observe that the characteristic function of S a is
E ( e i τ S a ) = e − ( − i τ ) a = exp − | τ | a e ( i π a / 2 ) s i g n ( τ ) .
Comparing this with (4.4.14) in [24] and then with (4.4.12) there, we can note that for us the parameters β = 1 and Φ = π a / 2 in [24] will lead to the following integral representation: if x > 0 , then
σ a ( x ) = π − 1 q x − 1 − q ∫ − π / 2 π / 2 e − x − q U ( v ) U ( v ) d v ,
where
U ( v ) = sin ( a ( v + π / 2 ) ) cos v q · cos ( π a / 2 − ( 1 − a ) v ) cos v
and U ( v ) > 0 if − π / 2 < v < π / 2 . Consequently,
σ a ( y − 1 / q ) = π − 1 q y 1 + 1 / q ∫ − π / 2 π / 2 e − y U ( v ) U ( v ) d v ,
i.e., the function y − 1 − 1 / q σ a ( y − 1 / q ) is CM. It follows that x l ( x ) is CM, and hence that C ( θ ) ∈ T B . The assertion follows. □
The above results provide another proof that the Lambert W is a Thorin–Bernstein function, as follows.
Corollary 2. 
(a) The limit
χ ( θ ; 1 ) : = lim a → 1 χ ( θ ; a ) = W ( θ ) / θ = exp ( − W ( θ )
is the LST of a GGC law.
(b) The moment function of the Lambert subordinator is
E ( Λ t s ) = t ( t + s ) s − 1 .
Proof. 
(a) Let a < 1 , write (25) (with μ = 1 ) as
χ ( θ ; a ) − χ 1 / a ( θ ; a ) 1 − a = θ χ 1 + 1 / a ( θ ; a ) ,
and let a → 1 , evaluating the left-hand side using L’Hopitâl’s rule. The result is
− ∂ χ ( θ ; a ) ∂ a a = 1 + a − 1 ∂ χ ( θ ; a ) ∂ a a = 1 − χ ( θ ; 1 ) log χ ( θ ; 1 ) = θ χ 2 ( θ ; 1 ) ,
i.e., log χ ( θ ; 1 ) = − θ χ ( θ ; 1 ) . Set w ( θ ) = χ ( θ ; 1 ) to obtain exp ( − w ( θ ) ) = w ( θ ) / θ , which using (2) implies that w ( θ ) = W ( θ ) . However, χ ( θ ; 1 ) is the limiting LST of a family of GGC laws; hence, L ( X 1 ) is itself a GGC.
(b) Taking the case a < 1 , it follows from (31) and (32), the gamma function functional equation, and q + 1 = q / a that
E X a , t s = ( 1 − a ) s t t + s Γ ( q ( t + s ) + s ) Γ ( q ( t + s ) ) .
The gamma function quotient ∼ [ q ( t + s ) ] s as a ↑ 1 ; thus, it follows that E ( X a , t ) → t ( t + s ) s − 1 . On the other hand, Assertion (a) implies that X a , t → L Λ t ; hence, Assertion (b) follows from a moment function convergence theorem, e.g., Theorem 30.2 in [25]. □
The following result asserts the asymptotic form of χ ( θ ) as θ → ∞ , which in turn implies the left-hand tail behaviour of L ( X ) .
Lemma 3. 
As θ → ∞ ,
χ ( θ ; a ) ∼ ( 1 − a ) θ − a i f a < 1 , ( a − 1 ) θ − 1 i f a > 1 .
Hence, as x → 0 + ,
P ( X a ≤ x ) ∼ ( 1 − a ) − a x a Γ ( 1 + a ) if a < 1 , x a − 1 if a > 1 .
Proof. 
It is evident from (25) that χ ( θ ) → 0 as θ → ∞ , and the convergence rates easily follow. The left-hand tail estimates follow from a Tauberian theorem, e.g., p. 38 in [18]. □
It follows from these asymptotic estimates and Theorem 1 in [26] that L ( X a ) is the limiting law of a shot noise process. Define the stochastic process ( Y t : t ≥ 0 ) , where
Y t = ∑ τ i ≤ t Π i e − κ ( t − τ i ) ,
in which the noise impulses Π i are independent copies of Π > 0 , the τ i are the jump times of an independent Poisson process having rate r, and κ is a positive constant. The notation in [26] differs from ours; Theorem 1 in this reference implies that if ( Y t ) has the limit law L ( X a ) , then r / κ = a ∧ 1 and π ( θ ) : = E e − θ Π = 1 − ( r / κ ) θ ω ′ ( θ ; a ) .
It follows immediately from (35) that if 0 < a < 1 , then π ( θ ) = j ( θ ) . If a > 1 , then using (25) to eliminate 1 − a in (35) leads after some algebra to
π ( θ ) = ( 1 − p ) χ 1 / q ( θ ) 1 − p χ 1 / q ( θ ) = j ( θ ) χ 1 / q ( θ ) ,
the second equality following from (29). If we set κ = 1 , then ( Y t ) is the BDLP of the SD law L ( X a ) , i.e., a compound Poisson process for which the jump rate is a ∧ 1 and a jump law for which the LST is π ( θ ) ; see (3) in [26]. This outcome can also be inferred from identities derived above.
The case a = 1 corresponds to the Lambert law; then, χ 1 ( θ ) = W ( θ ) / θ ∼ ( log θ ) / θ as θ → ∞ , and it follows that
P ( Λ ≤ x ) ∼ x log ( x − 1 ) , ( x → 0 + ) .
It follows too from (9) that
π ( θ ) = 1 + W ( θ ) − 1 = E e − θ Λ ϵ ,
i.e., L ( Π ) is the law of the Lambert subordinator stopped at a random independent time having the unit exponential law.
Another consequence from Lemma 3 is that the density function f ( x ; a ) of L ( X a ) is non-increasing in ( 0 , ∞ ) . The SD nature of L ( X a ) implies the existence of f ( x ; a ) and that it is unimodal. Moreover, f ( x ; 1 ) , the Lambert case, is completely monotone (Theorem 3.2 in [12]). For a < 1 , it follows from the distribution function estimate in Lemma 3 that f ( 0 + ; a ) = ∞ , the mode is at the origin. In general, the so-called canonical density k ( x ; a ) : = x ℓ ( x ; a ) of L ( X a ) is non-increasing, a fundamental SD property. Its Laplace-transform is
k ^ ( θ ) = − χ ′ ( θ ; a ) χ ( θ ; a ) = a χ ( θ ; a ) 1 + θ χ ( θ ; a ) ,
where the final evaluation is a rearrangement of the evaluation of χ ′ ( θ ; a ) in the proof of Lemma 2. For a > 1 , it follows from Lemma 3 that k ^ ( θ ; a ) ∼ θ − 1 as θ → ∞ , and hence that k ( 0 + ; a ) = 1 , invoking Theorem 1.7.2b in [18]. T together with Theorem 2.17 on p. 236 in [1] or Theorem 53.4(ii) in [21], this outcome implies that f ( x ; a ) is non-increasing. Summarising, if a > 0 , then f ( x ; a ) has its unique mode at the origin.
We turn now to random variable representations. The representation X a , t = L | a − 1 | e − Y ( a , t ) inherent in Theorem 4 and Remark 2 is one of many possibilities. It provides tidier versions of the above Lévy densities that emerge by applying the basic gamma function relation to the quotients in (32) and Remark 2 to obtain
E ( X a , t s ) = ( 1 − a ) s · t t + s · Γ ( q t + q s / a ) Γ ( q t + q s ) if a < 1 , ( a − 1 ) s · a t a t + s · Γ ( q t + q s ) Γ ( q t + q s / a ) if a > 1 .
Here, the gamma function quotients are again the bilateral Laplace transforms of a Type-C infdiv random variable Y ˜ ( a , t ) . As above, it follows that
X a , t = L ( 1 − a ) U 1 / t e − Y ˜ ( a , t ) if 0 < a < 1 , ( a − 1 ) U 1 / a t e − Y ˜ ( a , t ) if a > 1 .
In addition, from Theorem 3.1 in [23], the Lévy density of Y ˜ ( a , t ) is
ℓ ˜ ( y ) = y − 1 e − a t y 1 − e − ( 1 − a ) y − e − t y 1 − e − y / q if a < 1 , y − 1 e − t y 1 − e − y / q − e − a t y 1 − e − ( a − 1 ) y if a > 1 .
Lemma 3.1 in [23] yields a representation of Y ( a , t ) and Y ˜ ( a , t ) as infinite series of independent random terms. The nth term is a weighted and centred version of the product I n ϵ n , where I n has a Bernoulli law depending on n, ϵ n have unit exponential laws, and these factors are independent; hence, X a , t has representations as an infinite product of independent factors.
A quite different representation involves a length-biased version of negative powers of the positive stable random variable S a , where a < 1 . Recall that E ( S a − s ) = a − 1 Γ ( s / a ) / Γ ( s ) and let L ( B c , d ) denote the beta law with parameters c and d. Note too that E ( U s / t ) = t / ( s + t ) . Our representation follows from (36) and Lemma 2.1 in [23], which when read in reverse asserts a random variable representation for moment functions expressed as gamma function quotients having the form in (36).
Lemma 4. 
If 0 < a ≠ 1 , then
X a , t = L ( 1 − a ) U 1 / t B q t , t 1 + q L t S a − q if 0 < a < 1 , ( a − 1 ) U 1 / a t B q t , a t q L a t S 1 / a − ( q − 1 ) if a > 1 .
These representations substantially simplify in the case with t = q − 1 , in which case it follows from (36) that
X a , q − 1 = L ( 1 − a ) U S a − 1 q if 0 < a < 1 , ( a − 1 ) U S 1 / a − 1 q / a if a > 1 .
In particular, if a > 1 , then X a , q = L a X 1 / a , q ¯ , where q ¯ = ( a − 1 ) − 1 = a − 1 / ( 1 − a − 1 ) , which is another manifestation of Corollary 1.
We next look at some examples.
Example 1. 
If a = 1 2 , then (25) is a quadratic equation to which the relevant solution is
χ ( θ ; 1 2 ) = 2 1 + 1 + 2 θ .
If ε has the standard exponential law, then
ξ ( θ ) : = E e − 2 θ ε 2 S 1 / 2 = E e − ε 2 θ = 1 + 2 θ − 1 .
Though not relevant here, this is the LST of a positive Linnik law.
If Z is a positive random variable with LST ζ ( θ ) , then we define the exponential-tilt operator τ ρ such that
P ( τ ρ ( Z ) ∈ d x ) = e − ρ x P ( Z ∈ d x ) ζ ( ρ ) ,
provided that the denominator is finite. If ρ > 0 , this is the case; then,
E e − θ τ ρ ( Z ) = ζ ( ρ + θ ) ζ ( ρ ) .
Observing that χ ( θ ; 1 2 ) = ξ ( 1 2 + θ ) / ξ ( 1 2 ) , we have the representation
X 1 / 2 = L τ 1 / 2 ( ε 2 S 1 / 2 ) .
On the other hand, referring to Lemma 3, we have the equivalent representation
X 1 / 2 = L 1 2 U S 1 / 2 − 1 .
This representation yields evaluation of the density function as
f ( x ; 1 2 ) = ( π x ) − 1 2 ∫ 1 ∞ v − 3 / 2 e − x v d v ,
a completely monotone function.
Finally, noting that
χ ( θ ; 1 2 ) = θ − 1 1 + 2 θ − 1 ,
binomial expansion leads to the moment identity
E X 1 / 2 n = 2 n Γ ( n + 1 2 ) ( n + 1 ) Γ ( 1 2 ) .
On the other hand, it follows from Theorem 4 that
E X 1 / 2 n = 2 − n Γ ( 1 + 2 n ) Γ ( 2 + n ) = 2 − n + 1 Γ ( 2 n ) ( n + 1 ) Γ ( n ) .
Equating these expressions yields the identity
Γ ( 1 2 ) Γ ( 2 n ) = 2 2 n − 1 Γ ( n ) Γ ( n + 1 2 ) ,
which in essence is Legendre’s duplication formula.
Example 2. 
If a = 1 / 3 , then q = 1 2 and (25) can be written as the reduced cubic equation y 3 − y − 2 θ / 3 = 0 , where y = 1 / χ and χ ( θ ) = χ ( θ ; 1 / 3 ) . The cubic form y 3 − y has zeros at y = − 1 , 0   a n d   1 , and is strictly increasing and positive if y > 1 . It follows that the relevant solution of the cubic equation lies along this positive limb. The discriminant of the cubic equation is Δ 2 = ( θ 2 − 1 / 3 ) / 9 and it is positive if θ 2 > 1 / 3 . In this case, the Cardano formula (e.g., p. 118 in [27]) gives the solution for χ as
χ ( θ ) = 3 1 / 3 [ θ + θ 2 − 1 / 3 ] 1 / 3 + [ θ − θ 2 − 1 / 3 ] 1 / 3 − 1 .
If Δ 2 < 0 , the trigonometrical solution algorithm (p. 121 in [27]) specifies numbers ρ > 0 and ϕ defined by the relations ρ cos ϕ = θ / 3 and ρ sin ϕ = ( 1 / 3 − θ 2 ) 1 / 2 / 3 . It follows that ρ = 3 3 − 1 and that the general solution is y = 2 ρ 1 / 3 cos ( ( θ + 2 k π ) / 3 ) , where k = 0 , 1 ,   o r   2 . The solution satisfying χ ( 0 ) = 1 is that with k = 0 , i.e.,
χ ( θ ; 1 / 3 ) = 3 3 2 sec ϕ 3 , ( 0 ≤ θ ≤ 3 − 1 / 2 ) .
These expressions for χ ( θ ) are difficult to interpret. However, it follows from (38) that
X 1 / 3 , 2 = L 2 3 U S 1 / 3 − 1 .
Recall that E S 1 / 3 − s = Γ ( 1 + 3 s ) / Γ ( 1 + s ) and observe that taking α = 1 + 3 s in #9.10.17 of [3] gives the Mellin transform identity 3 ∫ 0 ∞ z 3 s Ai ( z ) d z = 3 − s Γ ( 1 + 3 s ) / Γ ( 1 + s ) , where Ai ( z ) is the Airy function. Hence, V : = ( 3 S 1 / 3 − 1 ) − 1 has the density function
f V ( v ) = v − 2 / 3 A i v 1 / 3 , ( v > 0 ) .
It follows that the density function of X 1 / 3 , 2 is
f ( x ; 1 / 3 , 2 ) = ( 3 x / 128 ) 1 / 3 ∫ 1 ∞ y − 5 / 3 A i 3 y x 2 4 1 / 3 d y .
Similar results can be derived if a = 3 or, from (38),
X 3 , 2 / 3 = L 2 U S 1 / 3 − 1 1 / 2 = L 3 X 1 / 3 , 2 .
Example 3. 
If a = 2 , then solving (25) yields
χ ( θ ; 2 ) = 2 1 + 1 + 4 θ 2 ,
implying that
X 2 = L 2 X 1 / 2 ′ + X 1 / 2 ′ ′ ,
where the summands are independent copies of X 1 / 2 . This illustrates Corollary 1.
Here, q = 2 ; taking t = 1 2 , (37) yields
X 2 , 1 / 2 = L U S 1 / 2 − 1 .
Thus, X 2 is the sum of independent copies of X 2 , 1 / 2 , and we can obtain a representation for this sum from Corollary 2 as follows. Taking t = 1 there, we see that the gamma quotient is
Γ ( 2 + 2 n ) Γ ( 2 + n ) = 1 1 + n · Γ ( 3 + 2 n ) Γ ( 3 ) Γ ( 2 + n ) .
The right-hand side gamma function quotient is E L 1 S 1 / 2 − 1 n , and hence
X 2 = L U ′ U ′ ′ 1 2 L 1 ( S 1 / 2 − 1 ) ,
where the primed Us are independent copies of U.

5. BDLP Ladders: Examples

Let ω 0 be the Lévy density of a positive infdiv law L ( X 0 ) , i.e.,
ω 0 ( x ) = 0 if x < 0 , and ∫ 0 ∞ ( x ∧ 1 ) ω 0 ( x ) d x < ∞ .
Let C 0 ( θ ) = ∫ 0 ∞ ( 1 − e − θ x ) ω 0 ( x ) d x denote the corresponding CF and let ( S 0 , t : t ≥ 0 ) be the drift-free subordinator determined by ω 0 , i.e., S 0 , 1 = L X 0 . If ∫ 1 ∞ ( log x ) ω 0 ( x ) d x < ∞ , then the stochastic integral
X 1 = L ∫ 0 ∞ e − t d S 0 , t
exists and L ( X 1 ) is SD, i.e., ( S 0 , t ) is the BDLP for L ( X 1 ) . The Lévy density and CF of L ( X 1 ) are
C 1 ( θ ) = ∫ 0 θ y − 1 C 0 ( y ) d y and ω 1 ( x ) = x − 1 ∫ x ∞ ω 0 ( y ) d y ,
respectively, and ( S 1 , t ) denotes the drift-free subordinator determined by L ( X 1 ) . The first identity is the known relation between the CF of an SD law and that of its BDLP. The second identity follows from the first.
We assume in the sequel that ω 0 satisfies the log-condition, i.e., that ∫ 1 ∞ ( log x ) n ω 0 ( x ) d x < ∞ for all positive-integer n. For each n, the function ( log ( 1 + x ) ) n is submultiplicative (p. 159 in [21]); hence, the condition E ( ( log ( 1 + X 0 ) ) n ) < ∞ for all n is equivalent to the log-condition for ω 0 ( x ) . Clearly, ω 0 satisfies the log-condition if ∫ 1 ∞ x δ ω 0 ( x ) d x < ∞ for some δ > 0 . The examples below satisfy this condition.
Iterating the construction of L ( X 1 ) generates a sequence of SD laws { L ( X n ) : n = 1 , 2 , … } related by the BDLP representation
X n + 1 = L ∫ 0 ∞ e − t d S n , t ,
where ( S n , t ) is a drift-free subordinator with Lévy density ω n . It generates the Lévy density
ω n + 1 ( x ) = x − 1 ∫ x ∞ ω n ( y ) d y
and the CF
C n + 1 ( θ ) = ∫ 0 θ y − 1 C n ( y ) d y .
We call this construction a BDLP ladder to emphasise the focus on the sequence of laws L ( X n ) derived from an initial positive infdiv law L ( X 0 ) . Note that ω 0 can be replaced with an arbitrary Lévy measure (on [ 0 , ∞ ) ); however, our examples satisfy the more restrictive context, and there is no essential loss of generality. In this section we consider three examples, starting with a very simple one.
Example 4 
(The stable ladder). Suppose that X 0 = L S 0 , 1 ∼ stable ( α , K ) , meaning that ω 0 ( x ) = K x − α − 1 with 0 < α ≤ 1 and K > 0 . A moment’s reflection shows that ω n ( x ) = α − n K x − α − 1 , i.e., X n ∼ stable ( α , α − n K ) . This ladder extends to n < 0 . Also, C n ( θ ) ∝ α − n θ α , and α n / α X n ∼ stable ( α , K ) .
Example 5 
(The gamma ladder). Let a > 0 and ω 0 ( x ) = a e − x , i.e., ( S 0 , t ) is a compound Poisson process with rate a and a unit exponential jump law. Here, C 0 ( θ ) = a θ / ( 1 + θ ) , so C 1 ( θ ) = a log ( 1 + θ ) and L ( X 1 ) is the standard gamma ( a ) law, a widely known result.
Assuming that 0 < θ < 1 and expressing log ( 1 + θ ) as a power series, repeated use of (41) yields
C n ( θ ) = − a Li n ( − θ ) = − a ∑ j = 1 ∞ j − n ( − θ ) j ,
where Li n ( · ) is a polylogarithm function, #25.12.10 in [3]. The integral representation, #25.12.11 in [3], yields
C n ( θ ) = a θ Γ ( n ) ∫ 0 ∞ y n − 1 e y + θ d y .
However,
θ e y + θ = 1 − e y e y + θ = e y ∫ 0 ∞ exp ( − x e y ) − exp ( − x ( θ + e y ) ) d x ,
whence
ω n ( x ) = a Γ ( n ) ∫ 0 ∞ y n − 1 exp − x e y e y d y = a Γ ( n ) ∫ 1 ∞ e − x z log z n − 1 d z .
If n ≥ 2 , then integration by parts yields
x ω n ( x ) = a Γ ( n − 1 ) ∫ 1 ∞ e − x z ( log z ) n − 2 z − 1 d z .
Thus, x ω n ( x ) is completely monotone, so C n ( θ ) is a Thorin–Bernstein function (p. 84 in [28]) and L ( X n ) is a generalized gamma convolution.
It follows from (43) that C n ′ ( 0 ) = a for all n ≥ 0 , i.e., E ( X n ) = a , and from (42) that C n ( θ ) → a θ as n → ∞ , whence X n → L a . Note that
C n ( θ ) − a θ = − 2 − n a θ 2 ( 1 + o ( 1 ) ) , ( n → ∞ )
yields the refinement
2 n / 2 X n − a → L 2 a N ,
where N has the standard normal law. We will see in the next section that this outcome holds for all BDLP ladders under a mild additional moment condition.
Example 6 
(The Lambert ladder). Here, we take ( S 0 , t ) as the compound Poisson BDLP in (5). From (6), ω 0 ( x ) = ∫ 0 ∞ s e − x s ν ( d s ) , where ν is the probability measure having the Stieltjes transform
W ′ ( θ ) = ∫ 0 ∞ ν ( d s ) θ + s .
It follows that ∫ 0 ∞ x ω 0 ( x ) d x = 1 , and from (40) that ∫ 0 ∞ x ω n ( x ) d x = 1 . Since C 1 ( θ ) = W ( θ ) , we have from (9) that
C 0 ( θ ) = θ W ′ ( θ ) = W ( θ ) 1 + W ( θ ) .
We next show that if n ≥ 1 , then C n ( θ ) is a polynomial function of W ( θ ) .
Theorem 7. 
If n ≥ 1 , then the CFs of the Lambert ladder are given by
C n ( θ ) = W ( θ ) Q n − 1 ( W ( θ ) ) ,
where Q n ( w ) is a polynomial of degree n satisfying Q n ( 0 ) = 1 and
w Q n ( w ) = ∫ 0 w ( 1 + v ) Q n − 1 ( v ) d v .
Proof. 
If n = 1 , then (44) holds with Q 0 ( θ ) = 1 . Assuming that (44) holds for some n, it follows from (41) that
C n + 1 ( θ ) = ∫ 0 θ y − 1 W ( y ) Q n − 1 ( W ( y ) ) d y = ∫ 0 θ ( 1 + W ( y ) ) W ′ ( y ) Q n − 1 ( W ( y ) ) d y = ∫ 0 W ( θ ) ( 1 + v ) Q n − 1 ( v ) d v = W ( θ ) Q n ( W ( θ ) ) .
It is evident that the recursion (45) specifies a sequence of polynomials; hence, the assertion follows by induction. □
Computing recursively with (45) yields the first few polynomials
Q 1 ( w ) = 1 + 1 2 w , Q 2 ( w ) = 1 + 3 4 w + 1 6 w 2
and
Q 3 ( w ) = 1 + 7 8 w + 11 36 w 2 + 1 24 w 3 .
It follows from (45) that the coefficients of Q n are positive, and hence that these polynomials are convex increasing in [ 0 , ∞ ) . In addition, Q n ( 0 ) = 1 , Q 2 ( w ) > Q 1 ( w ) if w > 0 ; hence, by induction from (45), Q n + 1 ( w ) > Q n ( w ) if w > 0 .
Differentiating (45) yields
Q n ( w ) + w Q n ′ ( w ) = ( 1 + w ) Q n − 1 ( w ) ,
from which we see that the formally defined generating function Q ( w , z ) = ∑ n ≥ 0 Q n ( w ) z n satisfies
∂ Q ∂ w + ( 1 − ( 1 + w ) z ) Q = 1 .
Solving this shows that the series defining Q converges if | z | < 1 and that
Q ( w , z ) = ( w z ) − ( 1 − z ) γ ( 1 − z , w z ) = ( 1 − z ) − 1 e w z M ( 1 − z , 2 − z , − w z ) = ( 1 − z ) − 1 M ( 1 , 2 − z , w z ) ,
where γ ( a , z ) = ∫ 0 z x a − 1 e − x d x is the incomplete gamma function and M ( · , · , · ) is the Kummer function; see #13.6.5 in [3] for these connections.
Writing Q n ( z ) = ∑ j = 0 n A n j w j , we have A n 0 = 1 ; from (46), we have ( 1 + n ) A n n = A n − 1 , n − 1 , i.e., A n n = 1 / ( n + 1 ) ! . Explicit expressions for A n j can in principle be obtained from (47), because extracting the coefficient of w j yields
∑ n = 0 ∞ A n + j , j z n = ∏ i = 1 j + 1 ( i − z ) − 1 .
Differentiation yields
A n , n − 1 = H n n ! and A n , n − 2 = H n − 1 2 + H n − 1 ( 1 ) 2 ( n − 1 ) ! ,
where H n is the n-th harmonic number and H n ( r ) = ∑ i = 1 n i − r − 1 (so H n = H n ( 0 ) ). Partial fraction expansions yield A n 1 = 1 − 2 − n if n ≥ 1 and A n 2 = 1 2 ( 1 − 2 − ( n − 2 ) + 3 − n + 1 ) if n ≥ 2 . The evaluations in (48) can be used to show that the Q n do not satisfy a three-term recurrence w Q n = α n Q n + 1 − ( α n + β n ) Q n + β n Q n − 1 . Consequently, there is no orthogonality measure for these polynomials.
We conclude by emphasising that the polynomial forms W ( θ ) Q n ( W ( θ ) ) are Bernstein functions. The above examples illustrate the general proposition in [11] that if L ( X 0 ) is a generalised gamma convolution, then so is each L ( X n ) .

6. BDLP Ladders: Some Theory

Let W 0 denote the set of Lévy densities ω 0 which are supported in [ 0 , ∞ ) and satisfy the log-condition; additionally, define the ladder operator I by (40): if n ≥ 0 , then ω n + 1 = I ( ω n ) . Define sets W n of SD Lévy densities by
W n + 1 = { ω n + 1 = I ( ω n ) : ω n ∈ W n , n ≥ 1 } .
The next result gives an integral representation for ω n and a very simple expression for r-order cumulants along the ladder.
Theorem 8. 
Suppose that
∫ 1 ∞ ( log z ) n ω 0 ( z ) d z < ∞ , ( n ≥ 0 ) .
Then, ω n is specified by
ω n ( x ) = 1 x Γ ( n ) ∫ x ∞ ( log z − log x ) n − 1 ω 0 ( z ) d z = 1 Γ ( n ) ∫ 1 ∞ ( log v ) n − 1 ω 0 ( x v ) d v
and is a Lévy density. In addition, if r > 0 and the order-r cumulant of L ( X 0 ) is finite:
κ r = ∫ 0 ∞ x r ω 0 ( x ) d x < ∞
then the order-r cumulant of L ( X n ) is
κ n , r : = ∫ 0 ∞ x r ω n ( x ) d x = r − n κ r .
Proof. 
Clearly, (50) is valid if n = 1 . Assuming its truth for arbitrary n ≥ 1 , it follows from (40) that
ω n + 1 ( x ) = 1 x Γ ( n ) ∫ x ∞ y − 1 ∫ y ∞ ( log z − log y ) n − 1 ω 0 ( z ) d z = 1 Γ ( n ) ∫ x ∞ ω 0 ( z ) ∫ x z ( log z − log y ) n − 1 y − 1 d y d z ,
where interchanging the repeated integrals is valid by Fubini’s theorem. The inner integral equals
∫ x z ( log z − log y ) n − 1 d y log y = n − 1 ( log z − log x ) n .
Hence, by induction, (50) holds for all n. The hypothesis ensures that ω n ( x ) < ∞ for all n and x > 0 .
It follows by construction that ω n + 1 is the Lévy density determined by the BDLP generated by ω n provided that I n = ∫ 1 ∞ ( log x ) ω n ( x ) d x < ∞ . Evaluating as above,
I n = 1 Γ ( n ) ∫ 1 ∞ ω 0 ( z ) ∫ 1 ∞ ( log z − log x ) n − 1 log x d x log x d z ;
writing log x = log z − ( log z − log x ) , we see that
I n = 1 ( n + 1 ) ! ∫ 1 ∞ ω 0 ( z ) ( log z ) n + 1 d z < ∞ .
Thus, if n ≥ 1 , then ω n is the Lévy density of an SD law, as asserted.
Finally, the left-hand side of (52) can be expressed in a similar manner as ( Γ ( n ) ) − 1 ∫ 0 ∞ ω 0 ( z ) J ( z ) d z , where
J ( z ) = ∫ z ∞ x r − 1 ( log ( z / x ) ) n − 1 d x = Γ ( n ) z r r − n
and (52) follows. □
Remark 3. 
It is reported in [9] (the original source [29] is unavailable to the author) that if L ( X ) ∈ L n + , then X = L ∫ 0 ∞ e − t d S 0 ( t n / n ! ) . This identity gives a direct but longer proof of (50).
Note that if r > 1 in (52), then the cumulants along the ladder satisfy κ n r → 0 as n → ∞ . This manifests the nesting property of the classes L n + .
We next describe some consequences of (52). Referring to (51), assume that κ 1 < ∞ ; also note from (52) that κ n 1 = κ 1 . We assume, with no loss of generality, that κ 1 = 1 . It follows that
ω ¯ n ( x ) = ∫ x ∞ ω n ( y ) d y , ( n ≥ 0 )
is a density function, say of A n , with LST C n ( θ ) / θ . Denote the LST of X n by T n ( θ ) = exp ( − C n ( θ ) ) . It follows from (41) that
− T n + 1 ′ ( θ ) = C n + 1 ′ ( θ ) T n + 1 ( θ ) = θ − 1 C n ( θ ) T n + 1 ( θ ) .
This identity has the random variable expression
X ^ n + 1 = L X n + 1 + A n , ( n ≥ 0 ) ,
where X ^ n is the length-biased version of X n , i.e., noting that E ( X n ) = 1 , then P ( X ^ n ∈ d x ) = x P ( X n ∈ d x ) .
A relation (see [12] ) of the type (53) with arbitrary L ( A n ) characterizes the infinite divisibility of positive laws having a finite first moment; here, we see that it holds along the ladder.
Next, still assuming that κ 1 = 1 , we may set r = 1 + 𝚤 ϱ in (52), where 𝚤 = − 1 , observing that ( 1 + 𝚤 ϱ ) − 1 is the characteristic function of the standard exponential law L ( ϵ ) and that κ n , 1 + 𝚤 ϱ is the characteristic function of log W n , where, for n ≥ 0 , W n has the density function k n ( x ) = x ω n ( x ) . Then, since U = e − ϵ has the standard uniform law, we obtain the following random variable representation of (52), which has a central rôle in proving the limit Theorems 10–12.
Theorem 9. 
If κ 1 = 1 , then
W n = L V n W 0 ( n ≥ 0 ) ,
where V n = U 1 × ⋯ × U n is the product of independent copies of U.
Example 7. 
Suppose that γ t ∼ gamma ( t ) , i.e., its density function is ( Γ ( t ) ) − 1 x t − 1 e − x . A standard computation shows that the density function of the product ϵ e − γ t is
g t ( x ) = 1 Γ ( t ) ∫ 1 ∞ e − x y ( log y ) t − 1 y − 1 d y , ( t > 0 ) = x Γ ( 1 + t ) ∫ 1 ∞ e − x y ( log y ) t d y ( t ≥ 0 ) .
Thus, g 0 ( x ) = e − x , as expected, and g 1 ( x ) = E 1 ( x ) , the exponential integral.
In Examples 5 and 6 it can be seen that W 0 = γ 2 ′ / Z , where γ 2 ′ ∼ gamma ( 2 ) and Z > 0 . Thus, P ( Z ∈ d s ) = δ 1 ( d s ) for the gamma ladder and P ( Z ∈ d s ) = s − 1 ν ( d s ) for the Lambert ladder. Now, V n = L V n − 1 U = L e − γ n − 1 U and U γ 2 ′ = L ϵ , so W n = L e − γ n − 1 ϵ / Z ; hence, the density function of W n is
x ω n ( x ) = ∫ 0 ∞ s g n − 1 ( x s ) d F Z ( s ) .
It follows from the form of g t that x ω n ( x ) is completely monotone; hence, all members L ( X n ) of the ladder are generalized gamma convolutions.
We now show how Theorem 9 provides information about the nature of L ( X n ) when n is large. Theorem 10 shows that L ( X n ) is asymptotically degenerate provided that κ 1 < ∞ . Theorem 11 is a central limit convergence rate result which holds if κ r < ∞ for some r > 2 . Theorem 12 concerns cases where κ 1 = ∞ . The basic assumption is that the CF C 0 ( θ ) is regularly varying at zero, and the outcome is that there is a sequence of positive constants b n → 0 such that ( b n X n ) has a stable law limit.
Theorem 10. 
Suppose that a : = κ 1 < ∞ . Then, X n → L a as n → ∞ .
Proof. 
We can normalize k n ( x ) to be a density function; writing W = W 0 in Theorem 9, this has the result that the CF of L ( X n ) is
C n ( θ ) = a ∫ 0 ∞ 1 − e − θ x x − 1 k n ( x ) d x = a E 1 − exp ( − θ V n W ) V n W .
However, V n → 0 almost surely, and x − 1 ( 1 − e − x ) = ∫ 0 1 e − x y d y ≤ 1 , so it follows from the dominated convergence theorem that C n ( θ ) → a θ , the CF of the unit mass at a. □
The next result shows under a mild additional moment condition that fluctuations of L ( X n ) around a are normally distributed.
Theorem 11. 
Suppose that κ r < ∞ for some r > 2 . Then, with a = κ 1 and σ 2 = κ 2 ,
N n : = 2 n / 2 ( X n − a ) → L a σ N ,
where L ( N ) is the standard normal law.
Proof. 
The negative of the cumulant function of N n is a 2 n / 2 β n ( θ ) , where
β n ( θ ) = θ − E 1 − exp ( − θ Q n ) Q n
and Q n = 2 n / 2 V n W . Thus,
β n ( θ ) = ∫ 0 θ ξ n ( y ) d y where ξ n ( θ ) = E 1 − e − θ Q n .
Since E ( Q n ) = 2 − n / 2 E ( W ) = 2 − n / 2 σ 2 , we have
ξ n ( θ ) = θ 2 − n / 2 σ 2 − R n ( θ ) ,
where
0 ≤ R n ( θ ) = E θ Q n − 1 − e − θ Q n = θ E ∫ 0 Q n 1 − e − θ y d y ≤ θ E Q n 1 − e − θ Q n .
We denote the last expectation by R ¯ n ( θ ) and estimate it as follows.
Note first that if ε < 1 , then 1 − e − x ≤ ε if x ≤ δ : = − log ( 1 − ε ) . Hence,
E Q n 1 − e − θ Q n ; Q n ≤ δ / θ ≤ ε E ( Q n ) = ε 2 − n / 2 σ 2 .
Next, set δ ′ = δ / θ and observe that
E ( Q n ; Q n > δ ′ ) = δ ′ F ¯ n ( δ ′ ) + ∫ δ ′ ∞ F ¯ n ( x ) d x ,
where F ¯ n ( x ) = P ( Q n > x ) . Markov’s inequality yields F ¯ n ( x ) ≤ x − 1 E ( Q n ) → 0 as n → 0 . We need a much finer estimate of the rate of this convergence.
Note that with c = 1 2 log 2 = 0.3466 ,
F ¯ n ( x ) = P ( V n > x 2 − n / 2 W − 1 ) = P ( γ n ≤ c n − log x + log W ) .
If s > 0 , then
E e − s γ n = ( 1 + s ) − n ≥ E e − s γ n ; γ n ≤ z ≥ e − s z P ( γ n ≤ z ) ,
i.e., P ( γ n ≤ z ) ≤ e s z ( 1 + s ) − n , a Chernoff type inequality. Taking z = c n − log x + log W , we obtain
F ¯ n ( x ) ≤ ( 1 + s ) − n e s c n x − s E ( W s ) .
Choosing s > 1 , we find that the integral term I n ( θ ) in (56) satisfies
I n ( θ ) ≤ ( s − 1 ) − 1 ( θ / δ ) s − 1 ( 1 + s ) − n e s c n E ( W s ) .
The n-dependent factor is exp ( − n b ( s ) ) , where b ( s ) = log ( 1 + s ) − c s . Clearly, b ( 1 ) = log 2 − c = c > 0 , b ′ ( 1 ) = 1 2 − c > 0 , and b ′ ′ ( s ) = − ( 1 + s ) − 2 < 0 ; hence, b is concave-increasing in a neighbourhood of s = 1 .
Observing that our cumulant function equals a e c n β n ( θ ) , we must consider the quantity
exp ( c n − n b ( s ) ) = exp [ − n ( log ( 1 + s ) − c s − c ) ] .
However, b ( 1 ) − c = log 2 − 2 c = 0 and b ′ ( 1 ) > 0 , so choosing s ∈ ( 1 , r − 1 ) , we have ∫ δ ′ ∞ x − s d x < ∞ and E ( W s ) < ∞ ; hence, we have the estimate I n ( θ ) = θ s − 1 η n , where η n → 0 is independent of θ , and it follows that ∫ 0 θ I n ( y ) d y → 0 . The bound (57) implies that δ ′ F ¯ n ( δ ′ ) = O ( θ s − 1 ) η n ′ , where η n ′ → 0 is independent of θ .
It follows from these estimates that ∫ 0 θ E ( Q n ; Q n > δ / y ) d y → 0 , and hence that
0 ≤ lim   sup n → ∞   2 n / 2 ∫ 0 θ R n ( y ) d y ≤ 1 2 ε σ 2 θ 2 .
Combining these estimates yields
1 2 a σ 2 θ 2 ≤ a   lim   sup n → ∞   2 n / 2 β n ( θ ) ≤ 1 2 ( 1 + ε ) a σ 2 θ 2 .
Since ε is arbitrary, we conclude that lim n → ∞ E [ exp ( − θ N n ) ] = exp ( 1 2 a σ 2 θ 2 ) , and the assertion follows from a continuity theorem for moment-generating functions, e.g., Theorem 1 in [30] or p. 408 in [25]. □
Let 0 < α ≤ 1 and suppose that C 0 is regularly varying at zero, i.e.,
C 0 ( θ ) = θ α λ ( θ − 1 ) ,
where λ ( x ) is slowly varying (at infinity). This means that for any constant c ∈ ( 0 , ∞ ) , we have lim x → ∞ ( λ ( c x ) / λ ( x ) ) = 1 . A representation theorem asserts that there is a positive constant A, a measurable index function δ ( x ) → 0 as x → ∞ , and
λ ( x ) ∼ A exp ∫ 1 x δ ( y ) y − 1 d y .
See Bingham et al. [18] for these concepts.
We will use a representation motivated by expressing (50) as
ω n ( x ) = E [ Y n 2 ω 0 ( Y n x ) ] ,
where Y n ≥ 1 has the density function ( log v ) n − 1 / ( v 2 Γ ( n ) ) supported by [ 1 , ∞ ) . In fact, Y n = exp ( γ n ) , where we will assume that the gamma random variable γ n is the sum of n independent copies of ϵ ∼ E x p ( 1 ) , ensuring that Y n ↑ ∞ almost surely. Integration yields the representation
C n ( θ ) = E [ Y n C 0 ( θ / Y n ) ] ,
which holds for any positive infdiv L ( X 0 ) satisfying the log-condition.
If ρ ¯ 0 ( x ) is the right-hand tail of the Lévy measure of L ( X 0 ) and if 0 < α < 1 , then (58) is equivalent to the following: as x → ∞ ,
ρ ¯ 0 ( x ) ∼ x − α λ ( x ) Γ ( 1 − α ) .
We can now state the following result about convergence to a stable law. Note the quite specific form assumed for the slowly varying factor in (61).
Theorem 12. 
Assume that (58) holds. (i) Suppose that 0 < α < 1 and that there is a real number β such that, for x > 1 ,
λ ( x ) = ( log x ) β ℓ ( log x ) ,
where ℓ is slowly varying. Then, there exist norming constants
b n = C 0 − 1 ( α n ) ∼ α n / α λ ˜ ( α − n ) ,
where λ ˜ is slowly varying, and
L ( b n X n ) → L stable ( α , K β ) ,
where
K β = ( 1 − log α ) − 1 ) β .
(ii) If (58) holds with α = 1 and (61) holds with β ≥ 0 , then there exist norming constants b n ∼ n − β λ ˜ ( n β ) , where λ ˜ is slowly varying, such that b n X n → L 1 .
Proof. 
(i) Supposing that 0 < b n → 0 , it follows from (58), (60), and (61) that the CF of b n X n is
C n ( b n θ ) = ( θ b n ) α E [ Y n 1 − α λ ( Y n / θ b n ) ] ∼ ( θ b n ) α E [ Y n λ ( Y n / b n ) ] ∼ θ α C 0 ( b n ) E [ Y n 1 − α λ ( Y n / b n ) / λ ( 1 / b n ) ] .
Denoting the expectation factor by J n and writing ν n = log ( b n − 1 ) , it follows from (61) that the slowly varying quotient can be replaced by
Q n = 1 + γ n ν n β ℓ ( γ n + ν n ) ℓ ( ν n ) .
Choosing b n as in the first equality of (62), the asymptotic form there follows from results about the asymptotic inverses of regularly varying functions (p. 28 in [18]). In addition, since ( log λ ˜ ( x ) ) / ( log x ) → 0 (p. 16 in [18]), it follows from (62) that
lim n → ∞ ν n / n = ρ > 0 .
Consequently, the slowly varying quotient in Q n converges almost surely to unity by virtue of the strong law and the uniform convergence property of slowly varying functions. Note also that given ε > 0 , Potter’s bounds imply that this quotient is bounded above by a factor proportional to ( 1 + γ n / ν n ) ε provided that n is sufficiently large.
Next, define the parameter ρ by α ρ = log α and observe that
E Y n 1 − α 1 + γ n ρ n β = 1 Γ ( n ) ∫ 0 ∞ x n − 1 1 + x ρ n β e − α x d x = α − n Γ ( n ) ∫ 0 ∞ y n − 1 1 + y α ρ n β e − y d y = α − n E 1 + γ n α ρ n β ∼ α − n K β ,
appealing to the strong law and uniform integrability. Combining these estimates, the dominated convergence theorem leads to the conclusion that J n ∼ K β α − n . From (62), we have C 0 ( b n ) = α n , so it follows that C n ( b n θ ) → K β θ α , whence (63).
For (ii), observe first that β ≥ 0 if α = 1 . Changing some details in the above argument, we obtain C n ( θ ) ∼ θ C 0 ( b n ) J n , where we now have J n ∼ E [ ( 1 + γ n / ν n ) β ] . Anticipating that ν n = o ( n ) , it follows from the mean value theorem that J n ∼ E [ ( γ n / ν n ) β ] ∼ ( n / ν n ) β . However, C 0 ( b n ) = b n ν n β ℓ ˜ ( b n − 1 ) , where ℓ ˜ ( x ) = ℓ ( log x ) , a slowly varying function. Hence, C n ( b n θ ) ∼ θ b n ℓ ˜ ( b n − 1 ) n β → θ if b n is chosen as in the assertion. In addition, ν n ∼ β log n , so the above provisional assumption does hold and the assertion follows. □
In Theorem 12, the case with α = 1 and β = 0 generalises Theorem 10. If 0 < α < 1 and ℓ ( x ) → a > 0 in (61), then the index function in (59) has the form δ ( x ) = ( β / log x ) + r ( x ) , where ∫ 1 ∞ x − 1 r ( x ) d x is finite. Computation shows that b n ∼ M ( α n n − β ) 1 / α , where M = ( a ρ β ) − 1 / α . Thus, the case β = 0 here generalises the final assertion of Example 4.
Still assuming that 0 < α < 1 and (59), we can obtain some idea of what can occur when ( log x ) δ ( x ) → ± ∞ . Omitting details, it is clear that
J n ∼ E Y n 1 − α e ν n I n ( γ n / ν n ) ,
where I n ( x ) = ∫ 1 1 + x δ ( b n − z ) d z and x > 0 . Then, the change of gamma scaling used in the proof of Theorem 12 now yields
J n ∼ α − n E [ exp ( ν n I n ( γ n / α ν n ) ] .
Anticipating that ν n ∼ ρ n , the strong law implies that I n ( γ n / α ν ) ∼ I n ( 1 / α ρ ) = o ( 1 ) as n → ∞ .
Suppose further that δ ( b n − z ) ∼ σ n ψ ( z ) , where σ n → 0 , and that η = ∫ 1 1 + 1 / α ρ ψ ( z ) d z is finite. It follows that the essential outcome of Theorem 12(i) occurs if b n is chosen to satisfy C 0 ( b n ) α − n exp ( η ν n σ n ) → 1 . Two examples illustrate what can occur.
Example 8. 
If 0 < r < 1 and δ ( x ) = A ( log x ) r − 1 , then ψ ( z ) = A z r − 1 and σ n = ν n r − 1 . Noting that λ ( x ) ∼ a exp ( ( A / r ) ( log x ) r ) , it turns out that the norming sequence can be taken as
b n ∼ a − 1 α n exp ( − M n r ) 1 / α ,
where M = ( A / r ) ρ r K r . The slower rate of decrease of the index function is reflected in a more quickly decaying norming sequence.
Example 9. 
If δ ( x ) = A ( log log x ) / log x , where x > e , then ψ ( z ) = A / z and σ n = ( log ν n ) / ν n . In addition, λ ( x ) ∼ a exp [ 1 2 A ( log log x ) 2 ] . It follows that
b n = c o n s t . α n n − A log ( α + 1 / ρ ) exp ( − 1 2 A ( log n ) 2 ) 1 / α .
We next obtain some representations motivated by the resemblance of the expression for ω n ( x ) in (50) to some formulae derived by Urbanik [10]. He begins with the class L 0 of SD laws on the real line. His class L 1 comprises all limit laws of weakly convergent normed sums m − 1 ∑ j = 1 m ξ j − a m , where the summands are independent, L ( ξ j ) ∈ L 0 for j ≥ 1 , and { a m } is a sequence of centering constants. The class L 2 is constructed from L 1 in the same way, and so on, inducing classes of SD laws L n + 1 ⊂ L n , where the set containment is proper. An important characterisation result (Proposition 1 in [10]) asserts that L ( X ) ∈ L n + 1 if and only if there exists L ( X c ) ∈ L n for each c ∈ ( 0 , 1 ) such that X = L c X + X c . This result implies a stochastic integral representation of the form (39), where the integrator is a Lévy process with one-dimensional laws in L n .
Proposition 3 in [10] is a representation for the so-called spectral measure of the spectrally positive members of L n . The proof uses a representation ((2) in [10]) for SD characteristic functions (derived earlier in [29]) and some theory of extreme points of convex sets. A parallel result for positive SD laws (with no drift term) is obtained by elementary means as follows. In keeping with our ladder context, we let ω ( x ) be the Lévy density of a positive SD law L ( X ) , so k ( x ) = x ω ( x ) is non-increasing and ∫ 0 ∞ ( 1 ∧ x − 1 ) k ( x ) d x < ∞ . Note that
E ( θ ) = ∫ 0 θ 1 − e − y y − 1 d y = ∫ 0 1 1 − e − θ x x − 1 d x
is the CF corresponding to the Lévy density x − 1 1 ( 0 < x ≤ 1 ) .
Lemma 5. 
The CF of a positive SD law has the representation
C ( θ ) = ∫ 0 ∞ E ( θ x ) Q ( d x ) log ( 1 + x ) ,
where Q is the finite measure on ( 0 , ∞ ) ,
Q ( d x ) = − [ log ( 1 + x ) ] d k ( x ) .
Proof. 
We have
C ( θ ) = ∫ 0 ∞ 1 − e − θ x x − 1 k ( x ) d x = ∫ 0 ∞ k ( x ) d x E ( θ x ) .
Noting that E ( θ ) ∼ log θ as θ → ∞ , integration by parts yields
C ( θ ) = − ∫ 0 ∞ E ( θ x ) d k ( x ) ,
provided that lim x → ∞ ( log x ) k ( x ) = 0 . However, the standing condition ∫ 1 ∞ w ( x ) d x < ∞ implies that I ( x ) : = ∫ x ∞ y − 1 k ( y ) d y → 0 . If δ ∈ ( 0 , 1 ) and x > 1 , then I ( x ) ≥ ∫ x δ x y − 1 k ( y ) d y ≥ k ( x ) ( 1 − δ ) log x ; hence, (66) indeed holds, i.e., (65) holds.
To see that Q is finite, note that k ( ∞ ) = 0 ; otherwise, ∫ 1 ∞ y − 1 k ( y ) d y = ∞ , so
Q ( 0 , ∞ ) = ∫ 0 ∞ ∫ 0 x d y 1 + y ( − d k ( y ) = ∫ 0 ∞ k ( y ) 1 + y d y < ∞ .
□
Following Urbanik [10], Q is called the spectral measure of L ( X ) . He also defines an associated function, which here has the form
G X ( z ) = ∫ e z ∞ Q ( d x ) log ( 1 + x ) = k ( e z ) , ( − ∞ < z < ∞ )
but which seems to have no useful role in our context.
Lemma 5 yields the following Urbanik-type representation of C n ( θ ) , which may be compared with Proposition 4 in [10].
Theorem 13. 
If ω 0 satisfies (49), then for n ≥ 1 ,
C n + 1 ( θ ) = ∫ 0 ∞ E ( θ x ) ω n ( x ) d x ,
and if n ≥ 1 , then
ω n ( x ) = 1 x Γ ( n ) ∫ x ∞ log y − log x n − 1 Q 1 ( d y ) log ( 1 + y ) .
Proof. 
The spectral measure for L ( X n ) is
Q n ( d x ) log ( 1 + x ) = − d x k n ( x ) = − d d x ( x ω n ( x ) ) d x = ω n − 1 ( x ) d x ,
using (40). The first assertion is immediate, and the second is just a restatement of (50). □
The members of a BDLP ladder are related as in [10] by a quite specific limit relation. For easier notation, we render (39) as
X n + 1 = L ∫ 0 ∞ e − t d S n ( t ) .
Theorem 14. 
Assume that (49) holds. For each n ≥ 1 , L ( X n + 1 ) is the in-law limit (as m → ∞ ) of the normed sum X n + 1 , m = m − 1 ∑ j = 1 m ξ j ( n ) , where ξ j ( n ) = j ( S n ( H j ) − S n ( H j − 1 ) ) and H j is the j-th harmonic number.
Proof. 
The relation (41) can be written as
C n + 1 ( θ ) = ∫ 0 1 z − 1 C n ( θ z ) d z = lim m → ∞ 1 m ∑ j = 1 m j m − 1 C n θ j m = lim m → ∞ − log E exp − θ m ∑ j = 1 m j S n , j ( j − 1 ) ,
where { S n , j ( t ) ; j ≥ 1 } are independent copies of S n ( t ) . The assertion follows from the continuity theorem for Laplace–Stieltjes transforms, the identity S n ( j − 1 ) = L S n ( H j ) − S n ( H j − 1 ) , and the independence of the ξ j ( n ) for j = 1 , 2 , … □
Thus, L ( X n + 1 ) is a weak limit in the Urbanik sense, with the precise identification (in our simpler setting) that the laws specifying the normed sums are scaled versions of one-dimensional laws of the BDLP, which is determined by L ( X n ) .
We conclude by observing that (67) can be expressed as X n + 1 = L ∫ 0 1 y d y S n ( log y − 1 ) and that the integral is the limit of approximating sums
X ˜ n + 1 , m = 1 m ∑ j = 2 m j S n − log j − 1 m − S n − log j m ,
i.e., L ( X n + 1 ) is the limit of a triangular array having the required form.

7. A Branching Process Connection

A continuous-time and -space branching process (CB-process) ( Z t : t ≥ 0 ) is a Markov process with state space [ 0 , ∞ ) which satisfies the branching property: if z > 0 , then
E e − θ Z t Z 0 = z = E e − θ Z t Z 0 = 1 z .
It follows for each t > 0 that L ( Z t ) is infdiv. CB-processes are constructed using a certain random-time transformation (the Lamperti transform, p. 261 in [31]) of a spectrally-positive Lévy process ( L t : t ≥ 0 ) where L 0 = Z 0 = z > 0 . We refer to this as the generating Lévy process (or subordinator), and denote its CF by C ( θ ) . If the so-called Malthusian parameter μ = C ′ ( 0 ) < ∞ , then E ( Z t | Z 0 = z ) = z e μ t .
The normed process ( M t : t ≥ 0 ) , where M t = e − μ t Z t , is a martingale with respect to the natural filtration corresponding to the CB-process. We will assume that μ > 0 , the CB-process is supercritical, and C ′ ′ ( 0 ) > − ∞ . In this case, ( M t ) converges almost surely and in mean-square to a random variable M which has an infinitely divisible law and E ( M ) = Z 0 . The CF of L ( M ) , denoted by ω ( θ ) , solves the differential equation
μ θ ω ′ ( θ ) = C ( ω ( θ ) ) .
As noted in [17], the Lambert law is the CF of L ( M ) in the case where ( L t ) is the compound Poisson law with unit rate and a unit exponential jump law. Here, C ( θ ) = θ / ( 1 + θ ) , μ = 1 , and the assertion follows from the above differential equation and (9). In particular, C ( θ ) is a particular case of the form (1) where the drift constant δ = 0 .
Now, let 0 < a ≠ 1 and recall that the infdiv law L ( X a ) of Section 4 has the LST χ ( θ ; a ) = e − ω ( θ ; a ) . Again, suppressing explicit dependency on a, we have the identification ω ′ ( θ ) = − χ ′ ( θ ) / χ ( θ ) , and it follows from (35) and (22) that
θ ω ′ ( θ ) = a χ − 1 / a ( θ ) − χ − 1 ( θ ) χ − 1 / a ( θ ) − a χ − 1 ( θ ) ;
hence, the differential equation in (68) is satisfied with
C ( θ ) = a e θ / a − e θ e θ / a − a e θ .
If this is a CF having the form in (1), then L ( X a ) is the law of a martingale limit law. Observe that C ′ ( 0 ) = lim θ ↓ 0 θ − 1 C ( θ ) = 1 , a consistent outcome.
Recalling the definition in (24) and defining p = a − 1 if a > 1 , it follows that
C ( θ ) = a 1 − e − θ / q 1 − a e − θ / q = a ( 1 − g a e − θ / q if a < 1 , 1 − e − θ / q 1 − p e − θ / q = 1 − g p e − θ / q if a > 1 ,
where, if 0 < α < 1 , then g α ( s ) = ( 1 − α ) s / ( 1 − α s ) , which is the pgf of the geometric law with parameter α and ia supported on the natural numbers. Clearly, C ( θ ) is the CF of a compound Poisson process.
It follows that L ( X a ) is the martingale limit of a CB-process generated by a Lévy process with zero drift and the discrete Lévy measure
L ( d x ) = a ( 1 − a ) ∑ j = 1 ∞ a j − 1 δ j / q ( d x ) if 0 < a < 1 , ( 1 − p ) ∑ j = 1 ∞ p j − 1 δ j / q ( d x ) if a > 1 .
This outcome further highlights the singularity of the Lambert law as a member of the family { L ( X a ) : a > 0 } ; it is the only member associated with a CB-process generated by a Lévy process having a continuous Lévy measure. Observe that lim a → 1 C ( θ ; a ) = C ( θ ; 1 ) = θ / ( 1 + θ ) .
If t > 0 , then the CF of χ ( θ ; a , t ) is t ω ( θ ; a ) . The latter satisfies (68) with C ( θ ; a ) replaced by t C ( θ / t ; a ) . Hence, if 0 < a < 1 , for example, then χ ( θ ; a , t ) is the LST of the martingale limit of the CB-process generated by the compound Poisson process with Lévy measure
L t ( d x ) = t a ( 1 − a ) ∑ j = 1 ∞ a j − 1 δ j / q t ( d x ) .
If q t = 1 , then the Lévy measure is supported on the natural numbers. A similar outcome holds if a > 1 .
The lattice-like step function sample path structure of the above generating subordinators is preserved under the Lamperti transform. This prompts exploration of whether χ ( θ ; a , t ) can be the LST of the martingale limit of a supercritical Markov branching process (MBP). This process (see Chapter 3 in [31]) models the evolution of the population size Z t of a population of individuals whose lifetimes have an exponential law with parameter ρ (the split rate) and ζ offspring at the end of these lives. The offspring law is the discrete law with masses p j = P ( ζ = j ) , j = 0 , 1 , … , where lifetimes and reproduction events are mutually independent. We assume that 0 < p 0 + p 1 < 1 and that the mean number of offspring m = ∑ j ≥ 1 j p j satisfies 1 < m < ∞ . The Malthusian parameter for the MBP is μ = ρ ( m − 1 ) and E ( Z t ) = Z 0 e μ t . We assume that Z 0 = 1 . Finally, if Z 0 = 1 , then the probability of extinction q e is the least non-negative solution of f ( s ) = s , where f ( s ) = E ( ζ s ) .
Here, if ∑ j ≥ 1 j 2 p j < ∞ , then M t : = e − μ t Z t → W almost surely and in mean-square, and the LST ϕ ( θ ) of W is determined by its functional inverse: if q e < s ≤ 1 , then
ϕ − 1 ( s ) = ( 1 − s ) exp − ∫ s 1 m − 1 f ( u ) − u − 1 1 − u d u .
Taking ϕ ( θ ) = χ ( θ ; a , t ) , it follows from (7) that ϕ − 1 ( s ) = τ ( s 1 / t ) . Differentiation of the resulting identity yields
f ( s ) = s + ( m − 1 ) t s 1 − 1 / t τ s 1 / t / τ ′ s 1 / t .
Logarithmic differentiation of (7) produces
τ s 1 / t / τ ′ s 1 / t = − a s 1 − s 1 / q 1 − a s 1 / q if 0 < a < 1 , − s 1 − s 1 / q 1 − p s 1 / q if a > 1 .
Observing that f ( 0 ) = 0 , it follows that if f ( s ) is a probability generating function, then q e = 0 . In addition, f ( s ) can be the generating function of an offspring law only if t is chosen such that q t = n ¯ − 1 , the reciprocal of a natural number n ¯ . We assume this condition in what follows.
If a < 1 , we obtain the explicit algebraic form
f ( s ) = s − ( m − 1 ) a t s · 1 − s 1 / q t 1 − a s 1 / q t = p 1 s + ( 1 − p 1 ) ( 1 − a ) ∑ j = 1 ∞ a j − 1 s 1 + j n ¯ ,
where
p 1 = 1 − ( m − 1 ) ( 1 − a ) / n ¯ .
Thus, p 1 < 1 ; to ensure that p 1 ≥ 0 , we choose the offspring mean m subject to
1 < m ≤ 1 + n ¯ 1 − a .
Assuming this condition, f ( s ) is indeed the generating function of an offspring law with support S = { 1 , 1 + n ¯ , 1 + 2 n , … } and
P ( ζ = 1 + j n ) = ( 1 − p 1 ) ( 1 − a ) a j − 1 , ( j = 1 , 2 , … ) .
An admissible choice is p 1 = 1 − ( m − 1 ) / q n , in which case p 1 = a , i.e., the offspring law is geometric with parameter a and support S .
If a > 1 , then p 1 = 1 − ( m − 1 ) / q n ; choosing 1 < m ≤ 1 + q n , f ( s ) has the form in (69), with p replacing a. In addition, a geometric law with parameter p supported on S results if m = 1 + p q n = 1 + n ¯ / ( a − 1 ) , which is an admissible choice. Note that if 0 < a ≠ 1 , then χ ( θ ; a , 1 / q n ) is the LST of the martingale limit of a family of supercritical MBPs in which each family is indexed by m > 1 , subject to the upper-bound restrictions described above.
Finally, if a = 1 , similar calculations lead to the identity
m − 1 f ( s ) − s = − ( s t ) − 1 ( 1 + t / log s ) .
The right-hand side is zero at s = s * = e − t , implying that f ( s ) has a fixed point at s * . Hence, if f ( s ) is a probability generating function, then f ( 0 ) > 0 . However, the right-hand side of (70) tends to − ∞ as s ↓ 0 , which is a contradiction. Thus, the Lambert function case a = 1 reveals its singularity by not corresponding to the martingale limit of a supercritical MBP.

8. Some Final Remarks

The results of Section 4 and Section 7 can be conceived in terms of an infinite fibre or thread of SD laws F 1 = { L ( X a ) : a > 0 } ; in each of these, the elements are the martingale limit law of a supercritical CB-process. The element L ( X 1 ) of F 1 , for which the CF is W ( θ ) , is the only element with a generating subordinator that has a continuous Lévy measure: its CF is θ / ( 1 + θ ) . Clearly, other such fibres can be constructed from any family of generating subordinators having a CF C a ( θ ) indexed by a parameter a > 0 such that C a ( θ ) → θ / ( 1 + θ ) as a → 1 . For example, C a ( θ ) = 1 − ( 1 + θ ) − a corresponds to a compound Poisson process with gamma-distributed jumps. Some other examples can be found early in the dictionary of complete Bernstein functions in [28].
A detailed analysis of such a fibre, F 2 = { L ( V a ) : a ≥ 1 } , can be found in [17]. The formulation there is in terms of a parameter q > 0 , which here is given by q = a − 1 . The law L ( V a ) is the martingale limit law of the CB-process for which the generating subordinator has the CF
C a ( θ ) = θ · 1 + ( a − 1 ) θ 1 + a θ ,
i.e., the generator is the compound Poisson process for which the drift parameter is δ = 1 − a − 1 and the density of its Lévy measure is a − 3 e − x / a , i.e., exponentially distributed jumps.

Funding

This research received no external funding.

Data Availability Statement

There are no data supporting this research.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Steutel, F.W.; van Harn, K. Infinite Divisibility of Probability Distributions on the Real Line; Marcel Dekker, Inc.: New York, NY, USA, 2004. [Google Scholar]
  2. Bondesson, L. Generalized Gamma Convolutions and Related Classes of Distributions and Densities; Springer: Berlin/Heidelberg, Germany, 1992. [Google Scholar]
  3. Olver, F.; Lozier, D.; Boisvert, R.; Clark, C. NIST Handbook of Mathematical Functions; C.U.P.: Cambridge, UK, 2010. [Google Scholar]
  4. Corless, R.M.; Gonnet, G.H.; Hare, D.; Jeffrey, D.J.; Knuth, D.E. On the Lambert W function. Adv. Comp. Math. 1996, 5, 329–359. [Google Scholar] [CrossRef] [Scilit]
  5. Valluri, S.; Gil, M.; Jeffrey, D.; Basu, S. The Lambert W function and quantum statistics. J. Math. Phys. 2009, 50, 102103. [Google Scholar] [CrossRef] [Scilit]
  6. Belkic, D. All the trinomial roots, their powers and logs from the Lambert series, Bell polynomials and Fox-Wright functions: Illustration for genome multiplicity in survival of irradiated cells. J. Math. Chem. 2019, 57, 59–106. [Google Scholar]
  7. Jurek, Z.J. Random integral representations for classes of limit distributions similar to Lévy class L0. Probab. Theory Relat. Fields 1988, 78, 473–490. [Google Scholar] [CrossRef] [Scilit]
  8. Jurek, Z.J. Self-decomposabiity, perpetuity laws and stopping times. Probab. Math. Stat. 1999, 19, 413–419. [Google Scholar]
  9. Iksanov, A.M.; Jurek, Z.J.; Schreiber, B.M. A new factorisation property of the self-decomposable probability measures. Ann. Probab. 2004, 32, 1356–1369. [Google Scholar] [CrossRef] [Scilit]
  10. Urbanik, K. Limit laws for sequences of normed sums satisfying some stability conditions. In Multivariate Analysis III; Krishnaiah, P.R., Ed.; Academic Press: New York, NY, USA, 1973; pp. 225–237. [Google Scholar]
  11. Berg, C.; Forst, G. Multiply self-decomposable probability measures on R+ and Z+. Z. Wahrscheinlichkeitstheorie Verwandte Geb. 1983, 62, 147–163. [Google Scholar] [CrossRef] [Scilit]
  12. Pakes, A.G.; Sapatinas, T.; Fosam, E.B. Characterizations, length-biasing, and infinite divisibility. Stat. Pap. 1996, 37, 53–69. [Google Scholar] [CrossRef] [Scilit]
  13. Pakes, A.G. Lambert’s W, infinite divisibility and Poisson mixtures. J. Math. Anal. Appl. 2011, 378, 480–492. [Google Scholar] [CrossRef] [Scilit]
  14. Kalugin, G.A.; Jeffrey, D.J. Unimodal sequences show Lambert W is Bernstein. C. R. Math. Acad. Sci. R. Can. 2011, 33, 50–56. [Google Scholar]
  15. Kalugin, G.A.; Jeffrey, D.J.; Corless, R.M.; Borwein, P.B. Stieltjes and other integral representations for functions of Lambert W. Integral Transform. Spec. Funct. 2012, 23, 581–593. [Google Scholar] [CrossRef] [Scilit]
  16. Pakes, A.G. The Lambert function, Nuttall’s integral, and the Lambert law. Stat. Probab. Lett. 2018, 139, 53–60. [Google Scholar] [CrossRef] [Scilit]
  17. Pakes, A.G. Self-decomposable laws from continuous branching processes. J. Theor. Probab. 2020, 33, 361–395. [Google Scholar]
  18. Bingham, N.; Goldie, C.; Teugels, J. Regular Variation; C.U.P.: Cambridge, UK, 1987. [Google Scholar]
  19. Whitt, W. The renewal-process stationary-excess operator. J. Appl. Probab. 1985, 22, 156–167. [Google Scholar] [CrossRef] [Scilit]
  20. Vervaat, W. On a stochastic difference equation and a representation of non-negative infinitely divisible random variables. Adv. Appl. Probab. 1979, 11, 750–783. [Google Scholar] [CrossRef] [Scilit]
  21. Sato, K.-I. Lévy Processes and Infinitely Divisible Distributions; C.U.P.: Cambridge, UK, 1999. [Google Scholar]
  22. Pólya, G.; Szegö, G.S. Problems and Theorems in Analysis, Vol. 1; Springer: Berlin/Heidelberg, Germany, 1972. [Google Scholar]
  23. Pakes, A.G. Limit laws for UGROW random graphs. Stat. Probab. Lett. 2013, 83, 2607–2614. [Google Scholar] [CrossRef] [Scilit]
  24. Uchaikin, V.V.; Zolotarev, V.M. Chance and Stability; VSP: Utrecht, The Netherlands, 1999. [Google Scholar]
  25. Billingsley, P. Probability and Measure, 2nd. ed.; John Wiley: New York, NY, USA, 1986. [Google Scholar]
  26. Iksanov, A.M.; Jurek, Z.J. Shot noise distributions and self-decomposability. Stoch. Anal. Appl. 2003, 21, 593–609. [Google Scholar] [CrossRef] [Scilit]
  27. Turnbull, H.W. Theory of Equations; Oliver & Boyd: Edinburgh, UK, 1944. [Google Scholar]
  28. Schilling, R.N.; Song, R.; Vondracek, Z. Bernstein Functions; De Gruyter: Berlin, Germany, 2010. [Google Scholar]
  29. Urbanik, K. A representation of self-decomposable distributions. Bull. Acad. Pol. Sci. Sér. Sci. Math. Astron. Phys. 1968, 16, 209–214. [Google Scholar]
  30. Pakes, A.G. Some limit theorems for Markov chains with applications to branching processes. In Studies in Probability and Statistics: Papers in Honour of Edwin J.G. Pitman; Williams, E.J., Ed.; Jerusalem Academic Press: Jerusalem, Israel, 1974; pp. 21–39. [Google Scholar]
  31. Athreya, K.B.; Ney, P.E. Branching Processes; Springer: Berlin/Heidelberg, Germany, 1972. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.