Skip to main content
Entropy logoLink to Entropy
. 2020 Aug 8;22(8):874. doi: 10.3390/e22080874

Some Dissimilarity Measures of Branching Processes and Optimal Decision Making in the Presence of Potential Pandemics

Niels B Kammerer 1, Wolfgang Stummer 2,*
PMCID: PMC7517477  PMID: 33286645

Abstract

We compute exact values respectively bounds of dissimilarity/distinguishability measures–in the sense of the Kullback-Leibler information distance (relative entropy) and some transforms of more general power divergences and Renyi divergences–between two competing discrete-time Galton-Watson branching processes with immigration GWI for which the offspring as well as the immigration (importation) is arbitrarily Poisson-distributed; especially, we allow for arbitrary type of extinction-concerning criticality and thus for non-stationarity. We apply this to optimal decision making in the context of the spread of potentially pandemic infectious diseases (such as e.g., the current COVID-19 pandemic), e.g., covering different levels of dangerousness and different kinds of intervention/mitigation strategies. Asymptotic distinguishability behaviour and diffusion limits are investigated, too.

Keywords: Galton-Watson branching processes with immigration, Hellinger integrals, power divergences, Kullback-Leibler information distance/divergence, relative entropy, Renyi divergences, epidemiology, COVID-19 pandemic, Bayesian decision making, INARCH(1) model, GLM model, Bhattacharyya coefficient/distance


Contents

1 Introduction 3
2 The Framework and Application Setups 5
  2.1 Process Setup 5
  2.2 Connections to Time Series of Counts 6
  2.3 Applicability to Epidemiology 8
  2.4 Information Measures 12
  2.5 Decision Making under Uncertainty 15
  2.6 Asymptotical Distinguishability 19
3 Detailed Recursive Analyses of Hellinger Integrals 21
  3.1 A First Basic Result 21
  3.2 Some Useful Facts for Deeper Analyses 25
  3.3 Detailed Analyses of the Exact Recursive Values, i.e., for the Cases βA,βH,αA,αH∈PNI∪PSP,1 27
  3.4 Some Preparatory Basic Facts for the Remaining Cases βA,βH,αA,αH∈PSP\PSP,1 29
  3.5 Lower Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[ 31
  3.6 Goals for Upper Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[ 32
  3.7 Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,2×]0,1[ 34
  3.8 Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3a×]0,1[ 35
  3.9 Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3b×]0,1[ 36
  3.10 Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3c×]0,1[ 37
  3.11 Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,4a×]0,1[ 37
  3.12 Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,4b×]0,1[ 37
  3.13 Concluding Remarks on Alternative Upper Bounds for all Cases βA,βH,αA,αH,λ∈ (PSP\PSP,1)×]0,1[ 37
  3.14 Intermezzo 1: Application to Asymptotical Distinguishability 38
  3.15 Intermezzo 2: Application to Decision Making under Uncertainty 39
   3.15.1 Bayesian Decision Making 39
   3.15.2. Neyman-Pearson Testing 41
  3.16 Goals for Lower Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1]) 41
  3.17 Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,2×(R\[0,1]) 44
  3.18 Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3a×(R\[0,1]) 45
  3.19 Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3b×(R\[0,1]) 46
  3.20 Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3c×(R\[0,1]) 47
  3.21 Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,4a×(R\[0,1]) 47
  3.22 Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,4b×(R\[0,1]) 48
  3.23 Concluding Remarks on Alternative Lower Bounds for all Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1]) 48
  3.24 Upper Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1]) 48
4 Power Divergences of Non-Kullback-Leibler-Information-Divergence Type 49
  4.1 A First Basic Result 49
  4.2 Detailed Analyses of the Exact Recursive Values of Iλ(·∥·), i.e., for the Cases βA,βH,αA,αH,λ∈(PNI∪PSP,1)×(R\{0,1}) 51
  4.3 Lower Bounds of Iλ(·∥·) for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[ 52
  4.4 Upper Bounds of Iλ(·∥·) for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[ 53
  4.5 Lower Bounds of Iλ(·∥·) for the Cases (βA,βH,αA,αH,λ)∈(PSP\PSP,1)×(R\[0,1]) 53
  4.6 Upper Bounds of Iλ(·∥·) for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1]) 54
  4.7 Applications to Bayesian Decision Making 55
5 Kullback-Leibler Information Divergence (Relative Entropy) 55
  5.1 Exact Values Respectively Upper Bounds of I(·||·) 55
  5.2 Lower Bounds of I(·||·) for the Cases βA,βH,αA,αH∈(PSP\PSP,1) 56
  5.3 Applications to Bayesian Decision Making 58
6 Explicit Closed-Form Bounds of Hellinger Integrals 59
  6.1 Principal Approach 59
  6.2 Explicit Closed-Form Bounds for the Cases βA,βH,αA,αH,λ∈(PNI∪PSP,1)×(R\{0,1}) 63
  6.3 Explicit Closed-Form Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[ 64
  6.4 Explicit Closed-Form Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1]) 67
  6.5 Totally Explicit Closed-Form Bounds 69
  6.6 Closed-Form Bounds for Power Divergences of Non-Kullback-Leibler-Information-Divergence Type 70
  6.7 Applications to Decision Making 71
7 Hellinger Integrals and Power Divergences of Galton-Watson Type Diffusion Approximations 71
  7.1 Branching-Type Diffusion Approximations 71
  7.2 Bounds of Hellinger Integrals for Diffusion Approximations 74
  7.3 Bounds of Power Divergences for Diffusion Approximations 79
  7.4 Applications to Decision Making 80
A Proofs and Auxiliary Lemmas 81
  A.1. Proofs and Auxiliary Lemmas for Section 3 81
  A.2 Proofs and Auxiliary Lemmas for Section 5 88
  A.3 Proofs and Auxiliary Lemmas for Section 6 94
  A.4 Proofs and Auxiliary Lemmas for Section 7 101
References 115

1. Introduction

(This paper is a thoroughly revised, extended and retitled version of the preprint arXiv:1005.3758v1 of both authors) Over the past twenty years, density-based divergences D(P,Q) –also known as (dis)similarity measures, directed distances, disparities, distinguishability measures, proximity measures–between probability distributions P and Q, have turned out to be of substantial importance for decisive statistical tasks such as parameter estimation, testing for goodness-of-fit, Bayesian decision procedures, change-point detection, clustering, as well as for other research fields such as information theory, artificial intelligence, machine learning, signal processing (including image and speech processing), pattern recognition, econometrics, and statistical physics. For some comprehensive overviews on the divergence approach to statistics and probability, the reader is referred to the insightful books of e.g., Liese & Vajda [1], Read & Cressie [2], Vajda [3], Csiszár & Shields [4], Stummer [5], Pardo [6], Liese & Miescke [7], Basu et al. [8], Voinov et al. [9], the survey articles of e.g., Liese & Vajda [10], Vajda & van der Meulen [11], the structure-building papers of Stummer & Vajda [12], Kißlinger & Stummer [13] and Broniatowski & Stummer [14], and the references therein. Divergence-based bounds of minimal mean decision risks (e.g., Bayes risks in finance) can be found e.g., in Stummer & Vajda [15] and Stummer & Lao [16].

Amongst the above-mentioned dissimilarity measures, an important omnipresent subclass are the so-called f–divergences of Csiszar [17], Ali & Silvey [18] and Morimoto [19]; important special cases thereof are the total variation distance and the very frequently used λ–order power divergences Iλ(P,Q) (also known as alpha-entropies, Cressie-Read measures, Tsallis cross-entropies) with λ∈R. The latter cover e.g., the very prominent Kullback-Leibler information divergence I1(P,Q) (also called relative entropy), the (squared) Hellinger distance I1/2(P,Q), as well as the Pearson chi-square divergence I2(P,Q). It is well known that the power divergences can be build with the help of the λ–order Hellinger integrals Hλ(P,Q) (where e.g., the case λ=1/2 corresponds to the well-known Bhattacharyya coefficient), which are information measures of interest by their own and which are also the crucial ingredients of λ–order Renyi divergences Rλ(P,Q) (see e.g., Liese & Vajda [1], van Erven & Harremoes [20]); the case R1/2(P,Q) corresponds to the well-known Bhattacharyya distance.

The above-mentioned information/dissimilarity measures have been also investigated in non-static, time-dynamic frameworks such as for various different contexts of stochastic processes like processes with independent increments (see e.g., Newman [21], Liese [22], Memin & Shiryaev [23], Jacod & Shiryaev [24], Liese & Vajda [1], Linkov & Shevlyakov [25]), Poisson point processes (see e.g., Liese [26], Jacod & Shiryaev [24], Liese & Vajda [1]), diffusion prcoesses and solutions of stochastic differential equations with continuous paths (see e.g., Kabanov et al. [27], Liese [28], Jacod & Shiryaev [24], Liese & Vajda [1], Vajda [29], Stummer [30,31,32], Stummer & Vajda [15]), and generalized binomial processes (see e.g., Stummer & Lao [16]); further related literature can be found e.g., in references of the aforementioned papers and books.

Another important class of time-dynamic models is given by discrete-time integer-valued branching processes, in particular (Bienaymé-)Galton-Watson processes without immigration GW respectively with immigration (resp. importation, invasion) GWI, which have numerous applications in biotechnology, population genetics, internet traffic research, clinical trials, asset price modelling, derivative pricing, and many others. As far as important terminology is concerned, we abbreviatingly subsume both models as GW(I) and, simply as GWI in case that GW appears as a parameter-special-case of GWI; recall that a GW(I) is called subcritical respectively critical respectively supercritical if its offspring mean is less than 1 respectively equal to 1 respectively larger than 1.

For applications of GW(I) in epidemiology, see e.g., the works of Bartoszynski [33], Ludwig [34], Becker [35,36], Metz [37], Heyde [38], von Bahr & Martin-Löf [39], Ball [40], Jacob [41], Barbour & Reinert [42], Section 1.2 of Britton & Pardoux [43]); for more details see Section 2.3 below.

For connections of GW(I) to time series of counts including GLM models, see e.g., Dion, Gauthier & Latour [44], Grunwald et al. [45], Kedem & Fokianos [46], Held, Höhle & Hofmann [47], and Weiß [48]; a more comprehensive discussion can be found in Section 2.2 below.

As far as the combined study of information measures and GW processes is concerned, let us first mention that (transforms of) power divergences have been used for supercritical Galton-Watson processes without immigration for instance as follows: Feigin & Passy [49] study the problem to find an offspring distribution which is closest (in terms of relative entropy type distance) to the original offspring distribution and under which ultimate extinction is certain. Furthermore, Mordecki [50] gives an equivalent characterization for the stable convergence of the corresponding log-likelihood process to a mixed Gaussian limit, in terms of conditions on Hellinger integrals of the involved offspring laws. Moreover, Sriram & Vidyashankar [51] study the properties of offspring-distribution-parameters which minimize the squared Hellinger distance between the model offspring distribution and the corresponding non-parametric maximum likelihood estimator of Guttorp [52]. For the setup of GWI with Poisson offspring and nonstochastic immigration of constant value 1, Linkov & Lunyova [53] investigate the asymptotics of Hellinger integrals in order to deduce large deviation assertions in hypotheses testing problems.

In contrast to the above-mentioned contexts, this paper pursues the following main goals:

  • (MG1)

    for any time horizon and any criticality scenario (allowing for non-stationarities), to compute lower and upper bounds–and sometimes even exact values–of the Hellinger integrals HλPA∥PH, power divergences IλPA∥PH and Renyi divergences RλPA∥PH of two alternative Galton-Watson branching processes PA and PH (on path/scenario space), where (i) PA has Poisson(βA) distributed offspring as well as Poisson(αA) distributed immigration, and (ii) PH has Poisson(βH) distributed offspring as well as Poisson(αH) distributed immigration; the non-immigration cases are covered as αA=αH=0; as a side effect, we also aim for corresponding asymptotic distinguishability results;

  • (MG2)

    to compute the corresponding limit quantities for the context in which (a proper rescaling of) the two alternative Galton-Watson processes with immigration converge to Feller-type branching diffusion processes, as the time-lags between the generation-size observations tend to zero;

  • (MG3)

    as an exemplary field of application, to indicate how to use the results of (MG1) for Bayesian decision making in the epidemiological context of an infectious-disease pandemic (e.g., the current COVID-19), where e.g., potential state-budgetary losses can be controlled by alternative public policies (such as e.g., different degrees of lockdown) for mitigations of the time-evolution of the number of infectious persons (being quantified by a GW(I)). Corresponding Neyman-Pearson testing will be treated, too.

Because of the involved Poisson distributions, these goals can be tackled with a high degree of tractability, which is worked out in detail with the following structure (see also the full table of contents after this paragraph): in Section 2, we first introduce (i) the basic ingredients of Galton-Watson processes together with their interpretations in the above-mentioned pandemic setup where it is essential to study all types of criticality (being connected with levels of reproduction numbers), (ii) the employed fundamental information measures such as Hellinger integrals, power divergences and Renyi divergences, (iii) the underlying decision-making framework, as well as (iv) connections to time series of counts and asymptotical distinguishability. Thereafter, we start our detailed technical analyses by giving recursive exact values respectively recursive bounds–as well as their applications–of Hellinger integrals HλPA∥PH (see Section 3), power divergences IλPA∥PH and Renyi divergences RλPA∥PH (see Section 4 and Section 5). Explicit closed-form bounds of Hellinger integrals HλPA∥PH will be worked out in Section 6, whereas Section 7 deals with Hellinger integrals and power divergences of the above-mentioned Galton-Watson type diffusion approximations.

2. The Framework and Application Setups

2.1. Process Setup

We investigate dissimilarity measures and apply them to decisions, in the following context. Let the integer-valued random variable Xn (n∈N0) denote the size of the nth generation of a population (of persons, organisms, spreading news, other kind of objects, etc.) with specified characteristics, and suppose that for the modelling of the time-evolution n↦Xn we have the choice between the following two (e.g., alternative, competing) models (H) and (A):

(H) a discrete-time homogeneous Galton-Watson process with immigration GWI, given by the recursive description

X0∈N;N0∋Xn=∑k=1Xn−1Yn−1,k+Y˜n,n∈N, (1)

where Yn−1,k is the number of offspring of the kth object (e.g., organism, person) within the (n−1)th generation, and Y˜n denotes the number of immigrating objects in the nth generation. Notice that we employ an arbitrary deterministic (i.e., degenerate random) initial generation size X0. We always assume that under the corresponding dynamics-governing law PH

  • (GWI1)

    the collection Y:=Yn−1,k,n∈N,k∈N consists of independent and identically distributed (i.i.d.) random variables which are Poisson distributed with parameter βH>0,

  • (GWI2)

    the collection Y˜:=Y˜n,n∈N consists of i.i.d. random variables which are Poisson distributed with parameter αH≥0 (where αH=0 stands for the degenerate case of having no immigration),

  • (GWI3)

    Y and Y˜ are independent.

(A) a discrete-time homogeneous Galton-Watson process with immigration GWI given by the same recursive description (1), but with different dynamics-governing law PA under which (GWI1) holds with parameter βA>0 (instead of βH>0), (GWI2) holds with αA≥0 (instead of αH≥0), and (GWI3) holds. As a side remark, in some contexts the two models (H) and (A) may function as a “sandwich” of a more complicated not fully known model.

Basic and advanced facts on general GWI (introduced by Heathcote [54]) can be found e.g., in the monographs of Athreya & Ney [55], Jagers [56], Asmussen & Hering [57], Haccou [58]; see also e.g., Heyde & Seneta [59], Basawa & Rao [60], Basawa & Scott [61], Sankaranarayanan [62], Wei & Winnicki [63], Winnicki [64], Guttorp [52] as well as Yanev [65] (and also the references therein all those) for adjacent fundamental statistical issues including the involved technical and conceptual challenges.

For the sake of brevity, wherever we introduce or discuss corresponding quantities simultaneously for both models H and A, we will use the subscript • as a synonym for either the symbol H or A. For illustration, recall the well-known fact that the corresponding conditional probabilities P•(Xn=·|Xn−1=k) are again Poisson-distributed, with parameter β•·k+α•.

In oder to achieve a transparently representable structure of our results, we subsume the involved parameters as follows:

  • (PS1)

    PSP is the set of all constellations βA,βH,αA,αH of real-valued parameters βA>0, βH>0, αA>0, αH>0, such that βA≠βH or αA≠αH (or both); in other words, both models are non-identical and have non-vanishing immigration;

  • (PS2)

    PNI is the set of all βA,βH,αA,αH of real-valued parameters βA>0, βH>0, αA=αH=0, such that βA≠βH; this corresponds to the important special case that both models have no immigration and are non-identical;

  • (PS3)

    the resulting disjoint union will be denoted by P=PSP∪PNI.

Notice that for (unbridgeable) technical reasons, we do not allow for “crossovers” between “immigration and no-immigration” (i.e., αA=0 and αH≠0, respectively, αA≠0 and αH=0). For practice, this is not a strong restriction, since one may take e.g., αA=10−12 and αH=1.

For the non-immigration case α•=0 one has the following extinction properties (see e.g., Harris [66], Athreya & Ney [55]). As usual, let us define the extinction time τ:=min{i∈N:Xℓ=0 for all integers ℓ≥i} if this minimum exists, and τ:=∞ else. Correspondingly, let B:={τ<∞} be the extinction set. If the offspring mean β• satisfies β•<1—which is called the subcritical case– or β•=1—which is known as the critical case–then extinction is certain, i.e., there holds P(B|X0=1)=1. However, if the offspring mean satisfies β•>1—which is called the supercritical case–then there is a probability greater than zero, that the population never dies out, i.e., P(B|X0=1)∈]0,1[. In the latter case, Xn explodes (a.s.) to infinity as n→∞.

In contrast, for the (nondegenerate, nonvanishing) immigration case α•≠0 there is no extinction, viz. P(B|X0=1)=0, although there may be zero population Xℓ0=0 for some intermediate time ℓ0∈N; but due to the immigration, with probability one there is always a later time ℓ1>ℓ0, such that Xℓ1>0. Nevertheless, also for the setup α•≠0 it is important to know whether β•⪌1—which is still called (super-, sub-)criticality–since e.g., in the case β•<1 the population size Xn converges (as n→∞) to a stationary distribution on N whereas for β•>1 the behaviour is non-stationary (non-ergodic), see e.g., Athreya & Ney [55].

At this point, let us emphasize that in our investigations (both for α•=0 and for α•≠0) we do allow for “crossovers” between “different criticalities”, i.e., we deal with all cases βA⪌1 versus all cases βH⪌1; as will be explained in the following, this unifying flexibility is especially important for corresponding epidemiological-model comparisons (e.g., for the sake of decision making).

One of our main goals is to quantitatively compare (the time-evolution of) two competing GWI models H and A with respective parameter sets (βH,αH) and (βA,αA), in terms of the information measures HλPA∥PH (Hellinger intergrals), IλPA∥PH (power divergences), RλPA∥PH (Renyi divergences). The latter two express a distance (degree of dissimilarity) between H and A. From this, we shall particularly derive applications for decision making under uncertainty (including tests).

2.2. Connections to Time Series of Counts

It is well known that a Galton-Watson process with Poisson offspring (with parameter β•) and Poisson immigration (with parameter α•) is “distributionally” equal to each of the following models (listed in “tree-type” chronological order):

  • (M1)

    a Poissonian Generalized Integer-valued Autoregressive process GINAR(1) in the sense of Gauthier & Latour [67] (see also Dion, Gauthier & Latour [44], Latour [68], as well as Grunwald et al. [45]), that is, a first-order autoregressive times series with Poissonian thinning (with parameter β•) and Poissonian innovations (with parameter α•);

  • (M2)

    Poissonian first order Conditional Linear Autoregressive model (Poissonian CLAR(1)) in the sense of Grunwald et al. [45] (and earlier preprints thereof) (since the conditional expectation is EP•[Xn|Fn−1]=α•+β•·Xn−1); this can be equally seen as Poissonian autoregressive Generalized Linear Model GLM with identity link function (cf. [45] as well as Chapter 4 of Kedem & Fokianos [46]), that is, an autoregressive GLM with Poisson distribution as random component and the identity link as systematic component;

    the same model was used (and generalized)
    • (M2i)
      under the name BIN(1) by Rydberg & Shephard [69] for the description of the number Xn of stock transactions/trades recorded up to time n;
    • (M2ii)
      under the name Poisson autoregressive model PAR(1) by Brandt & Williams [70] for the description of event counts in political and other social science applications;
    • (M2iii)
      under the name Autoregressive Conditional Poisson model ACP(1,0) by Heinen [71];
    • (M2iv)
      by Held, Höhle & Hofmann [47] as well as Held et al. [72], as a description of the time-evolution of counts from infectious disease surveillance databases, where β• (respectively, α•) is interpreted as driving parameter of epidemic (respectively, endemic) component; in principle, this type of modelling can be also implicitly recovered as a special case of the epidemics-treating work of Finkenstädt, Bjornstad & Grenfell [73], by assuming trend- and season-neglecting (e.g., intra-year) measles data in urban areas of about 10 million people (provided that their population size approximation extends linearly);
    • (M2v)
      under the name integer-valued Generalized Autoregressive Conditional Heteroscedastic model INGARCH(1,0) by Ferland, Latour & Oraichi [74] (since the conditional variance is VarP•[Xn|Fn−1]=α•+β•·Xn−1), see also Weiß [75]; this has been refinely named as INARCH(1) model by Weiß [76,77], and frequently applied thereafter; for an “overlapping-generation type” interpretation of the INARCH(1) model, which is an adequate description for the time-evolution of overdispersed counts with an autoregressive serial dependence structure, see Weiß & Testik [78]; for a corresponding comprehensive recent survey (also to more general count time series), the reader is referred to the book of Weiß [48];

Moreover, according to the general considerations of Grunwald et al. [45], the Poissonian Galton-Watson model with immigration may possibly be “distributionally equal” to an integer-valued autoregressive model with random coefficient (thinning).

Nowadays, besides the name homogeneous Galton-Watson model with immigration GWI, the name INARCH(1) seems to be the most used one, and we follow this terminology (with emphasis on GWI). Typical features of the above-mentioned models (M1) to (M2v), are the use of Z as the set of times, and the assumptions α•>0 as well as β•∈]0,1[, which guarantee stationarity and ergodicity (see above). In contrast, we employ N0 as the set of times, degenerate (and thus, non-equilibrium) starting distribution, and arbitrary α•≥0 as well as β•>0. For such a situation, as explained above, we quantitatively compare two competing GWI models H and A with respective parameter sets (βH,αH) and (βA,αA). Since–as can be seen e.g., in (29) below—we basically employ only (conditionally) distributional ingredients, such as the corresponding likelihood ratio (see e.g., (13) to (15), (27) to (29) below), all the results of the Section 3, Section 4, Section 5 and Section 6 can be immediately carried over to the above-mentioned time-series contexts (where we even allow for non-stationarities, in fact we start with a one-point/Dirac distribution); for the sake of brevity, in the rest of the paper this will not be mentioned explicitly anymore.

Notice that a Poissonian GWI as well as all models (M1) and (M2) are–despite of their conditional Poisson law– typically overdispersed since

EP•[Xn]=α•+β•·EP•[Xn−1]≤α•+β•·EP•[Xn−1]+β•2·VarP•[Xn−1]=VarP•[Xn],n∈N\{1},

with equality iff (i.e., if and only if) α•=0 (NI) and Xn−2=0 (extinction at n−2 with n≥3).

2.3. Applicability to Epidemiology

The above-mentioned framework can be used for any of the numerous fields of applications of discrete-time branching processes, and of the closely related INARCH(1) models. For the sake of brevity, we explain this—as a kind of running-example—in detail for the currently highly important context of the epidemiology of infectious diseases. For insightful non-mathematical introductions to the latter, see e.g., Kaslow & Evans [79], Osterholm & Hedberg [80]; for a first entry as well as overviews on modelling, the reader is referred to e.g., Grassly & Fraser [81], Keeling & Rohani [82], Yan [83,84], Britton [85], Diekmann, Heesterbeek & Britton [86], Cummings & Lessler [87], Just et al. [88], Britton & Giardina [89], Britton & Pardoux [43]. A survey on the particular role of branching processes in epidemiology can be found e.g., in Jacob [41].

Undoubtedly, by nature, the spreading of an infectious disease through a (human, animal, plant) population is a branching process with possible immigration. Indeed, typically one has the following mechanism:

  • (D1)

    at some time tkE–called the time of exposure (moment of infection)—an individual k of a specified population is infected in a wide sense, i.e., entered/invaded/colonized by a number of transmissible disease-causative pathogens (etiologic agents such as viruses, bacteria, protozoans and other parasites, subviruses (e.g., prions and plant viroids), etc.); the individual is then a host (of pathogens);

  • (D2)

    depending on the level of immunity and some other factors, these pathogens may multiply/replicate within the host to an extent (over a threshold number) such that at time tkI some of the pathogens start to leave their host (shedding of pathogens); in other words, the individual k becomes infectious at the time tkI of onset of infectiousness. Ex post, one can then say that the individual became infected in the narrow sense at earlier time tkE and call it a primary case. The time interval [tkE,tkI[ is called the latent/latency/pre-infectious period of k, and tkI−tkE its duration (in some literature, there is no verbal distinction between them); notice that tkI may differ from the time tkOS of onset (first appearance) of symptoms, which leads to the so-called incubation period [tkE,tkOS[; if tkI<tkOS then [tkI,tkOS[ is called the pre-symptomatic period;

  • (D3)

    as long as the individual k stays infectious, by shedding of pathogens it may infect in a narrow sense a random number Yk∈N0 of other individuals which are susceptible (i.e., neither immune nor already infected in a narrow sense), where the distribution of Yk depends on the individual’s (natural, voluntary, forced) behaviour, its environment, as well as some other factors e.g., connected with the type of pathogen transmission; the newly infected individuals are called offspring of k, and secondary cases if they are from the same specified population or exportations if they are from a different population; from the view of the latter, these infections are imported cases and thus can be viewed as immigrants;

  • (D4)

    at the time tkR of cessation of infectiousness, the individual stops being infectious (e.g., because of recovery, death, or total isolation); the time interval [tkI,tkR[ is called the period of infectiousness (also period of communicability, infectious/infective/shedding/contagious period) of k, and tkR−tkI its duration (in some literature, there is no verbal distinction between them); notice that tkR may differ from the time tkCS of cessation (last appearance) of symptoms which leads to the so-called sickness period [tkOS,tkCS[;

  • (D5)

    this branching mechanism continues within the specified population until there are no infectious individuals and also no importations anymore (eradication, full extinction, total elimination)– up to a specified final time (which may be large or even infinite);

All the above-mentioned times tk· and time intervals are random, by nature. Two further connected quantities are also important for modelling (see e.g., Yan & Chowell [84] (p. 241ff), including a history of corresponding terminology). Firstly, the generation interval (generation time, transmission interval) is the time interval from the onset of infectiousness in a primary case (called the infector) to the onset of infectiousness in a secondary case (called the infectee) infected by the primary case; clearly, the generation interval is random, and so is its duration (often, the (population-)mean of the latter is also called generation interval). Typically, generation intervals are important ingredients of branching process models of infectious diseases. Secondly, the serial interval describes time interval from the onset of symptoms in a primary case to the onset of symptoms in a secondary case infected by the primary case. By nature, the serial interval is random, and so is its duration (often, the (population-)mean of the latter is also called serial interval). Typically, the serial interval is easier to observe than the generation interval, and thus, the latter is often approximately estimated from data of the former. For further investigations on generation and serial intervals, the reader is referred to e.g., Fine [90], Svensson [91,92], Wallinga & Lipsitch [93], Forsberg White & Pagano [94], Nishiura [95], Scalia Tomba et al. [96], Trichereau et al. [97], Vink, Bootsma & Wallinga [98], Champredon & Dushoff [99], Just et al. [88], and–especially for the novel COVID-19 pandemics—An der Heiden & Hamouda [100], Ferretti et al. [101], Ganyani et al. [102], Li et al. [103], Nishiura, Linton & Akhmetzhanov [104], Park et al. [105].

With the help of the above-mentioned individual ingredients, one can aggregatedly build numerous different population-wide models of infectious diseases in discrete time as well as in continuous time; the latter are typically observed only in discrete-time steps (discrete-time sampling), and hence in the following we concentrate on discrete-time modelling (of the real or the observational process). In fact, we confine ourselves to the important task of modelling the evolution n↦Xn of the number of incidences at “stage” n, where incidence refers to the number of new infected/infectious individuals. Here, n may be a generation number where, inductively, n=0 refers to the generation of the first appearing primary cases in the population (also called initial importations), and n refers to the generation of offsprings of all individuals of generation n−1. Alternatively, n may be the index of a physical (“calender”) point of time tn, which may be deterministic or random; e.g., (tn)n∈N may be a strictly increasing series of (i) equidistant deterministic time points (and thus, one can identify tn=n in appropriate time units such as days, weeks, bi-weeks, months), or (ii) non-equidistant deterministic time points, or (iii) random time points (as a side remark, let us mention that in some situations, Xn may alternatively denote the number of prevalences at “stage” n, where prevalence refers to the total number of infected/infectious individuals (e.g., through some methodical tricks like “self-infection”)).

In the light of this, one can loosely define an epidemic as the rapid spread of an infectious disease within a specified population, where the numbers Xn of incidences are high (or much higher than expected) for that kind of population. A pandemic is a geographically large-scale (e.g., multicontinental or worldwide) epidemic. An outbreak/onset of an epidemic in the narrow sense is the (time of) change where an infectious disease turns into an epidemic, which is typically quantified by exceedance over an threshold; analogously, an outbreak/onset of a pandemic is the (time of) change where the epidemic turns into a pandemic. Of course, one goal of infectious-disease modelling is to quantify “early enough” the potential danger of an emerging outbreak of an epidemic or a pandemic.

Returning to possible models of the incidence-evolution n↦Xn, its description may be theoretically derived from more detailed, time-finer, highly sophisticated, individual-based “mechanistic” infectious-disease models such as e.g., continuous-time suscetible-exposed-infectious-recovered (SEIR) models (see the above-mentioned introductory texts); however, as e.g., pointed out in Held et al. [72], the estimation of the correspondingly involved numerous parameters may be too ambitious for routinely collected, non-detailed disease data, such as e.g., daily/weekly counts Xn of incidences–especially in decisive emerging/early phases of a novel disease (such as the current COVID-19 pandemic). Accordingly, in the following we assume that Xn can be approximately described by a Poissonian Galton-Watson process with immigration respectively a (“distributionally equal”) Poissonian autoregressive Generalized Linear Model in the sense of (M2). Depending on the situation, this can be quite reasonable, for the following arguments (apart from the usual “if the data say so”). Firstly, it is well known (see e.g., Bartoszynski [33], Ludwig [34], Becker [35,36], Metz [37], Heyde [38], von Bahr & Martin-Löf [39], Ball [40], Jacob [41], Barbour & Reinert [42], Section 1.2 of Britton & Pardoux [43]) that in populations with a relatively high number of susceptible individuals and a relatively low number of infectious individuals (e.g., in a large population and in decisive emerging/early phases of the disease spreading), the incidence-evolution n↦Xn can be well approximated by a (e.g., Poissonian) Galton-Watson process with possible immigration where n plays the role of a generation number. If the above-mentioned generation interval is “nearly” deterministic (leading to nearly synchronous, non-overlapping generations)—which is the case e.g., for (phases of) Influenza A(H1N1)pdm09, Influenza A(H3N2), Rubella (cf. Vink, Bootsma & Wallinga [98]), and COVID-19 (cf. Ferretti et al. [101])—and the length of the generation interval is approximated by its mean length and the latter is tuned to be equal to the unit time between consecutive observations, then n plays the role of an observation (surveillance) time. This effect is even more realistic if the period of infectiousness is nearly deterministic and relatively short. Secondly, as already mentioned above, the spreading of an infectious disease is intrinsically a (not necessarily Poissonian Galton-Watson) branching mechanism, which may be blurred by other effects in a way that a Poissonian autoregressive Generalized Linear Model is still a reasonably fitting model for the observational process in disease surveillance. The latter have been used e.g., by Finkenstädt, Bjornstad & Grenfell [73], Held, Höhle & Hofmann [47], and Held et al. [72]; they all use non-constant parameters (e.g., to describe seasonal effects, which are however unknown in early phases of a novel infectious disease such as COVID-19). In contrast, we employ different new–namely divergence-based–statistical techniques, for which we assume constant parameters but also indicate procedures for the detection of changes; the extension to non-constant parameters is straightforward.

Returning to Galton-Watson processes, let us mention as a side remark that they can be also used to model the above-mentioned within-host replication dynamics (D2) (e.g., in the time-interval [tkE,tkI[ and beyond) on a sub-cellular level, see e.g., Spouge [106], as well as Taneyhill, Dunn & Hatcher [107] for parasitic pathogens; on the other hand, one can also employ Galton-Watson processes for quantifying snowball-effect (avalanche-effect, cascade-effect) type, economic-crisis triggered consequences of large epidemics and pandemics, such as e.g., the potential spread of transmissible (i) foreclosures of homes (cf. Parnes [108]), or clearly also (ii) company insolvencies, downsizings and credit-risk downgradings; moreover, the time-evolution of integer-valued indicators concerning the spread of (rational or unwarranted) fears resp. perceived threats may be modelled, too.

Summing up things, we model the evolution n↦Xn of the number of incidences at stage n by a Poissonian Galton Watson process with immigration GWI

X0∈N;N0∋Xn=∑k=1Xn−1Yn−1,k+Y˜n,n∈N,cf.(1),(GWI1)−(GWI3)withlawP•,

(where Yn−1,k corresponds to the Yk of (D3), equipped with an additional stage-index n−1), respectively by a corresponding “distributionally equal”–possibly non-stationary– Poissonian autoregressive Generalized Linear Model in the sense of (M2); depending on the situation, we may also fix a (deterministic or random) upper time horizon other than infinity. Recall that both models are overdispersed, which is consistent with the current debate on overdispersion in connection with the current COVID-19 pandemic. In infectious-disease language, the sum ∑k=1Xn−1Yn−1,k can also be loosely interpreted as epidemic component (in a narrow sense) driven by the parameter β•, and Y˜n as endemic component driven by the parameter α•. In fact, the offspring mean (here, β•) is called reproduction number and plays a major role–also e.g., in the current public debate about the COVID-19 pandemic–because it crucially determines the rapidity of the spread of the disease and—as already indicated above in the second and third paragraph after (PS3)–also the probability that the epidemic/pandemic becomes (maybe temporally) extinct or at least stationary at a low level (that is, endemic). For this to happen, β• should be subcritical, i.e., β•<1, and even better, close to zero. Of course, the size of the importation mean α•≥0 matters, too, in a secondary order.

Keeping this in mind, let us discuss on which factors the reproduction number β• and the importation mean α• depend upon, and how they can be influenced/controlled. To begin with, by recalling the above-mentioned points (D1) to (D5) and by adapting the considerations of e.g., Grassly & Fraser [81] to our model, one encounters the fact that the distribution of the offspring Yn−1,k—here driven by the reproduction number (offspring mean) β•—depends on the following factors:

  • (B1)
    the degree of infectiousness of the individual k, with three major components:
    • (B1a)
      degree of biological infectiousness; this reflects the within-host dynamics (D2) of the “representative” individual k, in particular the duration and amount of the corresponding replication and shedding/excretion of the infectious pathogens; this degree depends thus on (i) the number of host-invading pathogens (called the initial infectious dose), (ii) the type of the pathogen with respect to e.g., its principal capabilities of replication speed, range of spread and drug-sensitivity, (iii) features of the immune system of the host k including the level of innate or acquired immunity, and (iv) the interaction between the genetic determinants of disease progression in both the pathogen and the host;
    • (B1b)
      degree of behavioural infectiousness; this depends on the contact patterns of an infected/infectious individual (and, if relevant, the contact patterns of intermediate hosts or vectors), in relation to the disease-specific type of route(s) of transmission of the infectious pathogens (for an overview of the latter, see e.g., Table 3 of Kaslow & Evans [79]); a long-distance-travel behaviour may also lead to the disease exportation to another, outside population (and thus, for the latter to a disease importation);
    • (B1c)
      degree of environmental infectiousness; this depends on the location and environment of the host k, which influences the duration of outside-host survival of the pathogens (and, if relevant, of the intermediate hosts or vectors) as well as the speed and range of their outside-host spread; for instance, high temperature may kill the pathogens, high airflow or rainfall dynamics may ease their spread, etc.
  • (B2)
    the degree of susceptibility of uninfected individuals who have contact with k, with the following three major components (with similar background as their infectiousness counterparts):
    • (B2a)
      degree of biological susceptibility;
    • (B2b)
      degree of behavioural susceptibility;
    • (B2c)
      degree of environmental susceptibility.

All these factors (B1a) to (B2c) can be principally influenced/controlled to a certain–respective–extent. Let us briefly discuss this for human infectious diseases, where one major goal of epidemic risk management is to operate countermeasures/interventions in order to slow down the disease transmission (e.g., by reducing the reproduction number β• to less than 1) and eventually even break the chain of transmission, for the sake of containment or mitigation; preparedness and preparation are motives, too, for instance as a part of governmental pandemic risk management.

For instance, (B1a) can be reduced or even erased through pharmaceutical interventions such as medication (if available), and preventive strengthening of the immune system through non-extreme sports activities and healthy food.

Moreover, the following exemplary control measures for (B2) can be either put into action by common-sense self-behaviour, or by large-scale public recommendations (e.g., through mass media), or by rules/requirements from authorities:

  • (i)

    personal preventive measures such as frequent washing and disinfecting of hands; keeping hands away from face; covering coughs; avoidance of handshakes and hugs with non-family-members; maintaining physical distance (e.g., of two meters) from non-family-members; wearing a face-mask of respective security degree (such as homemade cloth face mask, particulate-filtering face-piece respirator, medical (non-surgical) mask, surgical mask); self-quarantine;

  • (ii)

    environmental measures, such as e.g., cleaning of surfaces;

  • (iii)

    community measures aimed at mild or stringent social distancing, such as e.g., prohibiting/cancelling/banning gatherings of more than z non-family members (e.g., z=2,5,10,100,1000 in various different phases and countries during the current COVID-19 pandemic); mask-wearing (see above); closing of schools, universities, some or even all nonessential (“system-irrelevant”) businesses and venues; home-officing/work ban; home isolation of disease cases; isolation of homes for the elderly/aged (nursing homes); stay-at-home orders with exemptions, household or even general quarantine; testing & tracing; lockdown of entire cities and beyond; restricting the degrees of travel freedom/allowed mobility (e.g., local, union-state, national, international including border and airport closure). The latter also affects the mean importation rate α•, which can be controlled by vaccination programs in “outside populations”, too.

As far as the degree of biological susceptibility (B2a) is concerned, one obvious therapeutic countermeasure is a mass vaccination program/campaign (if available).

In case of highly virulent infectious diseases causing epidemics and pandemics with substantial fatality rates, some of the above-mentioned control strategies and countermeasures may (have to) be “drastic” (e.g., lockdown), and thus imply considerable social and economic costs, with a huge impact and potential danger of triggering severe social, economic and political disruptions.

In order to prepare corresponding suggestions for decisions about appropriate control measures (e.g., public policies), it is therefore important–especially for a novel infectious disease such as the current COVID-19 pandemic–to have a model for the time-evolution of the incidences in (i) a natural (basically uncontrolled) set-up, as well as in (ii) the control set-ups under consideration. As already mentioned above, we assume that all these situations can be distilled into an incidence evolution n↦Xn which follows a Poissonian Galton-Watson process with respectively different parameter pairs (β•,α•). Correspondingly, we always compare two alternative models (H) and (A) with parameter pairs (βH,αH) and (βA,αA) which reflect either a “pure” statistical uncertainty (under the same uncontrolled or controlled set-up), or the uncertainty between two different potential control set-ups (for the sake of assessing the potential impact/efficiency of some planned interventions, compared with alternative ones); the economic impact can be also taken into account, within a Bayesian decision framework discussed in Section 2.5 below. As will be explained in the next subsections, we achieve such comparisons by means of density-based dissimilarity distances/divergences and related quantities thereof.

From the above-mentioned detailed explanations, it is immediately clear that for the described epidemiological context one should investigate all types of criticality and importation means for the therein involved two Poissonian Galton-Watson processes with/without immigration (respectively the equally distributed INARCH(1) models); in particular, this motivates (or even “justifies”) the necessity of the very lengthy detailed studies in the Section 3, Section 4, Section 5, Section 6 and Section 7 below.

2.4. Information Measures

Having two competing models (H) and (A) at stake, it makes sense to study questions such as “how far are they apart?” and thus “how dissimilar are they?”. This can be quantified in terms of divergences in the sense of directed (i.e., not necessarily symmetric) distances, where usually the triangular inequality fails. Let us first discuss our employed divergence subclasses in a general set-up of two equivalent probability measures PH, PA on a measurable space Ω,F. In terms of the parameter λ∈R, the power divergences—also known as Cressie-Read divergences, relative Tsallis entropies, or generalized cross-entropy family– are defined as (see e.g., Liese & Vajda [1,10])

0≤IλPA∥PH:=IPA∥PH,ifλ=1,1λ(λ−1)HλPA∥PH−1,ifλ∈R\{0,1},IPH∥PA,ifλ=0, (2)

where

IPA∥PH:=∫pAlogpApHdμ≥0 (3)

is the Kullback-Leibler information divergence (also known as relative entropy) and

HλPA∥PH:=∫ΩpAλpH1−λdμ≥0 (4)

is the Hellinger integral of order λ∈R\{0,1}; for this, we assume as usual without loss of generality that the probability measures PH, PA are dominated by some σ–finite measure μ, with densities

pA=dPAdμandpH=dPHdμ (5)

defined on Ω (the zeros of pH, pA are handled in (3) and (4) with the usual conventions). Clearly, for λ∈{0,1} one trivially gets

H0PA∥PH=H1PA∥PH=1.

The Kullback-Leibler information divergences (relative entropies) in (2) and (3) can alternatively be expressed as (see, e.g., Liese & Vajda [1])

IPA∥PH=limλ↗11−HλPA∥PHλ(1−λ),IPH∥PA=limλ↘01−HλPA∥PHλ(1−λ). (6)

Apart from the Kullback-Leibler information divergence (relative entropy), other prominent examples of power divergences are the squared Hellinger distance 12I1/2PA∥PH and Pearson’s χ2–divergence 2I2PA∥PH; the Hellinger integral H1/2PA∥PH is also known as (multiple of) the Bhattacharyya coefficent. Extensive studies about basic and advanced general facts on power divergences, Hellinger integrals and the related Renyi divergences of order λ∈R\{0,1}

0≤RλPA∥PH:=1λ(λ−1)logHλPA∥PH,withlog0=−∞, (7)

can be found e.g., in Liese & Vajda [1,10], Jacod & Shiryaev [24], van Erven & Harremoes [20] (as a side remark, R1/2PA∥PH is also known as (multiple of) Bhattacharyya distance). For instance, the integrals in (3) and (4) do not depend on the choice of μ. Furthermore, one has the skew symmetries

HλPA∥PH=H1−λPH∥PA,aswellasIλPA∥PH=I1−λPH∥PA, (8)

for all λ∈R (see e.g., Liese & Vajda [1]). As far as finiteness is concerned, for λ∈]0,1[ one gets the rudimentary bounds

0<HλPA∥PH≤1,andequivalently, (9)
0≤IλPA∥PH=1−HλPA∥PHλ(1−λ)<1λ(1−λ), (10)

where the lower bound in (10) (upper bound in (9)) is achieved iff PA=PH. For λ∈R\]0,1[, one gets the bounds

0≤IλPA∥PH≤∞,andequivalently,1≤HλPA∥PH≤∞, (11)

where, in contrast to above, both the lower bound of HλPA∥PH and the lower bound of IλPA∥PH is achieved iff PA=PH; however, the power divergence IλPA∥PH and Hellinger integral HλPA∥PH might be infinite, depending on the particular setup.

The Hellinger integrals can be also used for bounds of the well-known total variation

0≤V(PA∥PH):=2supA∈FPA(A)−PH(A)=∫ΩpA−pHdμ,

with pA and pH defined in (5). Certainly, the total variation is one of the best known statistical distances, see e.g., Le Cam [109]. For arbitrary λ∈]0,1[ there holds (cf. Liese & Vajda [1])

1−V(PA∥PH)2≤Hλ(PA∥PH)≤1+V(PA∥PH)2max{λ,1−λ}1−V(PA∥PH)2min{λ,1−λ}.

From this together with the particular choice λ=12, we can derive the fundamental universal bounds

21−H12(PA∥PH)≤V(PA∥PH)≤21−H12(PA∥PH)2. (12)

We apply these concepts to our setup of Section 2.1 with two competing models (H) and (A) of Galton-Watson processes with immigration, where one can take Ω⊂N0N0 to be the space of all paths of (Xn)n∈N. More detailed, in terms of the extinction set B:={τ<∞} and the parameter-set notation (PS1) to (PS3), it is known that for PSP the two laws PH and PA are equivalent, whereas for PNI the two restrictions PHB and PAB are equivalent (see e.g., Lemma 1.1.3 of Guttorp [52]); with a slight abuse of notation we shall henceforth omit B. Consistently, for fixed time n∈N0 we introduce PA,n:=PAFn and PH,n:=PHFn as well as the corresponding Radon-Nikodym-derivative (likelihood ratio)

Zn:=dPA,ndPH,n, (13)

where (Fn)n∈N denotes the corresponding canonical filtration generated by X:=(Xn)n∈N; in other words, Fn reflects the “process-intrinsic” information known at stage n. Clearly, Z0=1. By choosing the reference measure μ=PH,n one obtains from (4) the Hellinger integral HλPA,0∥PH,0=1, as well as and for all n∈N

HλPA,n∥PH,n=EPH,n(Zn)λ, (14)
IPA,n∥PH,n=EPA,nlogZn, (15)

from which one can immediately build IλPA,n∥PH,n (λ∈R) respectively RλPA,n∥PH,n (λ∈R\{0,1}) respectively bounds of VPA,n∥PH,n via (2) respectively (7) respectively (12).

The outcoming values (respectively bounds) of HλPA,n∥PH,n are quite diverse and depend on the choice of the involved parameter pairs (βH,αH), (βA,αA) as well as λ; the exact details will be given in the Section 3 and Section 6 below.

Before we achieve this, in the following we explain how the outcoming dissimilarity results can be applied to Bayesian testing and more general Bayesian decision making, as well as to Neyman-Pearson testing.

2.5. Decision Making under Uncertainty

Within the above-mentioned context of two competing models (H) and (A) of Galton-Watson processes with immigration, let us briefly discuss how knowledge about the time-evolution of the Hellinger integrals HλPA,n∥PH,n–or equivalently, of the power divergences IλPA,n∥PH,n, cf. (2)—can be used in order to take decisions under uncertainty, within a framework of Bayesian decision making BDM, or alternatively, of Neyman-Pearson testing NPT.

In our context of BDM, we decide between an action dH “associated with” the (say) hypothesis law PH and an action dA “associated with” the (say) alternative law PA, based on the sample path observation Xn:={Xl:l∈{0,1,…,n}} of the GWI-generation-sizes (e.g., infectious-disease incidences, cf. Section 2.3) up to observation horizon n∈N. Following the lines of Stummer & Vajda [15] (adapted to our branching process context), for our BDM let us consider as admissible decision rules δn:Ωn↦{dH,dA} the ones generated by all path sets Gn∈Ωn (where Ωn denotes the space of all possible paths of (Xk)k∈{1,…,n}) through

δn(Xn):=δGn(Xn):=dA,ifXn∈Gn,dH,ifXn∉Gn,

as well as loss functions of the form

L(dH,H)L(dH,A)L(dA,H)L(dA,A):=0LALH0 (16)

with pregiven constants LA>0, LH>0 (e.g., arising as bounds from quantities in worst-case scenarios); notice that in (16), dH is assumed to be a zero-loss action under H and dA a zero-loss action under A. Per definition, the Bayes decision rule δGn,min minimizes–over Gn—the mean decision loss

L(δGn):=pHprior·LH·PrδGn(Xn)=dA|H+pAprior·LA·PrδGn(Xn)=dH|A=pHprior·LH·PH,n(Gn)+pAprior·LA·PA,n(Ωn−Gn) (17)

for given prior probabilities pHprior=Pr(H)∈]0,1[ for H and pAprior:=Pr(A)=1−pHprior for A. As a side remark let us mention that, in a certain sense, the involved model (parameter) uncertainty expressed by the “superordinate” Bernoulli-type law Pr=Bin(1,pHprior) can also be reinterpreted as a rudimentary static random environment caused e.g., by a random Bernoulli-type external static force. By straightforward calculations, one gets with (13) the minimizing path set Gn,min=Zn≥pHpriorLHpApriorLA leading to the minimal mean decision loss, i.e., the Bayes risk,

Rn:=minGnL(δGn)=L(δGn,min)=∫ΩnminpHpriorLH,pApriorLAZndPH,n. (18)

Notice that—by straightforward standard arguments—the alternative decision procedure

takeactiondA(resp.dH)ifLH·pHpost(Xn)≤(resp.>)LA·pApost(Xn)

with posterior probabilities pHpost(Xn):=pHprior(1−pHprior)·Zn(Xn)+pHprior=:1−pApost(Xn), leads exactly to the same actions as δGn,min. By adapting the Lemma 6.5 of Stummer & Vajda [15]—which on general probability spaces gives fundamental universal inequalities relating Hellinger integrals (or equivalently, power divergences) and Bayes risks—one gets for all LH>0, LA>0, pHprior∈]0,1[, λ∈]0,1[ and n∈N the upper bound

Rn≤ΛAλΛH1−λHλPA,n∥PH,n,withΛH:=pHpriorLH,ΛA:=(1−pHprior)LA, (19)

as well as the lower bound

Rnmin{λ,1−λ}·ΛH+ΛA−Rnmax{λ,1−λ}≥ΛAλΛH1−λHλPA,n∥PH,n

which implies in particular the “direct” lower bound

Rn≥ΛAmax{1,λ1−λ}ΛHmax{1,1−λλ}ΛA+ΛHmax{λ1−λ,1−λλ}·HλPA,n∥PH,nmax{1λ,11−λ}. (20)

By using (19) (respectively (20)) together with the exact values and the upper (respectively lower) bounds of the Hellinger integrals HλPA,n∥PH,n derived in the following sections, we end up with upper (respectively lower) bounds of the Bayes risk Rn. Of course, with the help of (2) the bounds (19) and (20) can be (i) immediately rewritten in terms of the power divergences IλPA,n∥PH,n and (ii) thus be directly interpreted in terms of dissimilarity-size arguments. As a side-remark, in such a Bayesian context the λ–order Hellinger integral HλPA,n∥PH,n=EPH,n(Zn)λ (cf. (14)) can be also interpreted as λ–order Bayes-factor moment (with respect to PH,n), since Zn=Zn(Xn)=pApost(Xn)pHpost(Xn)/pApriorpHprior is the Bayes factor (i.e., the posterior odds ratio of (A) to (H), divided by the prior odds ratio of (A) to (H)).

At this point, the potential applicant should be warned about the usual way of asynchronous decision making, where one first tests (A) versus (H) (i.e., LA=LH=1 which leads to 0–1 losses in (16)) and afterwards, based on the outcoming result (e.g., in favour of (A)), takes the attached economic decision (e.g., dA); this can lead to distortions compared with synchronous decision making with “full” monetary losses LA and LH, as is shown in Stummer & Lao [16] within an economic context in connection with discrete approximations of financial diffusion processes (they call this distortion effect a non-commutativity between Bayesian statistical and investment decisions).

For different types of–mainly parameter estimation (squared-error type loss function) concerning—Bayesian analyses based on GW(I) generation size observations, see e.g., Jagers [56], Heyde [38], Heyde & Johnstone [110], Johnson et al. [111], Basawa & Rao [60], Basawa & Scott [61], Scott [112], Guttorp [52], Yanev & Tsokos [113], Mendoza & Gutierrez-Pena [114], and the references therein.

Within our running-example epidemiological context of Section 2.3, let us briefly discuss the role of the above-mentioned losses LA and LH. To begin with, as mentioned above the unit-free choice LA=LH=1 corresponds to Bayesian testing. Recall that this concerns with two alternative infectious-disease models (H) and (A) with parameter pairs (recall the interpretation of β• as reproduction number and α• as importation mean) (βH,αH) and (βA,αA) which reflect either a “pure” statistical uncertainty (under the same uncontrolled or controlled set-up), or the uncertainty between two different potential control set-ups (for the sake of assessing the potential impact/efficiency of some planned interventions, compared with alternative ones). As far as non-unit-free–e.g., macroeconomic or monetary–losses is concerned, recall that some of the above-mentioned control strategies (countermeasures, public policies, governmental pandemic risk management plans) may imply considerable social and economic costs, with a huge impact and potential danger of triggering severe social, economic and political disruptions; a corresponding tradeoff between health and economic issues can be incorporated by choosing LA and LH to be (e.g., monetary) values which reflect estimates or upper bounds of losses due to wrong decisions, e.g., if at stage n due to the observed data one erroneously thinks (reinforced by fear) that a novel infectious disease (e.g., COVID-19) will lead (or re-emerge) to a severe pandemic and consequently decides for a lockdown with drastic future economic consequences, versus, if one erroneously thinks (reinforced by carelessness) that the infectious disease is (or stays) non-severe and consequently eases some/all control measures which will lead to extremely devastating future economic consequences. For the estimates/bounds of LA and LH, one can e.g., employ (i) the comprehensive stochastic studies of Feicht & Stummer [115] on the quantitative degree of elasticity and speed of recovery of economies after a sudden macroeconomic disaster, or (ii) the more short-term, German-specific, scenario-type (basically non-stochastic) studies of Dorn et al. [116,117] in connection with the current COVID-19 pandemic.

Of course, the above-mentioned Bayesian decision procedure can be also operated in sequential way. For instance, suppose that we are encountered with a novel infectious disease (e.g., COVID-19) of non-negligible fatality rate and let (A) reflect a “potentially dangerous” infectious-disease-transmission situation (e.g., a reproduction number of substantially supercritical case βA=2, and an importation mean of αA=10, for weekly appearing new incidence-generations) whereas (H) describes a “relatively harmless/mild” situation (e.g., a substantially subcritical βH=0.5, αH=0.2). Moreover, let dA respectively dH denote (non-quantitatively) the decision/action to accept (A) respectively (H). It can then be reasonable to decide to stop the observation process n↦Xn (also called surveillance or online-monitoring) of incidence numbers at the first time at which n↦Zn=Zn(Xn) exceeds the threshold pHprior/pAprior; if this happens, one takes dA as decision (and e.g., declare the situation as occurrence of an epidemic outbreak and start with control/intervention measures (however, as explained above, one should synchronously involve also the potential economic losses)) whereas as long as this does not happen, one continues the observation (and implicitly takes dH as decision). This can be modelled in terms of the pair (τ˜,dA) with (random) stopping time τ˜:=infn∈N:Zn≥pHpriorpAprior (with the usual convention that the infimum of the empty set is infinity), and the corresponding decision dA. After the time τ˜<∞ and e.g., immediate subsequent employment of some control/counter measures, one can e.g., take the old model (A) as new (H), declare a new target (A) for the desired quantification of the effectiveness of the employed control measures (e.g., a mitigation to a slightly subcritical case of βA=0.95, αH=0.8), and starts to observe the new incidence numbers until the new target (A) has been reached. This can be interpreted as online-detection of a distributional change; a related comprehensive new framework for the use of divergences (even much beyond power divergences) for distributional change detection can be found e.g., in the recent work of Kißlinger & Stummer [118]. A completely different, SIR-model based, approach for the detection of change points in the spread of COVID-19 is given in Dehning et al. [119]. Moreover, other different surveillance methods can be also found e.g., in the corresponding overview of Frisen [120] and the Swedish epidemics outbreak investigations of Friesen & Andersson & Schiöler [121].

One can refine the above-mentioned sequential procedure via two (instead of one) appropriate thresholds c1<c2 and the pair (τ˘,δτ˘), with the stopping time τ˘:=infn∈N:Zn∉[c1,c2] as well as corresponding decision rule

δτ˘:=dA,ifZτ˘>c2,dH,ifZτ˘<c1.

An exact optimized treatment on the two above-mentioned sequential procedures, and their connection to Hellinger integrals (and power divergences) of Galton-Watson processes with immigration, is beyond the scope of this paper.

As a side remark, let us mention that our above-mentioned suggested method of Bayesian decision making with Hellinger integrals of GWIs differs completely from the very recent work of Brauner et al. [122] who use a Bayesian hierarchical model for the concrete, very comprehensive study on the effectiveness and burden of non-pharmaceutical interventions against COVID-19 transmission.

The power divergences IλPA,n∥PH,n (λ∈R) can be employed also in other ways within Bayesian decision making, of statistical nature. Namely, by adapting the general lines of Österreicher & Vajda [123] (see also Liese & Vajda [10], as well as diffusion-process applications in Stummer [5,31,32]) to our context of Galton-Watson processes with immigration, we can proceed as follows. For the sake of comfortable notations, we first attach the value θ:=1 to the GWI model (A) (which has prior probability pAprior∈]0,1[) and θ:=0 to (H) (which has prior probability 1−pAprior). Suppose we want to decide, in an optimal Bayesian way, which degree of evidence deg∈[0,1] we should attribute (according to a pregiven loss function LO) to the model (A). In order to achieve this goal, we choose a nonnegatively-valued loss function LO(θ,deg) defined on {0,1}×[0,1], of two types which will be specified below. The risk at stage 0 (i.e., prior to the GWI-path observations Xn), from the optimal decision about the degree of evidence deg concerning the decision parameter θ, is defined as

BRLOpAprior:=mindeg∈[0,1]{(1−pAprior)·LO(0,deg)+pAprior·LO(1,deg)},

which can be thus interpreted as a minimal prior expected loss (the minimum will always exist). The corresponding risk posterior to the GWI-path observations Xn, from the optimal decision about the degree of evidence deg concerning the parameter θ, is given by

BRLOpostpAprior:=∫ΩnBRLOpApost(Xn)(pApriordPA,n+(1−pAprior)dPH,n),

which is achieved by the optimal decision rule (about the degree of evidence)

D*Xn:=argmindeg∈[0,1]{1−pApost(Xn)·LO(0,deg)+pApost(Xn)·LO(1,deg)}.

The corresponding statistical information measure (in the sense of De Groot [124])

ΔBRLOpAprior:=BRLOpAprior−BRLOpostpAprior≥0

represents the reduction of the decision risk about the degree of evidence deg concerning the parameter θ, that can be attained by observing the GWI-path Xn until stage n. For the first-type loss function LO˜(θ,deg):=deg−(2deg−1)·1{1}(θ), defined on {0,1}×[0,1] with the help of the indicator function 1A(.) on the set A, one can show that

D*Xn:=0,ifpApost(Xn)∈[0,12[,1,ifpApost(Xn)∈]12,1[,anynumberin[0,1],ifpApost(Xn)=12,

as well as the representation formula

IλPA,n∥PH,n=∫01ΔBRLO˜pAprior·1−pApriorλ−2·pAprior−1−λdpAprior,λ∈R, (21)

(cf. Österreicher & Vajda [123], Liese & Vajda [10], adapted to our GWI context); in other words, the power divergence IλPA,n∥PH,n can be regarded as a weighted-average statistical information measure (weighted-average decision risk reduction). One can also use other weights of pAprior in order to get bounds of IλPA,n∥PH,n (analogously to Stummer [5]).

For the second-type loss function LOλ,χ(θ,deg):=λθ−1degλ−θχλ(1−χ)1−λ(1−λ)θ(1−deg)λ−θ defined on {0,1}×[0,1] with parameters λ∈]0,1[ and χ∈]0,1[, one can derive the optimal decision rule

D*Xn=pApost(Xn)

as well as the representation formula as a limit statistical information measure (limit decision risk reduction)

IλPA,n∥PH,n=limχ→pApriorΔBRLOλ,χpAprior=:ΔBRLOλ,pApriorpAprior (22)

(cf. Österreicher & Vajda [123], Stummer [5], adapted to our GWI context).

As an alternative to the above-mentioned Bayesian-decision-making applications of Hellinger integrals HλPA,n∥PH,n, let us now briefly discuss the use of the latter for the corresponding Neyman-Pearson (NPT) framework with randomized tests Tn:Ωn↦[0,1] of the hypothesis PH against the alternative PA, based on the GWI-generation-size sample path observations Xn:={Xl:l∈{0,1,…,n}}. In contrast to (17) and (18) a Neyman-Pearson test minimizes—over Tn–the type II error probability ∫Ωn(1−Tn)dPA,n in the class of the tests for which the type I error probability ∫ΩnTndPH,n is at most ς∈]0,1[. The corresponding minimal type II error probability

EςPA,i∥PH,i:=infTi:∫ΩiTidPH,i≤ς∫Ωi(1−Ti)dPA,i

can for all ς∈]0,1[, λ∈]0,1[, i∈I be bounded from above by

EςPA,i∥PH,i≤EςUPA,i∥PH,i:=min(1−λ)·λςλ/(1−λ)·HλPA,i∥PH,i1/(1−λ),1, (23)

and for all λ>1, i∈I it can be bounded from below by

EςPA,i∥PH,i≥EςLPA,i∥PH,i:=(1−ς)λ/(λ−1)·HλPA,i∥PH,i1/(1−λ), (24)

which is an adaption of a general result of Krafft & Plachky [125], see also Liese & Vajda [1] as well as Stummer & Vajda [15]. Hence, by combining (23) and (24) with the exact values respectively upper bounds of the Hellinger integrals H1−λPA,n∥PH,n from the following sections, we obtain for our context of Galton-Watson processes with Poisson offspring and Poisson immigration (including the non-immigration case) some upper bounds of EςPA,n∥PH,n, which can also be immediately rewritten as lower bounds for the power 1−EςPA,n∥PH,n of a most powerful test at level ς. In contrast to such finite-time-horizon results, for the (to our context) incompatible setup of Galton-Watson processes with Poisson offspring but nonstochastic immigration of constant value 1, the asymptotic rates of decrease as n→∞ of the unconstrained type II error probabilities as well as the type I error probabilites were studied in Linkov & Lunyova [53] by a different approach employing also Hellinger integrals. Some other types of Galton-Watson-process concerning Neyman-Pearson testing investigations different to ours can be found e.g., in Basawa & Scott [126], Feigin [127], Sweeting [128], Basawa & Scott [61], and the references therein.

2.6. Asymptotical Distinguishability

The next two concepts deal with two general families PA,ii∈I and PH,ii∈I of probability measures on the measurable spaces Ωi,Fii∈I, where the index set I is either N0 or R+. For them, the following two general types of asymptotical distinguishability are well known (see e.g., LeCam [109], Liese & Vajda [1], Jacod & Shiryaev [24], Linkov [129], and the references therein).

Definition 1.

The family (PA,i)i∈I is contiguous to the family (PH,i)i∈I – in symbols, (PA,i)◃(PH,i)– if for all sets Ai∈Fi with limi→∞PH,i(Ai)=0 there holds limi→∞PA,i(Ai)=0.

Definition 2.

Families of measures (PA,i)i∈I and (PH,i)i∈I are called entirely separated (completely asymptotically distinguishable)—in symbols, (PA,i)△(PH,i)–if there exist a sequence im↑∞ as m↑∞ and for each m∈N0 an Aim∈Fim such that limm→∞PA,im(Aim)=1 and limm→∞PH,im(Aim)=0.

It is clear that the notion of contiguity is the attempt to carry the concept of absolute continuity over to families of measures. Loosely speaking, (PA,i) is contiguous to (PH,i), if the limit limi→∞(PA,i) (existence preconditioned) is absolute continuous to the limit limi→∞(PH,i). However, for the definition of contiguity, we do not need to require the probability measures to converge to limiting probability measures. On the other hand, entire separation is the generalization of singularity to families of measures.

The corresponding negations will be denoted by ◃¯ and △¯. One can easily check that a family (PA,i) cannot be both contiguous and entirely separated to a family (PH,i). In fact, as shown in Linkov [129], the relation between the families (PA,i) and (PH,i) can be uniquely classified into the following distinguishability types:

  • (a)

    (PA,i)◃▹(PH,i);

  • (b)

    (PA,i)◃(PH,i), (PH,i)◃¯(PA,i);

  • (c)

    (PA,i)◃¯(PH,i), (PH,i)◃(PA,i);

  • (d)

    (PA,i)◃¯▹¯(PH,i), (PA,i)△¯(PH,i);

  • (e)

    (PA,i)△(PH,i).

As demonstrated in the above-mentioned references for a general context, one can conclude the type of distinguishability from the time-evolution of Hellinger integrals. Indeed, the following assertions can be found e.g., in Linkov [129], where part (c) was established in Liese & Vajda [1] and (f), (g) in Vajda [3].

Proposition 1.

The following assertions are equivalent:

(a)(PA,i)△(PH,i),(b)lim infi→∞Hλ(PA,i∥PH,i)=0forallλ∈]0,1[,(c)thereexistsaλ∈]0,1[:lim infi→∞Hλ(PA,i∥PH,i)=0,(d)thereexistsaπ∈]0,1[:lim infi→∞eπ(PA,i∥PH,i)=0,(e)lim supi→∞V(PA,i∥PH,i)=2,(f)thereexistsaλ∈]0,1[:lim supi→∞Iλ(PA,i∥PH,i)=1λ·(1−λ),(g)lim supi→∞Iλ(PA,i∥PH,i)=1λ·(1−λ),forallλ∈]0,1[. (25)

In combination with the discussion after Definition 2, one can thus interpret the λ–order Hellinger integral Hλ(PA,i∥PH,i) as a “measure” for the distinctness of the two families PA,i and PH,i up to a fixed finite time horizon i∈I.

Furthermore, for the contiguity we obtain the equivalence (see e.g., Liese & Vajda [1], Linkov [129])

(PA,i)◃(PH,i)⟺lim infλ↗1lim infi→∞HλPA,i∥PH,i=1⟺lim supλ↗1lim supi→∞λ·(1−λ)·IλPA,i∥PH,i=0. (26)

All the above-mentioned general results can be applied to our context of two competing Poissonian Galton-Watson processes with immigration (GWI) (H) and (A) (reflected by the two different laws PH resp. PA with parameter pairs (βH,αH) resp. (βA,αA)), by taking PA,i:=PAFi and PH,i:=PHFi. Recall from the preceding subsections (by identifying i with n) that the latter two describe the stochastic dynamics of the respective GWI within the restricted time-/stage-frame {0,1,…,i}.

In the following, we study in detail the evolution of Hellinger integrals between two competing models of Galton-Watson processes with immigration, which turns out to be quite extensive.

3. Detailed Recursive Analyses of Hellinger Integrals

3.1. A First Basic Result

In terms of our notations (PS1) to (PS3), a typical situation for applications in our mind is that one particular constellation βA,βH,αA,αH∈P (e.g., obtained from theoretical or previous statistical investigations) is fixed, whereas–in contrast–the parameter λ∈R\{0,1} for the Hellinger integral or the power divergence might be chosen freely, e.g., depending on which (transform of a) dissimilarity measure one decides to choose for further analysis. At this point, let us emphasize that in general we will not make assumptions of the form β•⪌1, i.e., upon the type of criticality.

To start with our investigations, in order to justify for all n∈N0

Zn:=dPA,ndPH,n(cf.(13)),

(14) and (15) (as well as IλPA,n∥PH,n for λ∈R respectively RλPA,n∥PH,n for λ∈R\{0,1}), we first mention the following straightforward facts: (i) if βA,βH,αA,αH∈PNI, then PA,n and PH,n are equivalent (i.e., PA,n∼PH,n), as well as (ii) if βA,βH,αA,αH∈PSP, then PA,n and PH,n are equivalent (i.e., PA,n∼PH,n). Moreover, by recalling Z0=1 and using the “rate functions” f•(x)=β•x+α• (x∈[0,∞[), a version of (13) can be easily determined by calculating for each x→:=(x0,x1,x2,⋯)∈Ω:=N×N0×N0×⋯

Zn(x→)=∏k=1nZn,k(x→)withZn,k(x→):=exp−fA(xk−1)−fH(xk−1)fA(xk−1)fH(xk−1)xk,

where for the last term we use the convention 00x=1 for all x∈N0. Furthermore, we define for each x→∈Ω

Zn,k(λ)(x→):=exp−λfA(xk−1)+(1−λ)fH(xk−1)fA(xk−1)λfH(xk−1)1−λxkxk! (27)

with the convention 000!=1 for the last term. Accordingly, one obtains from (14) the Hellinger integral HλPA,0∥PH,0=1, as well as for all βA,βH,αA,αH,λ∈P×(R\{0,1})

HλPA,1∥PH,1=expfA(x0)λfH(x0)(1−λ)−(λfA(x0)+(1−λ)fH(x0)) (28)

for x0=X0∈N, and for all n∈N\{1}

HλPA,n∥PH,n=EPH,n(Zn)λ=∑x1=0∞⋯∑xn=0∞∏k=1nZn,k(λ)(x→)=∑x1=0∞⋯∑xn−1=0∞∏k=1n−1Zn,k(λ)(x→)·e−(λfA(xn−1)+(1−λ)fH(xn−1))∑xn=0∞fA(xn−1)λfH(xn−1)1−λxnxn!=∑x1=0∞⋯∑xn−1=0∞∏k=1n−1Zn,k(λ)(x→)·exp{fA(xn−1)λfH(xn−1)1−λ−(λfA(xn−1)+(1−λ)fH(xn−1))}. (29)

From (29), one can see that a crucial role for the exact calculation (respectively the derivation of bounds) of the Hellinger integral is played by the functions defined for x∈[0,∞[

ϕλ(x):=ϕ(x,βA,βH,αA,αH,λ):=φλ(x)−fλ(x),with (30)
φλ(x):=φ(x,βA,βH,αA,αH,λ):=fA(x)λfH(x)1−λand (31)
fλ(x):=f(x,βA,βH,αA,αH,λ):=λfA(x)+(1−λ)fH(x)=αλ+βλx, (32)

where we have used the λ-weighted-averages

αλ:=α(αA,αH,λ):=λ·αA+(1−λ)·αHandβλ:=β(βA,βH,λ):=λ·βA+(1−λ)·βH.

Since λ plays a special role, henceforth we typically use it as index and often omit βA,βH,αA,αH. According to Lemma A1 in the Appendix A.1, it follows that for λ∈]0,1[ (respectively λ∈R\[0,1]) one gets ϕλ(x)≤0 (respectively ϕλ(x)≥0) for all x∈[0,∞[. Furthermore, in both cases there holds ϕλ(x)=0 iff fA(x)=fH(x), i.e., for x=x*:=αA−αHβH−βA≥0. This is consistent with the corresponding generally valid upper and lower bounds (cf. (9) and (11)) 0<HλPA,n∥PH,n≤1,forλ∈]0,1[,1≤HλPA,n∥PH,n≤∞,forλ∈R\[0,1].

As a first indication for our proposed method, let us start by illuminating the simplest case λ∈R\{0,1} and γ:=αHβA−αAβH=0. This means that βA,βH,αA,αH∈PNI∪PSP,1, where PSP,1 is the set of all (componentwise) strictly positive βA,βH,αA,αH with βA≠βH, αA≠αH and βAβH=αAαH≠1 (“the equal-fraction-case”). In this situation, all the three functions (30) to (32) are linear. Indeed,

φλ(x)=pλE+qλEx (33)

with pλE:=αAλαH1−λ and qλE:=βAλβH1−λ (where the index E stands for exact linearity). Clearly, qλE>0 on PNI∪PSP,1, as well as pλE>0 on PSP,1 and pλE=0 on PNI. Furthermore,

ϕλ(x)=rλE+sλEx

with rλE:=pλE−αλ=αAλαH1−λ−(λαA+(1−λ)αH) and sλE:=qλE−βλ=βAλβH1−λ−(λβA+(1−λ)βH). Due to Lemma A1 one knows that on PNI∪PSP,1 one gets sλE<0 for λ∈]0,1[ and sλE>0 for λ∈R\[0,1]. Furthermore, on PSP,1 one gets rλE<0 (resp. rλE>0) for λ∈]0,1[ (resp. λ∈R\[0,1]), whereas on PNI, the no-immigration setup, we get for all λ∈R\{0,1} rλE=0.

As it will be seen later on, such kind of linearity properties are useful for the recursive handling of the Hellinger integrals. However, only on the parameter set PNI∪PSP,1 the functions φλ and ϕλ are linear. Hence, in the general case βA,βH,αA,αH,λ∈P×R\{0,1} we aim for linear lower and upper bounds

φλL(x):=pλL+qλLx≤φλ(x)≤φλU(x):=pλU+qλUx, (34)

x∈[0,∞[ (ultimately, x∈N0), which by (30) and (31) leads to

ϕλ(x)≤ϕλU(x):=rλU+sλU·x:=(pλU−αλ)+(qλU−βλ)·x,≥ϕλL(x):=rλL+sλL·x:=(pλL−αλ)+(qλL−βλ)·x, (35)

x∈[0,∞[ (ultimately, x∈N0). Of course, the involved slopes and intercepts should satisfy reasonable restrictions. Later on, we shall impose further restrictions on the involved slopes and intercepts, in order to guarantee nice properties of the general Hellinger integral bounds given in Theorem 1 below (for instance, in consistency with the nonnegativity of φλ we could require pλU≥pλL≥0, qλU≥qλL≥0 which nontrivially implies that these bounds possess certain monotonicity properties). For the formulation of our first assertions on Hellinger integrals, we make use of the following notation:

Definition 3.

For all βA,βH,αA,αH,λ∈P×R\{0,1} and all p,q∈R let us define the sequences an(q)n∈N0 and bn(p,q)n∈N0 recursively by

a0(q):=0;an(q):=ξλ(q)an−1(q):=q·ean−1(q)−βλ,n∈N, (36)
b0(p,q):=0;bn(p,q):=p·ean−1(q)−αλ,n∈N. (37)

Notice the interrelation a1(qλA)=sλA and b1(pλA,qλA)=rλA for A∈{E,L,U}. Clearly, for all q∈R\{0} and p∈R one has the linear interrelation

bn(p,q)=pqan(q)+pqβλ−αλ,n∈N. (38)

Accordingly, we obtain fundamental Hellinger integral evaluations:

Theorem 1.

  • (a) 
    For all βA,βH,αA,αH,λ∈(PNI∪PSP,1)×R\{0,1}, all initial population sizes X0∈N and all observation horizons n∈N one can recursively compute the exact value
    Hλ(PA,n∥PH,n)=expan(qλE)X0+αAβA∑k=1nak(qλE)=:Vλ,X0,n, (39)
    where αAβA can be equivalently replaced by αHβH. Recall that qλE:=βAλβH1−λ. Notice that on PNI×(R\{0,1}) the formula (39) simplifies significantly, since αA=αH=0.
  • (b) 
    For all βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\{0,1}), all coefficients pλL,pλU,qλL,qλU∈R which satisfy (35) for all x∈N0(and thus in particular pλL≤pλU,qλL≤qλU), all initial population sizes X0∈N and all observation horizons n∈N one gets the following recursive (i.e., recursively computable) bounds for the Hellinger integrals:
    forλ∈]0,1[:Bλ,X0,nL:=B˜λ,X0,n(pλL,qλL)<Hλ(PA,n∥PH,n)≤minB˜λ,X0,n(pλU,qλU),1=:Bλ,X0,nU, (40)
    forλ∈R\[0,1]:Bλ,X0,nL:=maxB˜λ,X0,n(pλL,qλL),1≤Hλ(PA,n∥PH,n)<B˜λ,X0,n(pλU,qλU)=:Bλ,X0,nU, (41)
    where for general λ∈R\{0,1}, p∈R,q∈R\{0} we use the definitions
    B˜λ,X0,n(p,q):=expan(q)·X0+∑k=1nbk(p,q)=expan(q)·X0+pq∑k=1nak(q)+n·pqβλ−αλ, (42)
    as well as
    B˜λ,X0,n(p,0):=exp−βλ·X0+p·e−βλ−αλ·n.

Remark 1.

  • (a) 

    Notice that the expression B˜λ,X0,n(p,q) can analogously be defined on the parameter set PNI∪PSP,1. For the choices qλE:=βAλβH1−λ>0 and pλE:=αAλαH1−λ=qλE·αAβA=qλE·αHβH≥0 one gets (pλE/qλE)·βλ−αλ=0, and thus the characterization B˜λ,X0,n(pλE,qλE)=Vλ,X0,n as the exact value (rather than a lower/upper bound (component)).

  • (b) 

    In the case q=βλ one gets the explicit representation B˜λ,X0,n(p,q)=expp−αλ·n.

  • (c) 

    Using the skew symmetry (8), one can derive alternative bounds of the Hellinger integral by switching to the transformed parameter setup (βA↔,βH↔,αA↔,αH↔,λ↔):=(βH,βA,αH,αA,1−λ). However, this does not lead to different bounds: define ϕ↔λ↔, φ↔λ↔ and f↔λ↔ analogously to (30), (31) and (32) by replacing the parameters βA,βH,αA,αH,λ with (βA↔,βH↔,αA↔,αH↔,λ↔). Then, there holds f↔λ↔(x)=fλ(x),φ↔λ↔(x)=φλ(x) and ϕ↔λ↔(x)=ϕλ(x), and the set of (lower and upper bound) parameters pλL,qλL,pλU,qλU satisfying (35) does not change under this transformation.

  • (d) 

    If there are no other restrictions on pλL,pλU,qλL,qλU than (35), the bounds in (40) and (41) can have some inconvenient features, e.g., being 1 for all (large enough) n∈N, having oscillating n-behaviour, being suboptimal in certain (other) senses. For a detailed discussion, the reader is referred to Section 3.16 ff. below.

  • (e) 

    For the (to our context) incompatible setup of GWI with Poisson offspring but nonstochastic immigration of constant value 1, the exact values of the corresponding Hellinger integrals (i.e., an “analogue” of part (a)) was established in Linkov & Lunyova [53].

Proof of Theorem 1.

Let us fix βA,βH,αA,αH∈P as well as x0:=X0∈N, and start with arbitrary λ∈]0,1[. We first prove the upper bound Bλ,X0,nU of part (b). Correspondingly, we suppose that the coefficients pλU, qλU satisfy (35) for all x∈N0. From (28), (30), (31), (32) and (35) one gets immediately Bλ,X0,1U in terms of the first sequence-element a1(qλU) (cf. (36)). With the help of (29) for all observation horizons n∈N\{1} we get (with the obvious shortcut for n=2)

HλPA,n∥PH,n=∑x1=0∞⋯∑xn−1=0∞∏k=1n−1Zn,k(λ)(x→)·expφλ(xn−1)−fλ(xn−1)<∑x1=0∞⋯∑xn−1=0∞∏k=1n−1Zn,k(λ)(x→)·exp(pλU−αλ)+(qλU−βλ)xn−1=∑x1=0∞⋯∑xn−1=0∞∏k=1n−1Zn,k(λ)(x→)·expb1(pλU,qλU)+a1(qλU)xn−1=expb1(pλU,qλU)∑x1=0∞⋯∑xn−2=0∞∏k=1n−2Zn,k(λ)(x→)·expexpa1(qλU)φλ(xn−2)−fλ(xn−2)<expb1(pλU,qλU)∑x1=0∞⋯∑xn−2=0∞∏k=1n−2Zn,k(λ)(x→)·expexpa1(qλU)pλU−αλ+expa1(qλU)qλU−βλ·xn−2<expb1(pλU,qλU)∑x1=0∞⋯∑xn−2=0∞∏k=1n−2Zn,k(λ)(x→)·expb2(pλU,qλU)+a2(qλU)xn−2<⋯<expan(qλU)x0+∑k=1nbk(pλU,qλU). (43)

Notice that for the strictness of the above inequalities we have used the fact that ϕλ(x)<ϕλU(x) for some (in fact, all but at most two) x∈N0 (cf. Properties 3(P19) below). Since for some admissible choices of pλU,qλU and some n∈N the last term in (43) can become larger than 1, one needs to take into account the cutoff-point 1 arising from (9). The lower bound Bλ,X0,nL of part (b), as well as the exact value of part (a) follow from (29) in an analogous manner by employing pλL,qλL and pλE,qλE respectively. Furthermore, we use the fact that for βA,βH,αA,αH,λ∈(PNI∪PSP,1)×]0,1[ one gets from (38) the relation bn(pλE,qλE)=αAβAan(qλE). For the sake of brevity, the corresponding straightforward details are omitted here. Although we take the minimum of the upper bound derived in (43) and 1, the inequality Bλ,X0,nL<Bλ,X0,nU is nevertheless valid: the reason is that for constituting a lower bound, the parameters pλL,qλL must fulfill either the conditions [pλL−αλ<0 and qλL−βλ≤0] or [pλL−αλ≤0 and qλL−βλ<0] (or both), which guarantees that Bλ,X0,nL<1. The proof for all λ∈R\[0,1] works out completely analogous, by taking into account the generally valid lower bound Hλ(PA,n∥PH,n)≥1 (cf. (11)). □

3.2. Some Useful Facts for Deeper Analyses

Theorem 1(b) and Remark 1(a) indicate the crucial role of the expression B˜λ,X0,n(p,q) and that the choice of the quantities p,q depends on the underlying (e.g., fixed) offspring-immigration parameter constellation βA,βH,αA,αH as well as on the (e.g., selectable) value of λ, i.e., pλA=pAβA,βH,αA,αH,λ and qλA=qAβA,βH,αA,αH,λ with A∈{E,L,U}. In order to study the desired time-behaviour n↦B˜λ,X0,n(·,·) of the Hellinger integral bounds resp. exact values, one therefore faces a six-dimensional (and thus highly non-obvious) detailed analysis, including the search for criteria (in addition to (35)) on good/optimal choices of pλL,qλL,pλU,qλU. Since these criteria will (almost) always imply the nonnegativity of pλA,qλA (A∈{L,U}) and pλE≥0,qλE>0 (cf. Remark 1(a)), let us first present some fundamental properties of the underlying crucial sequences an(q)n∈N and bn(p,q)n∈N for general p≥0,q≥0.

Properties 1.

For all λ∈R the following holds:

  • (P1) 
    If 0<q<βλ, then the sequence an(q)n∈N is strictly negative, strictly decreasing and converges to the unique negative solution x0(q)∈]−βλ,q−βλ[ of the equation
    ξλ(q)(x)=q·ex−βλ=x. (44)
  • (P2) 

    If 0<q=βλ, then an(q)≡0.

  • (P3) 
    If q>max{0,βλ}, then the sequence an(q)n∈N is strictly positive and strictly increasing. Notice that in this setup, q=1 implies min{1,eβλ−1}=eβλ−1<q.
    • (P3a) 
      If additionally q≤min1,eβλ−1, then the sequence an(q)n∈N converges to the smallest positive solution x0(q)∈]0,−logq] of the Equation (44).
    • (P3b) 
      If additionally q>min1,eβλ−1, then the sequence an(q)n∈N diverges to ∞, faster than exponentially (i.e., there do not exist constants c1,c2∈R such that an(q)≤ec1+c2n for all n∈N).
  • (P4) 

    If q=0, then one gets an(0)≡−βλ.

    Due to the linear interrelation (38), these results directly carry over to the behaviour of the sequence bn(p,q)n∈N:

  • (P5) 
    If p>0 and 0<q<βλ, then the sequence bn(p,q)n∈N is strictly decreasing and converges to p·ex0(q)−αλ. Trivially, b1(p,q)=p−αλ.
    • (P5a) 
      If additionally p<αλ, then bn(p,q)n∈N is strictly negative for all n∈N.
    • (P5b) 
      If additionally p=αλ, then bn(p,q)n∈N is strictly negative for all n∈N\{1}.
    • (P5c) 
      If additionally p>αλ, then bn(p,q)n∈N is strictly positive for some (and possibly for all) n∈N.
  • (P6) 

    If 0<q=βλ, then bn(p,q)≡p−αλ.

  • (P7) 
    If p>0 and q>max{0,βλ}, then the sequence bn(p,q)n∈N is strictly increasing.
    • (P7a) 
      If additionally q≤min1,eβλ−1, then the sequence bn(p,q)n∈N converges to p·ex0(q)−αλ∈]p−αλ,p/q−αλ]; this limit can take any sign, depending on the parameter constellation.
    • (P7b) 
      If additionally q>min1,eβλ−1, then the sequence bn(p,q)n∈N diverges to ∞, faster than exponentially.
  • (P8) 

    For the remaining cases we get: bn(0,q)≡−αλ and bn(p,0)≡p·e−βλ−αλ (p∈R,q∈R). Moreover, in our investigations we will repeatedly make use of the function ξλ(q)(·) from the definition (36) of an(q) (see also (44)), which has the following properties:

  • (P9) 
    For q∈]0,∞[ and all λ∈R\{0,1} the function ξλ(q)(·) is strictly increasing, strictly convex and smooth, and there holds
    • (P9a) 
      ξλ(q)(0)<0,ifq<βλ,=0,ifq=βλ,>0,ifq>βλ.
    • (P9b) 
      limx→−∞ξλ(q)(x)=−βλ,andlimx→∞ξλ(q)(x)=∞.

The proof of these properties is provided in Appendix A.1. From Properties 1 (P1) to (P4) we can see, that the behaviour of the sequence an(q)n∈N can be classified basically into four different types; besides the case (P2) where an(q) is constant, the sequence can be either (i) strictly decreasing and convergent (e.g., for the NI case βA,βH,αA,αH,λ=(0.5,2,0,0,0.5) leading to βλ=λβA+(1−λ)βH=1.25 and to q:=qλE=βAλβH1−λ=1, cf. (33) resp. Theorem 1(a)), or (ii) strictly increasing and convergent (e.g., for βA,βH,αA,αH,λ=(0.5,2,0,0,1.5) leading to βλ=−0.25, q:=qλE=0.25), or (iii) strictly increasing and divergent (e.g., for βA,βH,αA,αH,λ=(0.5,2,0,0,2.7) leading to βλ=−2.05, q:=qλE≈0.047366). Within our running-example epidemiological context of Section 2.3, this corresponds to a “potentially dangerous” infectious-disease-transmission situation (H) (with supercritical reproduction number βH=2), whereas (A) describes a “mild” situation (with “low” subcritical βA=0.5).

As already mentioned before, the sequences an(q)n∈N and bn(p,q)n∈N–whose behaviours for general p≥0 and q≥0 were described by the Properties 1–have to be evaluated at setup-dependent choices p=pλ=pβA,βH,αA,αH,λ and q=qλ=qβA,βH,αA,αH,λ. Hence, for fixed βA,βH,αA,αH, one of the questions–which arises in the course of the desired investigations of the time-behaviour of the Hellinger integral bounds (resp. exact values)–is for which λ∈R the sequence an(qλ)n∈N converges. In the following, we illuminate this for the important special case qλ=βAλβH1−λ. Suppose at first that βA≠βH. Properties 1 (P1) implies that for λ∈]0,1[ one has limn→∞an(qλ)=x0(qλ)∈]−βλ,qλ−βλ[, and Lemma A1 states that qλ−βλ<0. For λ∈R\[0,1], there holds qλ>max{0,βλ}, and from (P3) one can see that an(qλ)n∈N does not converge to x0(qλ) in general, but for qλ≤min{1,eβλ−1} which constitutes an implicit condition on λ. This can be made explicit, with the help of the auxiliary variables

λ−:=λ−(βA,βH):=infλ≤0:βAλβH1−λ≤min1,exp{λβA+(1−λ)βH−1},incasethatthesetisnonempty,0,else,λ+:=λ+(βA,βH):=supλ≥1:βAλβH1−λ≤min1,exp{λβA+(1−λ)βH−1},incasethatthesetisnonempty,1,else.

For the constellation βA=βH>0 we clearly obtain qλ=βAλβH1−λ=βA=βH=βλ. Hence, (P2) implies that the sequence an(qλ)n∈N converges for all λ∈R\{0,1} and we can set λ−:=−∞ as well as λ+:=∞. Incorporating this and by adapting a result of Linkov & Lunyova [53] on λ−(v1,v2),λ+(v1,v2) for βA≠βH, we end up with

Lemma 1.

(a) For all βA>0,βH>0 with βA≠βH there holds

λ−=λ−(βA,βH)=0,ifβH≥1,λ˘,ifβH<1andβA∉[βH,βHz(βH)],−∞,ifβH<1andβA∈]βH,βHz(βH)],
λ+=λ+(βA,βH)=1,ifβA≥1,λ˘,ifβA<1andβH∉[βA,βAz(βA)],∞,ifβA<1andβH∈]βA,βAz(βA)],

where

λ˘:=λ˘(βA,βH):=βH−1−logβHβH−βA+logβAβH<0,ifβH<1andβA∉[βH,βHz(βH)],>1,ifβA<1andβH∉[βA,βAz(βA)].

Here, for fixed β∈]0,∞[\{1} we denote by z(β) the unique solution of the equation log(x)−β(x−1)=0, x∈]0,∞[\{1}. For β=1, z(β)=1 denotes the unique solution of log(x)−(x−1)=0,x∈]0,∞[. (b) For all βA=βH>0 one gets λ−=λ−(βA,βH)=−∞ as well as λ+=λ+(βA,βH)=∞. Notice that the relationship λ˘(βA,βH)=1−λ˘(βH,βA) is consistent with the skew symmetry (8).

A corresponding proof is given in Appendix A.1.

With these auxiliary basic facts in hand, let us now work out our detailed investigations of the time-behaviour n↦Hλ(PA,n∥PH,n), where we start with the exactly treatable case (a) in Theorem 1.

3.3. Detailed Analyses of the Exact Recursive Values, i.e., for the Cases βA,βH,αA,αH∈PNI∪PSP,1

In the no-immigration-case βA,βH,αA,αH∈PNI and in the equal-fraction-case βA,βH,αA,αH∈PSP,1, the Hellinger integral can be calculated exactly in terms of Hλ(PA,n∥PH,n)=Vλ,X0,n (cf. (39)), as proposed in part (a) of Theorem 1. This quantity depends on the behaviour of the sequence an(qλE)n∈N, with qλE:=βAλβH1−λ>0, and of the sum αAβA∑k=1nak(qλE)n∈N. The last expression is equal to zero on PNI. On PSP,1, this sum is unequal to zero. Using Lemma A1 we conclude that qλE<βλ (resp. qλE>βλ) iff λ∈]0,1[ (resp. λ∈R\[0,1]), since on PNI∪PSP,1 there holds βA≠βH. Thus, from Properties 1 (P1) we can see that the sequence an(qλE)n∈N is strictly negative, strictly decreasing and it converges to the unique solution x0(qλE)∈]−βλ,qλE−βλ[ of the Equation (44) if λ∈]0,1[. For λ∈R\[0,1], (P3) implies that the sequence an(qλE)n∈N is strictly positive, strictly increasing and converges to the smallest positive solution x0(qλE)∈]0,−log(qλE)] of the Equation (44) in case that (P3a) is satisfied, otherwise it diverges to ∞. Thus, we have shown the following detailed behaviour of Hellinger integrals:

Proposition 2.

For all βA,βH,αA,αH,λ∈PNI×]0,1[ and all initial population sizes X0∈N there holds

(a)Hλ(PA,1∥PH,1)=expβAλβH1−λ−λβA−(1−λ)βHX0<1,(b)thesequenceHλ(PA,n∥PH,n)n∈NgivenbyHλ(PA,n∥PH,n)=expan(qλE)X0=:Vλ,X0,nisstrictlydecreasing,(c)limn→∞Hλ(PA,n∥PH,n)=expx0(qλE)X0∈]0,1[,(d)limn→∞1nlogHλ(PA,n∥PH,n)=0(e)themapX0↦Vλ,X0,nisstrictlydecreasing.

Proposition 3.

For all βA,βH,αA,αH,λ∈PNI×(R\[0,1]) and all initial population sizes X0∈N there holds with qλE:=βAλβH1−λ

(a)Hλ(PA,1∥PH,1)=expβAλβH1−λ−βλ·X0>1,(b)thesequenceHλ(PA,n∥PH,n)n∈NgivenbyHλ(PA,n∥PH,n)=expan(qλE)·X0=:Vλ,X0,nisstrictlyincreasing,(c)limn→∞Hλ(PA,n∥PH,n)=expx0(qλE)·X0>1,ifλ∈[λ−,λ+]\[0,1],∞,ifλ∈]−∞,λ−[∪]λ+,∞[,(d)limn→∞1nlogHλ(PA,n∥PH,n)=0,ifλ∈[λ−,λ+]\[0,1],∞,ifλ∈]−∞,λ−[∪]λ+,∞[,(e)themapX0↦Vλ,X0,nisstrictlyincreasing.

In the case βA,βH,αA,αH∈PSP,1, the sequence an(qλE)n∈N under consideration is formally the same, with the parameter qλE:=βAλβH1−λ>0. However, in contrast to the case PNI, on PSP,1 both the sequence an(qλE)n∈N and the sum αAβA∑k=1nak(qλE)n∈N are strictly decreasing in case that λ∈]0,1[, and strictly increasing in case that λ∈R\[0,1]. The respective convergence behaviours are given in Properties 1 (P1) and (P3). We thus obtain

Proposition 4.

For all βA,βH,αA,αH,λ∈PSP,1×]0,1[ and all initial population sizes X0∈N there holds with qλE:=βAλβH1−λ

(a)Hλ(PA,1∥PH,1)=expβAλβH1−λ−βλ·X0+αAβA<1,(b)thesequenceHλ(PA,n∥PH,n)n∈NgivenbyHλ(PA,n∥PH,n)=expan(qλE)·X0+αAβA∑k=1nak(qλE)=:Vλ,X0,nisstrictlydecreasing,(c)limn→∞Hλ(PA,n∥PH,n)=0,(d)limn→∞1nlogHλ(PA,n∥PH,n)=αAβA·x0(qλE)<0,(e)themapX0↦Vλ,X0,nisstrictlydecreasing.

Proposition 5.

For all βA,βH,αA,αH,λ∈PSP,1×(R\[0,1]) and all initial population sizes X0∈N there holds with qλE:=βAλβH1−λ

(a)Hλ(PA,1∥PH,1)=expβAλβH1−λ−βλ·X0+αAβA>1,(b)thesequenceHλ(PA,n∥PH,n)n∈NgivenbyHλ(PA,n∥PH,n)=expan(qλE)·X0+αAβA∑k=1nak(qλE)=:Vλ,X0,nisstrictlyincreasing,(c)limn→∞Hλ(PA,n∥PH,n)=∞,(d)limn→∞1nlogHλ(PA,n∥PH,n)=αAβA·x0(qλE)>0,ifλ∈[λ−,λ+]\[0,1],∞,ifλ∈]−∞,λ−[∪]λ+,∞[,(e)themapX0↦Vλ,X0,nisstrictlyincreasing.

Due to the nature of the equal-fraction-case PSP,1, in the assertions (a), (b), (d) of the Propositions 4 and 5, the fraction αA/βA can be equivalently replaced by αH/βH.

Remark 2.

For the (to our context) incompatible setup of GWI with Poisson offspring but nonstochastic immigration of constant value 1, an “analogue” of part (d) of the Propositions 4 resp. 5 was established in Linkov & Lunyova [53].

3.4. Some Preparatory Basic Facts for the Remaining Cases βA,βH,αA,αH∈PSP\PSP,1

The bounds Bλ,X0,nL,Bλ,X0,nU for the Hellinger integral introduced in formula (40) in Theorem 1 can be chosen arbitrarily from a (pλL,qλL,pλU,qλU)-indexed set of context-specific parameters satisfying (34), or equivalently (35).

In order to derive bounds which are optimal, with respect to goals that will be discussed later, the following monotonicity properties of the sequences an(q)n∈N and bn(p,q)n∈N (cf. (36), (37)) for general, context-independent parameters q and p, will turn out to be very useful:

Properties 2.

  • (P10) 

    For 0≤q1<q2<∞ there holds an(q1)<an(q2) for all n∈N.

  • (P11) 

    For each fixed q≥0 and 0≤p1<p2<∞ there holds bn(p1,q)<bn(p2,q), for all n∈N.

  • (P12) 

    For fixed p>0 and 0≤q1<q2 it follows bn(p,q1)<bn(p,q2) for all n∈N.

  • (P13) 
    Suppose that 0≤p1<p2 and 0≤q2<q1. For fixed n∈N, no dominance assertion can be conjectured for bn(p1,q1),bn(p2,q2). As an example, consider the setup βA,βH,αA,αH,λ=(0.4,0.8,5,3,0.5); within our running-example epidemiological context of Section 2.3, this corresponds to a “nearly dangerous” infectious-disease-transmission situation (H) (with nearly critical reproduction number βH=0.8 and importation mean of αH=3), whereas (A) describes a “mild” situation (with “low” subcritical βA=0.4 and αA=5). On the nonnegative real line, the function ϕλ(x) can be bounded from above by the linear functions ϕλU,1(x):=p1+q1x:=4.040+0.593·x as well as by ϕλU,2(x):=p2+q2x:=4.110+0.584·x. Clearly, p1<p2 and q1>q2. Let us show the first eight elements and the respective limits of the corresponding sequences bn(p1,q1),bn(p2,q2):
    n 1 2 3 4 5 6 7 8 ⋯ ∞
    bn(p1,q1) 0.040 0.011 −0.005 −0.015 −0.021 −0.024 −0.026 −0.028 ⋯ −0.029
    bn(p2,q2) 0.110 0.045 0.007 −0.014 −0.026 −0.033 −0.036 −0.039 ⋯ −0.041
  • (P14) 
    For arbitrary 0<p1,p2 and 0≤q1,q2≤min{1,eβλ−1} suppose that log(p1)+x0(q1)<log(p2)+x0(q2). Then there holds
    p1·ex0(q1)−αλ=limn→∞1n∑k=1nbk(p1,q1)<limn→∞1n∑k=1nbk(p2,q2)=p2·ex0(q2)−αλ.

From (P10) to (P12) one deduces that both sequences an(q)n∈N and bn(p,q)n∈N are monotone in the general parameters p,q≥0. Thus, for the upper bound of the Hellinger integral Bλ,X0,nU we should use nonnegative context-specific parameters pλU=pUβA,βH,αA,αH,λ and qλU=qUβA,βH,αA,αH,λ which are as small as possible, and for the lower bound Bλ,X0,nL we should use nonnegative context-specific parameters pλL=pLβA,βH,αA,αH,λ and qλL=qLβA,βH,αA,αH,λ which are as large as possible, of course, subject to the (equivalent) restrictions (34) and (35).

To find “optimal” parameter pairs, we have to study the following properties of the function ϕλ(·)=ϕ(·,βA,βH,αA,αH,λ) defined on [0,∞[ in (30) (which are also valid for the previous parameter context βA,βH,αA,αH∈(PNI∪PSP,1)):

Properties 3.

  • (P15) 
    One has
    ϕλ(x)=αA+βAxλαH+βHx1−λ−λ(αA+βAx)+(1−λ)(αH+βHx)≤0,ifλ∈]0,1[,≥0,ifλ∈R\[0,1],
    where equality holds iff fA(x)=fH(x) for some x∈[0,∞[ iff x=x*:=αA−αHβH−βA∈[0,∞[.
  • (P16) 
    There holds
    ϕλ(0)=αAλαH1−λ−αλ≤0,ifλ∈]0,1[,≥0,ifλ∈R\[0,1],
    with equality iff αA=αH together with βA≠βH (cf. Lemma A1).
  • (P17) 
    For all λ∈R\{0,1} one gets
    ϕλ′(x)=λβAfA(x)λ−1fH(x)1−λ+(1−λ)βHfA(x)λfH(x)−λ−βλ.
  • (P18) 
    There holds
    limx→∞ϕλ′(x)=βAλβH1−λ−βλ≤0,ifλ∈]0,1[,≥0,ifλ∈R\[0,1],
    with equality iff βA=βH together with αA≠αH (cf. Lemma A1).
  • (P19) 
    There holds
    ϕλ′′(x)=−λ(1−λ)fA(x)λ−2fH(x)−λ−1αAβH−αHβA2≤0,ifλ∈]0,1[,≥0,ifλ∈R\[0,1],
    with equality iff βA,βH,αA,αH∈(PNI∪PSP,1). Hence, for βA,βH,αA,αH∈PSP\PSP,1, the function ϕλ is strictly concave (convex) for λ∈]0,1[ (λ∈R\[0,1]). Notice that ϕλ′(0)=λβAαAαHλ−1+(1−λ)βHαAαHλ−βλ can be either negative (e.g., for the setup βA,βH,αA,αH,λ∈{(4,2,3,1,0.5), (4,2,5,1,2)}, or zero (e.g., for βA,βH,αA,αH,λ∈(4,2,4,1,0.5),(4,2,3,1,2)), or positive (e.g., for βA,βH,αA,αH,λ∈{(4,2,5,1,0.5), (4,2,2,1,2)}), where the exemplary parameter constellations have concrete interpretations in our running-example epidemiological context of Section 2.3. Accordingly, for λ∈]0,1[, due to concavity and (P17), the function ϕλ(·) can be either strictly decreasing, or can obtain its global maximum in ]0,∞[, or–only in the case βA=βH—can be strictly increasing. Analogously, for λ∈R\[0,1], the function ϕλ(·) can be either strictly increasing, or can obtain its global minimum in ]0,∞[, or–only in the case βA=βH—can be strictly decreasing.
  • (P20)
    For all λ∈R\{0,1} one has
    limx→∞ϕλ(x)−rλ˜+sλ˜x=0,forrλ˜:=pλ˜−αλ:=λαAβAβHλ−1+(1−λ)αHβAβHλ−αλandsλ˜:=qλ˜−βλ:=βAλβH1−λ−βλ.
    The linear function ϕλ˜(x):=rλ˜+sλ˜·x constitutes the asymptote of ϕλ(·). Notice that if βA=βH one has s˜λ=0=r˜λ; if βA≠βH we have s˜λ<0 in the case λ∈]0,1[ and s˜λ>0 if λ∈R\[0,1]. Furthermore, ϕλ(0)<rλ˜ if λ∈]0,1[ and ϕλ(0)>rλ˜ if λ∈R\[0,1], (cf. Lemma A1(c1) and (c2)). If αA=αH (and thus βA≠βH), then the intercept rλ˜ is strictly positive if λ∈]0,1[ resp. strictly negative if λ∈R\[0,1]. In contrast, for the case αA≠αH, the intercept rλ˜ can assume any sign, take e.g., βA,βH,αA,αH,λ∈{(3.7,0.9,2.0,1.0,0.5),(4,2,1.6,1,2)} for rλ˜>0, βA,βH,αA,αH,λ∈{(3.6,0.9,2.0,1.0,0.5),(4,2,1.5,1,2)} for rλ˜=0, and βA,βH,αA,αH,λ∈{(3.5,0.9,2.0,1.0,0.5),(4,2,1.4,1,2)} for rλ˜<0; again, the exemplary parameter constellations have concrete interpretations in our running-example epidemiological context of Section 2.3.

The properties (P15) to (P20) above describe in detail the characteristics of the function ϕλ(·)=ϕ(·,βA,βH,αA,αH,λ). In the previous parameter setup PNI∪PSP,1, this function is linear, which can be seen from (P19). In the current parameter setup PSP\PSP,1, this function can basically be classified into four different types. From (P16) to (P20) it is easy to see that for all current parameter constellations the particular choices

pλA:=αAλαH1−λ>0,qλA:=βAλβH1−λ>0, (45)

which correspond to the following choices in (35)

rλA:=αAλαH1−λ−αλ≤0(resp.≥0),sλA:=βAλβH1−λ−βλ≤0(resp.≥0),

– where A=L (resp. A=U)–lead to the tightest lower bound Bλ,X0,nL (resp. upper bound Bλ,X0,nU) for Hλ(PA,n∥PH,n) in (40) in the case λ∈]0,1[ (resp. λ∈R\[0,1]). Notice that for the previous parameter setup βA,βH,αA,αH∈(PNI∪PSP,1) these choices led to the exact values of the Hellinger integral and to the simplification pλE/qλE·βλ−αλ=0, which implies bn(pλE,qλE)=αA/βA·an(qλE). In contrast, in the current parameter setup βA,βH,αA,αH∈PSP\PSP,1 we only derive the optimal lower (resp. upper) bound for λ∈]0,1[ (resp. λ∈R\[0,1]) by using the parameters pλA,qλA for A=L (resp. A=U) and pλA/qλA·βλ−αλ≠0. For a better distinguishability and easier reference we thus stick to the L–notation (resp. U–notation) here.

3.5. Lower Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[

The discussion above implies that the lower bound Bλ,X0,nL for the Hellinger integral Hλ(PA,n∥PH,n) in (40) is optimal for the choices pλL,qλL>0 defined in (45). If βA≠βH, due to Properties 1 (P1) and Lemma A1, the sequence an(qλL)n∈N is strictly negative and strictly decreasing and converges to the unique negative solution of the Equation (44). Furthermore, due to (P5), the sequence bn(pλL,qλL)n∈N, as defined in (37), is strictly decreasing. Since b1(pλL,qλL)=pλL−αλ≤0 by Lemma A1, with equality iff αA=αH, the sequence bn(pλL,qλL)n∈N is also strictly negative (with the exception b1(pλL,qλL)=0 for αA=αH) and strictly decreasing. If βA=βH and thus αA≠αH, due to (P2), (P6) and Lemma A1, there holds an(qλL)≡0 and bn(qλL)≡pλL−αλ<0. Thus, analogously to the cases PNI∪PSP,1 we obtain

Proposition 6.

For all βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[ and all initial population sizes X0∈N there holds with pλL:=αAλαH1−λ,qλL:=βAλβH1−λ

(a)Bλ,X0,1L=expβAλβH1−λ−βλ·X0+αAλαH1−λ−αλ<1,(b)thesequenceoflowerboundsBλ,X0,nLn∈NforHλ(PA,n∥PH,n)givenbyBλ,X0,nL=expan(qλL)·X0+pλLqλL∑k=1nak(qλL)+n·pλLqλL·βλ−αλisstrictlydecreasing,(c)limn→∞Bλ,X0,nL=0,(d)limn→∞1nlogBλ,X0,nL=pλLqλL·x0(qλL)+βλ−αλ=pλL·ex0(qλL)−αλ<0.(e)themapX0↦Bλ,X0,nLisstrictlydecreasing.

3.6. Goals for Upper Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[

For parameter constellations βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[, in contrast to the treatment of the lower bounds (cf. the previous Section 3.5), the fine-tuning of the upper bounds of the Hellinger integrals Hλ(PA,n∥PH,n) is much more involved. To begin with, let us mention that the monotonicity-concerning Properties 2 (P10) to (P12) imply that for a tight upper bound Bλ,X0,nU (cf. (40)) one should choose parameters pλU≥pλL>0,qλU≥qλL>0 as small as possible. Due to the concavity (cf. Properties 3 (P19)) of the function ϕλ(·), the linear upper bound ϕλU(·) (on the ultimately relevant subdomain N0) thus must hit the function ϕλ(·) in at least one point x∈N0, which corresponds to some “discrete tangent line” of ϕλ(·) in x, or in at most two points x,x+1∈N0, which corresponds to the secant line of ϕλ(·) across its arguments x and x+1. Accordingly, there is in general no overall best upper bound; of course, one way to obtain “good” upper bounds for Hλ(PA,n∥PH,n) is to solve the optimization problem

pλU¯,qλU¯:=argmin(pλU,qλU)expan(qλU)·X0+∑k=1nbk(pλU,qλU), (46)

subject to the constraint (35). However, the corresponding result generally depends on the particular choice of the initial population X0∈N and on the observation time horizon n∈N. Hence, there is in general no overall optimal choice of pλU,qλU without the incorporation of further goal-dependent constraints such as limn→∞Bλ,X0,nU=0 in case of limn→∞Hλ(PA,n∥PH,n)=0. By the way, mainly because of the non-explicitness of the sequence an(qλU)n∈N (due to the generally not explicitly solvable recursion (36)) and the discreteness of the constraint (35), this optimization problem seems to be not straightforward to solve, anyway. The choice of parameters pλU,qλU for the upper bound Bλ,X0,nU≥Hλ(PA,n∥PH,n) can be made according to different, partially incompatible (“optimality-” resp. “goodness-”) criteria and goals, such as:

  • (G1)

    the validity of Bλ,X0,nU<1 simultaneously for all initial configurations X0∈N, all observation horizons n∈N and all λ∈]0,1[, which leads to a strict improvement of the general upper bound Hλ(PA,n∥PH,n)<1 (cf. (9));

  • (G2)

    the determination of the long-term-limits limn→∞Hλ(PA,n∥PH,n) respectively limn→∞Bλ,X0,nU for all X0∈N and all λ∈]0,1[; in particular, one would like to check whether limn→∞Hλ(PA,n∥PH,n)=0, which implies that the families of probability distributions PA,nn∈N and PH,nn∈N are asymptotically distinguishable (entirely separated), cf. (25);

  • (G3)

    the determination of the time-asymptotical growth rates limn→∞1nlogHλ(PA,n∥PH,n) resp. limn→∞1nlogBλ,X0,nU for all X0∈N and all λ∈]0,1[.

Further goals–with which we do not deal here for the sake of brevity–are for instance (i) a very good tightness of the upper bound Bλ,X0,nU for n≥N for some fixed large N∈N, or (ii) the criterion (G1) with fixed (rather than arbitrary) initial population size X0∈N.

Let us briefly discuss the three Goals (G1) to (G3) and their challenges: due to Theorem 1, Goal (G1) can only be achieved if the sequence an(qλU)n∈N is non-increasing, since otherwise, for each fixed observation horizon n∈N there is a large enough initial population size X0 such that the upper bound component B˜λ,X0,n(pλU,qλU) becomes larger than 1, and thus Bλ,X0,nU=1 (cf. (40)). Hence, Properties 1 (P1) and (P2) imply that one should have qλU≤βλ. Then, the sequence bn(pλU,qλU)n∈N is also non-increasing. However, since bn(pλU,qλU) might be positive for some (even all) n∈N, the sum ∑k=1nbk(pλU,qλU)n∈N is not necessarily decreasing. Nevertheless, the restriction

qλU−βλ≤0andpλU−αλ≤0,whereatleastoneoftheinequalitiesisstrict, (47)

ensures that both sequences an(qλU)n∈N and bn(pλL,qλU)n∈N are nonpositive and decreasing, where at least one sequence is strictly negative, implying that the sum ∑k=1nbk(pλU,qλU)n∈N is strictly negative for n≥2 and strictly decreasing. To see this, suppose that (47) is satisfied with two strict inequalities. Then, an(qλU)n∈N as well as bn(pλL,qλU)n∈N are strictly negative and strictly decreasing. If qλU=βλ and pλU<αλ, we see from (P2) and (P6) that an(qλU)≡0 and that bn(pλU,qλU)≡pλU−αλ<0 (notice that αλ=0 is not possible in the current setup PSP\PSP,1 and for λ∈]0,1[). In the last case qλU<βλ and pλU=αλ, from (P1) and (P5) it follows that an(qλU)n∈N is strictly negative and strictly decreasing, as well as that b1(pλU,qλU)=0 and bn(pλL,qλU)n∈N is strictly decreasing and strictly negative for n≥2. Thus, whenever (47) is satisfied, the sum ∑k=1nbk(pλU,qλU)n∈N is strictly negative for n≥2 and strictly decreasing.

To achieve Goal (G2), we have to require that the sequence an(qλU)n∈N converges, which is the case if either qλU≤βλ or βλ<qλU≤min{1,eβλ−1} (cf. Properties 1 (P1) to (P3)). From the upper bound component B˜λ,X0,n(pλU,qλU) (42) we conclude that Goal (G2) is met if the sequence bn(pλU,qλU)n∈N converges to a negative limit, i.e., limn→∞bn(pλU,qλU)=pλU·ex0(qλU)−αλ<0. Notice that this condition holds true if (47) is satisfied: suppose that qλU<βλ, then x0(qλU)<0 and pλU·ex0(qλU)−αλ<pλU−αλ≤0. On the other hand, if pλU−αλ<0, one obtains x0(qλU)≤0 leading to pλU·ex0(qλU)−αλ≤pλU−αλ<0.

The examination of Goal (G2) above enters into the discussion of Goal (G3): if the sequence an(qλU)n∈N converges and limn→∞Bλ,X0,nU=0, then there holds

limn→∞1nlogBλ,X0,nU=limn→∞1nlogB˜λ,X0,n(pλU,qλU)=pλU·ex0(qλU)−αλ. (48)

For the case βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[, let us now start with our comprehensive investigations of the upper bounds, where we focus on fulfilling the condition (47) which tackles Goals (G1) and (G2) simultaneously; then, the Goal (G3) can be achieved by (48). As indicated above, various different parameter subcases can lead to different Hellinger-integral-upper-bound details, which we work out in the following. For better transparency, we employ the following notations (where the first four are just reminders of sets which were already introduced above)

PNI:=βA,βH,αA,αH∈[0,∞[4:αA=αH=0;βA>0;βH>0;βA≠βH,PSP:=βA,βH,αA,αH∈]0,∞[4:(αA≠αH)or(βA≠βH)orboth,P:=PNI∪PSP,PSP,1:=βA,βH,αA,αH∈PSP:αA≠αH,βA≠βH,αAβA=αHβH,PSP,2:=βA,βH,αA,αH∈PSP:αA=αH,βA≠βH,PSP,3:=βA,βH,αA,αH∈PSP:αA≠αH,βA≠βH,αAβA≠αHβH=PSP,3a∪PSP,3b∪PSP,3c,PSP,3a:=βA,βH,αA,αH∈PSP:αA≠αH,βA≠βH,αAβA≠αHβH,αA−αHβH−βA∈]−∞,0[,PSP,3b:=βA,βH,αA,αH∈PSP:αA≠αH,βA≠βH,αAβA≠αHβH,αA−αHβH−βA∈]0,∞[\N,PSP,3c:=βA,βH,αA,αH∈PSP:αA≠αH,βA≠βH,αAβA≠αHβH,αA−αHβH−βA∈N,PSP,4:=βA,βH,αA,αH∈PSP:αA≠αH>0,βA=βH=PSP,4a∪PSP,4b,PSP,4a:=βA,βH,αA,αH∈PSP:αA≠αH>0,βA=βH∈]0,1[,PSP,4b:=βA,βH,αA,αH∈PSP:αA≠αH>0,βA=βH∈[1,∞[; (49)

notice that because of Lemma A1 and of the Properties 3 (P15) one gets on the domain ]0,∞[ the relation ϕλ(x)=0 iff fA(x)=fH(x) iff x=x*:=αH−αAβA−βH∈]0,∞[.

3.7. Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,2×]0,1[

For this parameter constellation, one has ϕλ(0)=0 and ϕλ′(0)=0 (cf. Properties 3 (P16), (P17)). Thus, the only admissible intercept choice satisfying (47) is rλU=0=pλU−αλ(i.e., pλU=pUβA,βH,αA,αH,λ=αλ=α>0), and the minimal admissible slope which implies (35) for all x∈N0 is given by sλU=ϕλ(1)−ϕλ(0)1−0=qλU−βλ=a1(qλU)<0(i.e., qλU=qUβA,βH,αA,αH,λ=(α+βA)λ(α+βH)1−λ−α>0). Analogously to the investigation for PSP,1 in the above-mentioned Section 3.3, one can derive that an(qλU)n∈N is strictly negative, strictly decreasing, and converges to x0(qλU)∈]−βλ,qλU−βλ[ as indicated in Properties 1 (P1). Moreover, in the same manner as for the case PSP,1 this leads to

Proposition 7.

For all βA,βH,αA,αH,λ∈PSP,2×]0,1[ and all initial population sizes X0∈N there holds with pλU=α,qλU=(α+βA)λ(α+βH)1−λ−α

(a)Bλ,X0,1U=expqλU−βλ·X0<1,(b)thesequenceBλ,X0,nUn∈NofupperboundsforHλ(PA,n∥PH,n)givenbyBλ,X0,nU=expan(qλU)·X0+∑k=1nbk(pλU,qλU)isstrictlydecreasing,(c)limn→∞Bλ,X0,nU=0=limn→∞Hλ(PA,n∥PH,n),(d)limn→∞1nlogBλ,X0,nU=pλU·ex0(qλU)−αλ=αex0(qλU)−1<0.(e)themapX0↦Bλ,X0,nUisstrictlydecreasing.

3.8. Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3a×]0,1[

From Properties 3 (P16) one gets ϕλ(0)<0, whereas ϕλ′(0) can assume any sign, take e.g., the parameters βA,βH,αA,αH,λ=(1.8,0.9,2.7,0.7,0.5) for ϕλ′(0)<0, βA,βH,αA,αH,λ=(1.8,0.9,2.8,0.7,0.5) for ϕλ′(0)=0 and βA,βH,αA,αH,λ=(1.8,0.9,2.9,0.7,0.5) for ϕλ′(0)>0; within our running-example epidemiological context of Section 2.3, this corresponds to a “nearly dangerous” infectious-disease-transmission situation (H) (with nearly critical reproduction number βH=0.9 and importation mean of αH=0.7), whereas (A) describes a “dangerous” situation (with supercritical βA=1.8 and αA=2.7,2.8,2.9). However, in all three subcases there holds maxx∈N0ϕλ(x)≤maxx∈[0,∞[ϕλ(x)<0. Thus, there clearly exist parameters pλU=pUβA,βH,αA,αH,λ, qλU=qUβA,βH,αA,αH,λ with pλU∈[αAλαH1−λ,αλ[ and qλU∈[βAλβH1−λ,βλ[ (implying (47)) such that (35) is satisfied. As explained above, we get the following

Proposition 8.

For all βA,βH,αA,αH,λ∈PSP,3a×]0,1[ there exist parameters pλU,qλU which satisfy pλU∈[αAλαH1−λ,αλ[ and qλU∈[βAλβH1−λ,βλ[ as well as (35) for all x∈N0, and for all such pairs (pλU,qλU) and all initial population sizes X0∈N there holds

(a)Bλ,X0,1U=expqλU−βλ·X0+pλU−αλ<1,(b)thesequenceBλ,X0,nUn∈NofupperboundsforHλ(PA,n∥PH,n)givenbyBλ,X0,nU=expan(qλU)X0+∑k=1nbk(pλU,qλU)isstrictlydecreasing,(c)limn→∞Bλ,X0,nU=0=limn→∞Hλ(PA,n∥PH,n),(d)limn→∞1nlogBλ,X0,nU=pλU·ex0(qλU)−αλ<0,(e)themapX0↦Bλ,X0,nUisstrictlydecreasing.

Notice that all parts of this proposition also hold true for parameter pairs (pλU,qλU) satisfying (35) and additionally either pλU=αλ, qλU<βλ or pλU<αλ, qλU=βλ.

Let us briefly illuminate the above-mentioned possible parameter choices, where we begin with the case of ϕλ′(0)≤0, which corresponds to λβAαA/αHλ−1+(1−λ)βHαA/αHλ−βλ≤0 (cf. (P17)); then, the function ϕλ(·) is strictly negative, strictly decreasing, and–due to (P19)–strictly concave (and thus, the assumption αH−αAβA−βH<0 is superfluous here). One pragmatic but yet reasonable parameter choice is the following: take any intercept pλU∈[αAλαH1−λ,αλ] such that (pλU−αλ)+2(ϕλ(1)−(pλU−αλ))≥ϕλ(2) (i.e., 2αA+βAλαH+βH1−λ−pλU+αλ≥αA+2βAλαH+2βH1−λ) and qλU:=ϕλ(1)−(pλU−αλ)+βλ=αA+βAλαH+βH1−λ−pλU, which corresponds to a linear function ϕλU which is (i) nonpositive on N0 and strictly negative on N, and (ii) larger than or equal to ϕλ on N0, strictly larger than ϕλ on N\{1,2}, and equal to ϕλ at the point x=1 (“discrete tangent or secant line through x=1”). One can easily see that (due to the restriction (34)) not all pλU∈[αAλαH1−λ,αλ] might qualify for the current purpose. For the particular choice pλU=αAλαH1−λ and qλU=αA+βAλαH+βH1−λ−αAλαH1−λ one obtains rλU=pλU−αλ=b1(pλU,qλU)<0 (cf. Lemma A1) and sλU=qλU−βλ=ϕλ(1)−ϕλ(0)=a1(qλU)<0 (secant line through ϕλ(0) and ϕλ(1)).

For the remaining case ϕλ′(0)>0, which corresponds to λβAαA/αHλ−1+(1−λ)βHαA/αHλ−βλ>0, the function ϕλ(·) is strictly negative, strictly concave and hump-shaped (cf. (P18)). For the derivation of the parameter choices, we employ xmax:=argmaxx∈]0,∞[ϕλ(x) which is the unique solution of

λβAfA(x)fH(x)λ−1−1+(1−λ)βHfA(x)fH(x)λ−1=0,x∈]0,∞[, (50)

(cf. (P17), (P19)); notice that x=x*:=αH−αAβA−βH∈]0,∞[ formally satisfies the Equation (50) but does not qualify because of the current restriction x*<0.

Let us first inspect the case ϕλ(⌊xmax⌋)>ϕλ(⌊xmax⌋+1), where ⌊x⌋ denotes the integer part of x. Consider the subcase ϕλ(⌊xmax⌋)+⌊xmax⌋ϕλ(⌊xmax⌋)−ϕλ(⌊xmax⌋+1)≤0, which means that the secant line through ϕλ(⌊xmax⌋) and ϕλ(⌊xmax⌋+1) possesses a non-positive intercept. In this situation it is reasonable to choose as intercept any pλU−αλ=b1(pλU,qλU)=rλU∈[ϕλ(⌊xmax⌋),ϕλ(⌊xmax⌋)+⌊xmax⌋ϕλ(⌊xmax⌋)−ϕλ(⌊xmax⌋+1)], and as corresponding slope qλU−αλ=a1(qλU)=sλU=ϕλ(⌊xmax⌋)−rλU(⌊xmax⌋)−0≤0. A larger intercept would lead to a linear function ϕλU for which (35) is not valid at ⌊xmax⌋+1. In the other subcase ϕλ(⌊xmax⌋)+xmaxϕλ(⌊xmax⌋)−ϕλ(⌊xmax⌋+1)>0, one can choose any intercept pλU−αλ=b1(pλU,qλU)=rλU∈[ϕλ(⌊xmax⌋),0] and as corresponding slope qλU−αλ=a1(qλU)=sλU=ϕλ(⌊xmax⌋)−rλU(⌊xmax⌋)−0≤0 (notice that the corresponding line ϕλU is on ]⌊xmax⌋,∞[ strictly larger than the secant line through ϕλ(⌊xmax⌋) and ϕλ(⌊xmax⌋+1)).

If ϕλ(⌊xmax⌋)≤ϕλ(⌊xmax⌋+1), one can proceed as above by substituting the crucial pair of points (⌊xmax⌋,⌊xmax⌋+1) with (⌊xmax⌋+1,⌊xmax⌋+2) and examining the analogous two subcases.

3.9. Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3b×]0,1[

The only difference to the preceding Section 3.8 is that–due to Properties 3 (P15)–the maximum value of ϕλ(·) now achieves 0, at the positive non-integer point xmax=x*=αH−αAβA−βH∈]0,∞[\N (take e.g., βA,βH,αA,αH,λ=(1.8,0.9,1.1,3.0,0.5) as an example, which within our running-example epidemiological context of Section 2.3 corresponds to a “nearly dangerous” infectious-disease-transmission situation (H) (with nearly critical reproduction number βH=0.9 and importation mean of αH=3), whereas (A) describes a “dangerous” situation (with supercritical βA=1.8 and αA=1.1)); this implies that ϕλ(x)<0 for all x on the relevant subdomain N0. Due to (P16), (P17) and (P19) one gets automatically λβAαA/αHλ−1+(1−λ)βHαA/αHλ−βλ>0 for all λ∈]0,1[. Analogously to Section 3.8, there exist parameter pλU∈[αAλαH1−λ,αλ] and qλU∈[βAλβH1−λ,βλ] such that (47) and (35) are satisfied. Thus, all the assertions (a) to (e) of Proposition 8 also hold true for the current parameter constellations.

3.10. Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3c×]0,1[

The only difference to the preceding Section 3.9 is that the maximum value of ϕλ(·) now achieves 0 at the integer point xmax=x*=αH−αAβA−βH∈N (take e.g., βA,βH,αA,αH,λ=(1.8,0.9,1.2,3.0,0.5) as an example). Accordingly, there do not exist parameters pλU,qλU, such that (35) and (47) are satisfied simultaneously. The only parameter pair that ensures expan(qλU)·X0+∑k=1nbk(pλU,qλU)≤1 for all n∈N and all X0∈N without further investigations, leads to the choices pλU=αλ as well as qλU=βλ. Consequently, Bλ,X0,nU≡1, which coincides with the general upper bound (9), but violates the above-mentioned desired Goal (G1). However, there might exist parameters pλU<αλ,qλU>βλ or pλU>αλ,qλU<βλ, such that at least the parts (c) and (d) of Proposition 8 are satisfied. Nevertheless, by using a conceptually different method we can prove

Hλ(PA,n∥PH,n)<1∀n∈N\{1}aswellastheconvergencelimn→∞Hλ(PA,n∥PH,n)=0 (51)

which will be used for the study of complete asymptotical distinguishability (entire separation) below. This proof is provided in Appendix A.1.

3.11. Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,4a×]0,1[

This setup and the remaining setup βA,βH,αA,αH,λ∈PSP,4b×]0,1[ (see the next Section 3.12) are the only constellations where ϕλ(·) is strictly negative and strictly increasing, with limx→∞ϕλ(x)=limx→∞ϕλ′(x)=0, leading to the choices pλU=αλ as well as qλU=βλ=β under the restriction that expan(qλU)·X0+∑k=1nbk(pλU,qλU)≤1 for all n∈N and all X0∈N. Consequently, one has Bλ,X0,nU≡1, which is consistent with the general upper bound (9) but violates the above-mentioned desired Goal (G1). Unfortunately, the proof method of (51) (cf. Appendix A.1) can’t be carried over to the current setup. The following proposition states two of the above-mentioned desired assertions which can be verified by a completely different proof method, which is also given in Appendix A.1.

Proposition 9.

For all βA,βH,αA,αH,λ∈PSP,4a×]0,1[ there exist parameters pλU<αλ, 1>qλU>βλ=β such that (35) is satisfied for all x∈[0,∞[ and such that for all initial population sizes X0∈N the parts (c) and (d) of Proposition 8 hold true.

3.12. Upper Bounds for the Cases βA,βH,αA,αH,λ∈PSP,4b×]0,1[

The assertions preceding Proposition 9 remain valid. However, any linear upper bound of the function ϕλ(·) on the domain N0 possesses the slope qλU−βλ≥0. If qλU=βλ, then the intercept is pλU−αλ=0 leading to Bλ,X0,nU≡1 and thus Goal (G1) is violated. If we use a slope qλU−βλ>0, then both the sequences an(qλU)n∈N and bn(pλU,qλU)n∈N are strictly increasing and diverge to ∞. This comes from Properties 1 (P3b) and (P7b) since qλU>βλ=β≥1. Altogether, this implies that the corresponding upper bound component B˜λ,X0,n(pλU,qλU) (cf. (42)) diverges to ∞ as well. This leads to

Proposition 10.

For all βA,βH,αA,αH,λ∈PSP,4b×]0,1[ and all initial population sizes X0∈N there do not exist parameters pλU≥0, qλU≥0 such that (35) is satisfied and such that the parts (c) and (d) of Proposition 8 hold true.

3.13. Concluding Remarks on Alternative Upper Bounds for all Cases βA,βH,αA,αH,λ∈ (PSP\PSP,1)×]0,1[

As mentioned earlier on, starting from Section 3.6 we have principally focused on constructing upper bounds Bλ,X0,nU of the Hellinger integrals, starting from pλU,qλU which fulfill (35) as well as further constraints depending on the Goals (G1) and (G2). For the setups in the Section 3.7, Section 3.8 and Section 3.9, we have proved the existence of special parameter choices pλU,qλU which were consistent with (G1) and (G2). Furthermore, for the constellation in the Section 3.11 we have found parameters such that at least (G2) is satisfied. In contrast, for the setup of Section 3.12 we have not found any choices which are consistent with (G1) and (G2), leading to the “cut-off bound” Bλ,X0,nU≡1 which gives no improvement over the generally valid upper bound (9).

In the following, we present some alternative choices of pλU,qλU which–depending on the parameter constellation βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[–may or may not lead to upper bounds Bλ,X0,nU which are consistent with Goal (G1) or with (G2) (and which are maybe weaker or better than resp. incomparable with the previous upper bounds when dealing with some relaxations of (G1), such as e.g., Hλ(PA,n∥PH,n)<1 for all but finitely many n∈N).

As a first alternative choice for a linear upper bound of ϕλ(·) (cf. (35)) one could use the asymptote ϕλ˜(·) (cf. Properties 3 (P20)) with the parameters pλU:=pλ˜=λαAβA/βHλ−1+(1−λ)αHβA/βHλ and qλU:=qλ˜=βAλβH1−λ. Another important linear upper bound of ϕλ(·) is the tangent line ϕλ,ytan(·) on ϕλ(·) at an arbitrarily fixed point y∈[0,∞[, which amounts to

ϕλ,ytan(x):=rλ,ytan+sλ,ytan·x:=pλ,ytan−αλ+qλ,ytan−βλ·x:=ϕλ(y)−y·ϕλ′(y)+ϕλ′(y)·x, (52)

where ϕλ′(·) is given by (P17). Notice that this upper bound is for y∈]0,∞[\N “not tight” in the sense that ϕλ,ytan(·) does not hit the function ϕλ(·) on N0 (where the generation sizes “live”); moreover, ϕλ,ytan(x) might take on strictly positive values for large enough points x which is counter-productive for Goal (G1). Another alternative choice of a linear upper bound for ϕλ(·), which in contrast to the tangent line is “tight” (but not necessarily avoiding the strict positivity), is the secant line ϕλ,ksec(·) across its arguments k and k+1, given by

ϕλ,ksec(x):=rλ,ksec+sλ,ksec·x:=pλ,ksec−αλ+qλ,ksec−βλ·x:=ϕλ(k)−k·ϕλ(k+1)−ϕλ(k)+ϕλ(k+1)−ϕλ(k)·x. (53)

Another alternative choice is the horizontal line

ϕλhor(x)≡maxϕλ(y),y∈N0. (54)

For pλU∈pλ˜,pλ,ytan,pλ,ysec and qλU∈qλ,ytan,qλ,ysec it is possible that in some parameter cases βA,βH,αA,αH either the intercept rλU=pλU−αλ is strictly larger than zero or the slope sλU=qλU−βλ is strictly larger than zero. Thus, it can happen that B˜λ,X0,n(pλU,qλU)>1 for some (and even for all) n∈N, such that the corresponding upper bound Bλ,X0,nU for the Hellinger integral Hλ(PA,n∥PH,n) amounts to the cut-off at 1. However, due to Properties 1 (P5) and (P7a), the sequence B˜λ,X0,n(pλU,qλU)n∈N may become smaller than 1 and may finally converge to zero. Due to Properties 2 (P14), this upper bound can even be tighter (smaller) than those bounds derived from parameters pλU,qλU fulfilling (47).

As far as our desired Hellinger integral bounds are concerned, in the setup of Section 3.11—where limy→∞ϕλ,ytan(·)≡0–for the proof of Proposition 9 in Appendix A.1 we shall employ the mappings y↦ϕλ,ytan resp. y↦pλ,ytan resp. y↦qλ,ytan. These will also be used for the proof of the below-mentioned Theorem 4.

3.14. Intermezzo 1: Application to Asymptotical Distinguishability

The above-mentioned investigations can be applied to the context of Section 2.6 on asymptotical distinguishability. Indeed, with the help of the Definitions 1 and 2 as well as the equivalence relations (25) and (26) we obtain the following

Corollary 1.

  • (a) 

    For all βA,βH,αA,αH∈PSP\PSP,4b and all initial population sizes X0∈N, the corresponding sequences (PA,n)n∈N0 and (PH,n)n∈N0 are entirely separated (completely asymptotically distinguishable).

  • (b) 

    For all βA,βH,αA,αH∈PNI with βA≤1 and all initial population sizes X0∈N, the sequence (PA,n)n∈N0 is contiguous to (PH,n)n∈N0.

  • (c) 

    For all βA,βH,αA,αH∈PNI with βA>1 and all initial population sizes X0∈N, the sequence (PA,n)n∈N0 is neither contiguous to nor entirely separated to (PH,n)n∈N0.

The proof of Corollary 1 will be given in Appendix A.1.

Remark 3.

  • (a) 

    Assertion (c) of Corollary 1 contrasts the case of Gaussian processes with independent increments where one gets either entire separation or mutual contiguity (see e.g., Liese & Vajda [1]).

  • (b) 

    By putting Corollary 1(b) and (c) together, we obtain for different “criticality pairs” in the non-immigration case PNI the following asymptotical distinguishability types: (PA,n)◃▹(PH,n) if βA≤1, βH≤1; (PA,n)◃▹¯(PH,n) if βA≤1, βH>1; (PA,n)◃¯▹(PH,n) if βA>1, βH≤1; (PA,n)◃¯▹¯(PH,n) and (PA,n)△¯(PH,n) if βA>1, βH>1; in particular, for PNI the sequences (PA,n)n∈N0 and (PH,n)n∈N0 are not completely asymptotically inseparable (indistinguishable).

  • (c) 

    In the light of the above-mentioned characterizations of contiguity resp. entire separation by means of Hellinger integral limits, the finite-time-horizon results on Hellinger integrals given in the “λ∈]0,1[ parts” of Theorem 1, the Section 3.3, Section 3.4, Section 3.5, Section 3.6, Section 3.7, Section 3.8, Section 3.9, Section 3.10, Section 3.11, Section 3.12, Section 3.13 and also in the below-mentioned Section 6 can loosely be interpreted as “finite-sample (rather than asymptotical) distinguishability” assertions.

3.15. Intermezzo 2: Application to Decision Making under Uncertainty

3.15.1. Bayesian Decision Making

The above-mentioned investigations can be applied to the context of Section 2.5 on dichotomous Bayesian decision making on the space of all possible path scenarios (path space) of Poissonian Galton-Watson processes without/with immigration GW(I) (e.g., in combination with our running-example epidemiological context of Section 2.3). More detailed, for the minimal mean decision loss (Bayes risk) Rn defined by (18) we can derive upper (respectively lower) bounds by using (19) respectively (20) together with the exact values or the upper (respectively lower) bounds of the Hellinger integrals Hλ(PA,n∥PH,n) derived in the “λ∈]0,1[ parts” of Theorem 1, the Section 3.3, Section 3.4, Section 3.5, Section 3.6, Section 3.7, Section 3.8, Section 3.9, Section 3.10, Section 3.11, Section 3.12, Section 3.13 (and also in the below-mentioned Section 6); instead of providing the corresponding outcoming formulas–which is merely repetitive–we give the illustrative

Example 1.

Based on a sample path observation Xn:={Xℓ:ℓ=1,...,n} of a GWI, which is either governed by a hypothesis law PH or an alternative law PA, we want to make a dichotomous optimal Bayesian decision described in Section 2.5, namely, decide between an action dH “associated with” PH and an action dA “associated with” PA, with pregiven loss function (16) involving constants LA>0, LH>0 which e.g., arise as bounds from quantities in worst-case scenarios.

For this, let us exemplarily deal with initial population X0=5 as well as parameter setup βA,βH,αA,αH=(1.2,0.9,4,3)∈PSP,1; within our running-example epidemiological context of Section 2.3, this corresponds e.g., to a setup where one is encountered with a novel infectious disease (such as COVID-19) of non-negligible fatality rate, and (A) reflects a “potentially dangerous” infectious-disease-transmission situation (with supercritical reproduction number βA=1.2 and importation mean of αA=4, for weekly appearing new incidence-generations) whereas (H) describes a “milder” situation (with subcritical βH=0.9 and αH=3). Moreover, let dH and dA reflect two possible sets of interventions (control measures) in the course of pandemic risk management, with respective “worst-case type” decision losses LA=600 and LH=300 (e.g., in units of billion Euros or U.S. Dollars). Additionally we assume the prior probabilities π=Pr(H)=1−Pr(A)=0.5, which results in the prior-loss constants LA=300 and LH=150. In order to obtain bounds for the corresponding minimal mean decision loss (Bayes Risk) Rn defined in (18) we can employ the general Stummer-Vajda bounds (cf. [15]) (19) and (20) in terms of the Hellinger integral Hλ(PA,n∥PH,n) (with arbitrary λ∈]0,1[), and combine this with the appropriate detailed results on the latter from the preceding subsections. To demonstrate this, let us choose λ=0.5 (for which H1/2(PA,n∥PH,n) can be interpreted as a multiple of the Bhattacharyya coefficient between the two competing GWI) respectively λ=0.9, leading to the parameters p0.5E=3.464,q0.5E=1.039 respectively p0.9E=3.887, q0.9E=1.166 (cf. (33)). Combining (19) and (20) with Theorem 1 (a)– which provides us with the exact recursive values of Hλ(PA,n∥PH,n) in terms of the sequence an(qλE) (cf. (36))– we obtain for λ=0.5 the bounds

Rn≤RnU:=2.121·102·exp5·an(1.039)+103·∑k=1nak(1.039),Rn≥RnL:=100·exp10·an(1.039)+203·∑k=1nak(1.039),

whereas for λ=0.9 we get

Rn≤RnU:=2.799·102·exp5·an(1.166)+103·∑k=1nak(1.166),Rn≥RnL:=3.902·exp50·an(1.166)+1003·∑k=1nak(1.166).

Figure 1 illustrates the lower (orange resp. cyan) and upper (red resp. blue) bounds RnL resp. RnU of the Bayes Risk Rn employing λ=0.5 resp. λ=0.9 on both a unit scale (left graph) and a logarithmic scale (right graph). The lightgrey/grey/black curves correspond to the (18)-based empirical evaluation of the Bayes risk sequence Rnsamplen=1,...,50 from three independent Monte Carlo simulations of 10000 GWI sample paths (each) up to time horizon 50.

Figure 1.

Figure 1

Bayes risk bounds (using λ=0.5 (red/orange) resp. λ=0.9 (blue/cyan)) and Bayes risk simulations (lightgrey/grey/black) on a unit (left graph) and logarithmic (right graph) scale in the parameter setup βA,βH,αA,αH=(1.2,0.9,4,3)∈PSP,1, with initial population X0=5 and prior-loss constants LA=300 and LH=150.

3.15.2. Neyman-Pearson Testing

By combining (23) with the exact values resp. upper bounds of the Hellinger integrals HλPA,n∥PH,n from the preceding subsections, we obtain for our context of GW(I) with Poisson offspring and Poisson immigration (including the non-immigration case) some upper bounds of the minimal type II error probability EςPA,n∥PH,n in the class of the tests for which the type I error probability is at most ς∈]0,1[, which can also be immediately rewritten as lower bounds for the power 1−EςPA,n∥PH,n of a most powerful test at level ς. As for the Bayesian context of Section 3.15.1, instead of providing the–merely repetitive–outcoming formulas for the bounds of EςPA,n∥PH,n we give the illustrative

Example 2.

Consider the Figure 2 and Figure 3 which deal with initial population X0=5 and the parameter setup βA,βH,αA,αH=(0.3,1.2,1,4)∈PSP,1; within our running-example epidemiological context of Section 2.3, this corresponds to a “potentially dangerous” infectious-disease-transmission situation (H) (with supercritical reproduction number βH=1.2 and importation mean of αH=4), whereas (A) describes a “very mild” situation (with “low” subcritical βA=0.3 and αA=1). Figure 2 shows the lower and upper bounds of EςPA,n∥PH,n with ς=0.05, evaluated from the Formulas (23) and (24), together with the exact values of the Hellinger integral HλPA,n∥PH,n, cf. Theorem 1 (recall that we are in the setup PSP,1) on both a unit scale (left graph) and a logarithmic scale (right graph). The orange resp. red resp. purple curves correspond to the outcoming upper bounds EnU:=EnU(PA,n∥PH,n) (cf. (23)) with parameters λ=0.3 resp. λ=0.5 resp. λ=0.7. The green resp. cyan resp. blue curves correspond to the lower bounds EnL:=EnL(PA,n∥PH,n) (cf. (24)) with parameters λ=2 resp. λ=1.5 resp. λ=1.1. Notice the different λ-ranges in (23) and (24). In contrast, Figure 3 compares the lower bound EnL (for fixed λ=1.1) with the upper bound EnU (for fixed λ=0.5) of the minimal type II error probability Eς(PA,n∥PH,n) for different levels ς=0.1 (orange for the lower and cyan for the upper bound), ς=0.05 (green and magenta) and ς=0.01 (blue and purple) on both a unit scale (left graph) and a logarithmic scale (right graph).

Figure 2.

Figure 2

Different lower bounds EnL(using λ∈{1.1,1.5,2}) and upper bounds EnU(using λ∈{0.3,0.5,0.7}) of the minimal type II error probability EςPA,n∥PH,n for fixed level ς=0.05 in the parameter setup βA,βH,αA,αH=(0.3,1.2,1,4)∈PSP,1 together with initial population X0=5 on both a unit scale (left graph) and a logarithmic scale (right graph).

Figure 3.

Figure 3

The lower bound EnL (using λ=1.1) and the upper bound EnU (using λ=0.5) of the minimal type II error probability EςPA,n∥PH,n for different levels ς∈{0.01,0.05,0.1} in the parameter setup βA,βH,αA,αH=(0.3,1.2,1,4)∈PSP,1 together with initial population X0=5 on both a unit scale (left graph) and a logarithmic scale (right graph).

3.16. Goals for Lower Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1])

Recall from (49) the set PSP:=βA,βH,αA,αH∈]0,∞[4:(αA≠αH)or(βA≠βH)orboth and the “equal-fraction-case” set PSP,1:=βA,βH,αA,αH∈PSP:αA≠αH,βA≠βH,αAβA=αHβH, where for the latter we have derived in Theorem 1(a) and in Proposition 5 the exact recursive values for the time-behaviour of the Hellinger integrals Hλ(PA,1∥PH,1) of order λ∈R\[0,1]. Moreover, recall that for the case βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[ we have obtained in the Section 3.4 and Section 3.5 some “optimal” linear lower bounds ϕλL(·) for the strictly concave function ϕλ(x):=ϕ(x,βA,βH,αA,αH,λ) on the domain x∈[0,∞[; due to the monotonicity Properties 2 (P10) to (P12) of the sequences an(qλL)n∈N and bn(pλL,qλL)n∈N, these bounds have led to the “optimal” recursive lower bound Bλ,X0,nL of the Hellinger integral Hλ(PA,n∥PH,n) in (40) of Theorem 1(b)).

In contrast, the strict convexity of the function ϕλ(·) in the case βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1]) implies that we cannot maximize both parameters pλL,qλL∈Rsimultaneously subject to the constraint (35). This effect carries over to the lower bounds Bλ,X0,nL of the Hellinger integrals Hλ(PA,n∥PH,n) (cf. (41)); in general, these bounds cannot be maximized simultaneously for all initial population sizes X0∈N and all observation horizons n∈N.

Analogously to (46), one way to obtain “good” recursive lower bounds for Hλ(PA,n∥PH,n) from (41) in Theorem 1 (b) is to solve the optimization problem,

pλL¯,qλL¯:=argmax(pλL,qλL)∈R2expan(qλL)·X0+∑k=1nbk(pλL,qλL)suchthat(35)issatisfied, (55)

for each fixed initial population size X0∈N and observation horizon n∈N. But due to the same reasons as explained right after (46), the optimization problem (55) seems to be not straightforward to solve explicitly. In a congeneric way as in the discussion of the upper bounds for the case λ∈]0,1[ above, we now have to look for suitable parameters pλL,qλL for the lower bound Bλ,X0,nL≤Hλ(PA,n∥PH,n) that fulfill (35) and that guarantee certain reasonable criteria and goals; these are similar to the goals (G1) to (G3) from Section 3.6, and are therefore supplemented by an additional “ ′ ”:

  • (G1′)

    the validity of Bλ,X0,nL>1 simultaneously for all initial configurations X0∈N, all observation horizons n∈N and all λ∈R\[0,1], which leads to a strict improvement of the general upper bound Hλ(PA,n∥PH,n)>1 (cf. (11));

  • (G2′)

    the determination of the long-term-limits limn→∞Hλ(PA,n∥PH,n) respectively limn→∞Bλ,X0,nL for all X0∈N and all λ∈R\[0,1]; in particular, one would like to check whether limn→∞Hλ(PA,n∥PH,n)=∞;

  • (G3′)

    the determination of the time-asymptotical growth rates limn→∞1nlogHλ(PA,n∥PH,n) resp. limn→∞1nlogBλ,X0,nL for all X0∈N and all λ∈R\[0,1].

In the following, let us briefly discuss how these three goals can be achieved in principle, where we confine ourselves to parameters pλL,qλL which–in addition to (35)–fulfill the requirement

qλL≥max{0,βλ}∧pλL>max{0,αλ}∨qλL>max{0,βλ}∧pλL≥max{0,αλ}, (56)

where ∧ is the logical “AND” and ∨ the logical “OR” operator. This is sufficient to tackle all three Goals (G1′) to (G3′). To see this, assume that pλL,qλL satisfy (35). Let us begin with the two “extremal” cases in (56), i.e., with (i) qλL=max{0,βλ},pλL>max{0,αλ}, respectively (ii) qλL>max{0,βλ},pλL=max{0,αλ}.

Suppose in the first extremal case (i) that βλ≤0. Then, qλL=0 and Properties 1 (P4) implies that an(qλL)=−βλ≥0 and hence bn(pλL,qλL)=pλLe−βλ−αλ≥pλL−αλ>0 for all n∈N. This enters into (41) as follows: the Hellinger integral lower bound becomes Bλ,X0,nL≥B˜λ,X0,n(pλL,qλL)=exp{−βλ·X0+(pλLe−βλ−αλ)·n}>1. Furthermore, one clearly has limn→∞Bλ,X0,nL=∞ as well as limn→∞1nlogBλ,X0,nL=pλLe−βλ−αλ>0. Assume now that βλ>0. Then, qλL=βλ>0, an(qλL)=0 (cf. (P2)), bn(pλL,qλL)=pλL−αλ>0 and thus Bλ,X0,nL=exp{(pλL−αλ)·n}>1 for all n∈N. Furthermore, one gets limn→∞Bλ,X0,nL=∞ as well as limn→∞1nlogBλ,X0,nL=pλL−αλ>0.

Let us consider the other above-mentioned extremal case (ii). Suppose that qλL>max{0,βλ} together with qλL>min{1,eβλ−1} which implies that the sequence an(qλL)n∈N is strictly positive, strictly increasing and grows to infinity faster than exponentially, cf. (P3b). Hence, Bλ,X0,nL≥exp{an(qλL)·X0}>1, limn→∞Bλ,X0,nL=∞ as well as limn→∞1nlogBλ,X0,nL=∞. If max{0,βλ}<qλL≤min{1,eβλ−1}, then an(qλL)n∈N is strictly positive, strictly increasing and converges to x0(qλ)∈]0,−log(qλL)] (cf. (P3a)). This carries over to the sequence bn(pλL,qλL)n∈N: one gets b1(pλL,qλL)=pλL−αλ≥0 and bn(pλL,qλL)>0 for all n≥2. Furthermore, bn(pλL,qλL) is strictly increasing and converges to pλL·ex0(qλL)−αλ>0, leading to Bλ,X0,nL>1 for all n∈N, to limn→∞Bλ,X0,nL=∞ as well as to limn→∞1nlogBλ,X0,nL=pλL·ex0(qλL)−αλ>0.

It remains to look at the cases where pλL,qλL satisfy (35), and (56) with two strict inequalities. For this situation, one gets

  • an(qλL)n∈N is strictly positive, strictly increasing and–iff qλL≤min{1,eβλ−1}–convergent (namely to the smallest positive solution x0(qλL)∈]0,−log(qλL)] of (44)), cf. (P3);

  • bn(pλL,qλL)n∈N is strictly increasing, strictly positive (since b1(pλL,qλL)=pλL−αλ>0) and–iff qλL≤min{1,eβλ−1}–convergent (namely to pλLex0(qλL)−αλ∈[pλL−αλ,pλL/qλL−αλ]), cf (P7).

Hence, under the assumptions (35) and pλL>max{0,αλ}∧qλL>max{0,βλ} the corresponding lower bounds Bλ,X0,nL of the Hellinger integral Hλ(PA,n∥PH,n) fulfill for all X0∈N

  • Bλ,X0,nL>1 for all n∈N,

  • limn→∞Bλ,X0,nL=∞,

  • limn→∞1nlogBλ,X0,nL=pλLex0(qλL)−αλ>0 for the case qλL∈]max{0,βλ},min{1,eβλ−1}], respectively limn→∞1nlogBλ,X0,nL=∞ for the remaining case qλL>min{1,eβλ−1}.

Putting these considerations together we conclude that the constraints (35) and (56) are sufficient to achieve the Goals (G1′) to (G3′). Hence, for fixed parameter constellation βA,βH,αA,αH,λ, we aim for finding pλL=pLβA,βH,αA,αH,λ and qλL=qLβA,βH,αA,αH,λ which satisfy (35) and (56). This can be achieved mostly, but not always, as we shall show below. As an auxiliary step for further investigations, it is useful to examine the set of all λ∈R\[0,1] for which αλ≤0 or βλ≤0 (or both). By straightforward calculations, we see that

αλ≤0⟺λ≤−αHαA−αH,ifαA>αH,≥αHαH−αA,ifαA<αH,andβλ≤0⟺λ≤−βHβA−βH,ifβA>βH,≥βHβH−βA,ifβA<βH. (57)

Furthermore, recall that (35) implies the general bounds pλL≤αAλαH1−λ=φλ(0) (being equivalent to the requirement ϕλL(0)=ϕλ(0)) and qλL≤βAλβH1−λ=q˜λ (the latter being the maximal slope due to Properties 3 (P19), (P20)).

Let us now undertake the desired detailed investigations on lower and upper bounds of the Hellinger integrals Hλ(PA,n∥PH,n) of order λ∈R\[0,1], for the various different subclasses of PSP\PSP,1.

3.17. Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,2×(R\[0,1])

In such a constellation, where PSP,2:=βA,βH,αA,αH∈PSP:αA=αH,βA≠βH (cf. (49)), one gets ϕλ(0)=0 (cf. Properties 3 (P16)), ϕλ′(0)=0 (cf. (P17)). Thus, the only choice for the intercept and the slope of the linear lower bound ϕλL(·) for ϕλ(·), which satisfies (35) for all x∈N and (potentially) (56), is rλL=0=pλL−αλ (i.e., pλL=αλ=α>0) and sλL=ϕλ(1)−ϕλ(0)1−0=qλL−βλ=a1(qλL)>0 (i.e., qλL=(α+βA)λ(α+βH)1−λ−α). However, since pλL=αλ=α>0, the restriction (56) is fulfilled iff qλL>0, which is equivalent to

λ∈ISP,2:=]logαα+βHlogα+βAα+βH,0∪1,∞[,ifβA>βH,]−∞,0∪1,logαα+βHlogα+βAα+βH[,ifβA<βH. (58)

Suppose that λ∈ISP,2. As we have seen above, from Properties 1 (P3a) and (P3b) one can derive that an(qλL)n∈N is strictly positive, strictly increasing, and converges to x0(qλL)∈]0,−log(qλL)] iff qλL≤min{1,eβλ−1}, and otherwise it diverges to ∞. Notice that both cases can occur: consider the parameter setup βA,βH,αA,αH=(1.5,0.5,0.5,0.5)∈PSP,2, which leads to ISP,2=]−1,0[∪]1,∞[; within our running-example epidemiological context of Section 2.3, this corresponds to a “mild” infectious-disease-transmission situation (H) (with “low” reproduction number βH=0.5 and importation mean of αH=0.5), whereas (A) describes a “dangerous” situation (with supercritical βA=1.5 and αA=0.5). For λ=−0.5∈ISP,2 one obtains qλL≈0.207≤min{1,eβλ−1}≈0.368, whereas for λ=2∈ISP,2 one gets qλL=3.5>min{1,eβλ−1}=1. Altogether, this leads to

Proposition 11.

For all βA,βH,αA,αH,λ∈PSP,2×ISP,2 and all initial population sizes X0∈N there holds with pλL=αA=αH=α,qλL=(α+βA)λ(α+βH)1−λ−α

(a)Bλ,X0,1L=B˜λ,X0,1(pλL,qλL)=expqλL−βλ·X0>1,(b)thesequenceBλ,X0,nLn∈NoflowerboundsforHλ(PA,n∥PH,n)givenbyBλ,X0,nL=B˜λ,X0,n(pλL,qλL)=expan(qλL)·X0+∑k=1nbk(pλL,qλL)isstrictlyincreasing,(c)limn→∞Bλ,X0,nL=∞=limn→∞Hλ(PA,n∥PH,n),(d)limn→∞1nlogBλ,X0,nL=pλL·expx0(qλL)−α>0,ifqλL≤min1,eβλ−1,∞,ifqλL>min1,eβλ−1,(e)themapX0↦Bλ,X0,nL=B˜λ,X0,n(pλL,qλL)isstrictlyincreasing.

Nevertheless, for the remaining constellations βA,βH,αA,αH,λ∈PSP,2×R\ISP,2∪[0,1], all observation time horizons n∈N and all initial population sizes X0∈N one can still prove

1<HλPA,n∥PH,nandlimn→∞HλPA,n∥PH,n=∞, (59)

(i.e., the achievement of the Goals (G1′), (G2′)), which is done by a conceptually different method (without involving pλL,qλL) in Appendix A.1.

3.18. Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3a×(R\[0,1])

In the current setup, where PSP,3a:=βA,βH,αA,αH∈PSP:αA≠αH,βA≠βH,αAβA≠αHβH,αA−αHβH−βA∈]−∞,0[ (cf. (49)), we always have either (αA>αH)∧(βA>βH) or (αA<αH)∧(βA<βH). Furthermore, from Properties 3 (P16) we obtain ϕλ(0)>0. As in the case λ∈]0,1[, the derivative ϕλ′(0) can assume any sign on PSP,3a, take e.g., βA,βH,αA,αH,λ=(2.2,4.5,1,3,2) for ϕλ′(0)<0, βA,βH,αA,αH,λ=(2.25,4.5,1,3,2) for ϕλ′(0)=0 and βA,βH,αA,αH,λ=(2.3,4.5,1,3,2) for ϕλ′(0)>0 (these parameter constellations reflect “dangerous” (A) versus “highly dangerous” (H) situations within our running-example epidemiological context of Section 2.3). Nevertheless, in all three subcases one gets minx∈N0ϕλ(x)≥minx≥0ϕλ(x)>0. Thus, there exist parameters pλL∈]αλ,αAλαH1−λ] and qλL∈]βλ,βAλβH1−λ] which satisfy (35) (in particular, pλL−αλ>0,qλL−βλ>0). We now have to look for a condition which guarantees that these parameters additionally fulfill (56); such a condition is clearly that both αλ≥0 and βλ≥0 hold, which is equivalent (cf. (57)) with

λ∈ISP,3a(≥):=[max−αHαA−αH,−βHβA−βH,0∪1,∞[,if(αA>αH)∧(βA>βH),−∞,0∪1,minαHαH−αA,βHβH−βA,if(αA<αH)∧(βA<βH);

recall that αλ=0 and βλ=0 cannot occur simultaneously in the current setup. If αλ≤0 and βλ≤0, i.e., if

λ∈ISP,3a(<):=]−∞,min−αHαA−αH;−βHβA−βH],if(αA>αH)∧(βA>βH),[maxαHαH−αA;βHβH−βA,∞[,if(αA<αH)∧(βA<βH),

then–due to the strict positivity of the function φλ(·) (cf. (31))–there exist parameters pλL>0=max{0,αλ} and qλL>0=max{0,βλ} which satisfy (56) and (34) (where the latter implies (35) and thus pλL≤αAλαH1−λ,qλL≤βAλβH1−λ). With

ISP,3a:=ISP,3a(≥)∪ISP,3a(<) (60)

and with the discussion below (56), we thus derive the following

Proposition 12.

For all βA,βH,αA,αH,λ∈PSP,3a×ISP,3a there exist parameters pλL,qλL which satisfy max{0,αλ}<pλL≤αAλαH1−λ,max{0,βλ}<qλL≤βAλβH1−λ as well as (35) for all x∈N0, and for all such pairs (pλL,qλL) and all initial population sizes X0∈N one gets

(a)Bλ,X0,1L=B˜λ,X0,1(pλL,qλL)=expqλL−βλ·X0+pλL−αλ>1,(b)thesequenceBλ,X0,nLn∈NoflowerboundsforHλ(PA,n∥PH,n)givenbyBλ,X0,nL=B˜λ,X0,n(pλL,qλL)=expan(qλL)·X0+∑k=1nbk(pλL,qλL)isstrictlyincreasing,(c)limn→∞Bλ,X0,nL=∞=limn→∞Hλ(PA,n∥PH,n),(d)limn→∞1nlogBλ,X0,nL=pλL·expx0(qλL)−αλ>0,ifqλL≤min1,eβλ−1,∞,ifqλL>min1,eβλ−1,(e)themapX0↦Bλ,X0,nL=B˜λ,X0,n(pλL,qλL)isstrictlyincreasing.

Notice that the assertions (a) to (e) of Proposition 12 hold true for parameter pairs (pλL,qλL) whenever they satisfy (35) and (56); in particular, we may allow either pλL=max{0,αλ} or qλL=max{0,βλ}. Let us furthermore mention that in part (d) both asymptotical behaviours can occur: consider e.g., the parameter setup βA,βH,αA,αH=(0.3,0.2,4,3)∈PSP,3a, leading to ]1,∞[⊊ISP,3a(≥)⊊ISP,3a. For λ=2∈ISP,3a, the parameters pλL:=p˜λ:=5.25,qλL:=q˜λ:=0.45 (corresponding to the asymptote ϕ˜λ(·), cf. (P20)) fulfill (35), (56) and additionally qλL=0.45<min{1,eβλ−1}≈0.549. Analogously, in the setup βA,βH,αA,αH,λ=(3,2,4,3,2)∈PSP,3a×ISP,3a, the choices pλL:=p˜λ:=5.25,qλL:=q˜λ:=4.5 satisfy (35), (56) and there holds qλL=4.5>min{1,eβλ−1}=1.

For the remaining two cases (αλ≤0)∧(βλ>0) (e.g., βA,βH,αA,αH,λ=(6,5,3,2,−3)) and (αλ>0)∧(βλ≤0) (e.g., βA,βH,αA,αH,λ=(3,2,6,5,−3)), one has to proceed differently. Indeed, for all parameter constellations βA,βH,αA,αH,λ∈PSP,3a×R\ISP,3a∪[0,1], all observation time horizons n∈N and all initial population sizes X0∈N one can still prove

1<HλPA,n∥PH,n,andlimn→∞HλPA,n∥PH,n=∞, (61)

which is done in Appendix A.1, using a similar method as in the proof of assertion (59).

3.19. Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3b×(R\[0,1])

Within such a constellation, where PSP,3b:=βA,βH,αA,αH∈PSP:αA≠αH,βA≠βH,αAβA≠αHβH,αA−αHβH−βA∈]0,∞[\N (cf. (49)), one always has either (αA<αH)∧(βA>βH) or (αA>αH)∧(βA<βH). Moreover, from Properties 3 (P15) one can see that ϕλ(x)=0 for x=x*=αH−αAβA−βH>0. However, x*∉N0, which implies ϕλ(x)>0 for all x on the relevant subdomain N0. Again, we incorporate (57) and consider the set of all λ∈R\[0,1] such that αλ≥0 and βλ≥0 (where αλ=0∧βλ=0 cannot appear), i.e.,

λ∈ISP,3b(≥):=−βHβA−βH,0∪1,αHαH−αA,if(αA<αH)∧(βA>βH),−αHαA−αH,0∪1,βHβH−βA,if(αA>αH)∧(βA<βH). (62)

As above in Section 3.18, if λ∈ISP,3b(≥) then there exist parameters pλL∈]αλ,αAλαH1−λ], qλL∈]βλ,βAλβH1−λ] (which thus fulfill (56)) such that (35) is satisfied for all x∈N0. Hence, for all λ∈ISP,3b:=ISP,3b(≥), all assertions (a) to (e) of Proposition 12 hold true. Notice that for the current setup PSP,3b one cannot have αλ≤0 and βλ≤0 simultaneously. Furthermore, in each of the two remaining cases (αλ<0)∧(βλ>0) respectively (αλ>0)∧(βλ<0) it can happen that there do not exist parameters pλL,qλL>0 which satisfy both (35) and (56). However, as in the case PSP,3a above, for all λ∉ISP,3b we prove in Appendix A.1 (by a method without pλL,qλL) that for all observation times n∈N and all initial population sizes X0∈N there holds

1<HλPA,n∥PH,nandlimn→∞HλPA,n∥PH,n=∞. (63)

3.20. Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,3c×(R\[0,1])

Since in this subcase one has PSP,3c:=βA,βH,αA,αH∈PSP:αA≠αH,βA≠βH,αAβA≠αHβH,αA−αHβH−βA∈N (cf. (49)) and thus ϕλ(x*)=0 for x*∈N, there do not exist parameters pλL,qλL such that (35) and (56) are satisfied. The only parameter pair that ensures expan(qλL)·X0+∑k=1nbk(pλL,qλL)≥1 for all n∈N and all X0∈N within our proposed method, is the choice pλL=αλ,qλL=βλ. Consequently, Bλ,X0,nL≡1, which coincides with the general lower bound (11) but violates the above-mentioned desired Goal (G1′). However, in some constellations there exist nonnegative parameters pλL<αλ,qλL>βλ or pλL>αλ,qλL<βλ, such that at least the parts (c) and (d) of Proposition 12 are satisfied. As in Section 3.19 above, by using a conceptually different method (without pλL,qλL) we prove in Appendix A.1 that for all λ∈R\[0,1], all observation times n∈N and all initial population sizes X0∈N there holds

1<HλPA,n∥PH,nandlimn→∞HλPA,n∥PH,n=∞. (64)

3.21. Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,4a×(R\[0,1])

In the current setup, where PSP,4a:=βA,βH,αA,αH∈PSP:αA≠αH>0,βA=βH∈]0,1[ (cf. (49)), the function ϕλ(·) is strictly positive and strictly decreasing, with limx→∞ϕλ(x)=limx→∞ϕλ′(x)=0. The only choice of parameters pλL,qλL which fulfill (35) and expan(qλL)·X0+∑k=1nbk(pλL,qλL)≥1 for all n∈N and all X0∈N, is the choice pλL=αλ as well as qλL=βλ=β•, where β• stands for both (equal) βH and βA. Of course, this leads to Bλ,X0,nL≡1, which is consistent with the general lower bound (11), but violates the above-mentioned desired Goal (G1′). Nevertheless, in Appendix A.1 we prove the following

Proposition 13.

For all βA,βH,αA,αH,λ∈PSP,4a×R\[0,1] there exist parameters pλL>αλ (not necessarily satisfying pλL≥0) and 0<qλL<βλ=β•<min{1,eβ•−1}=eβ•−1 such that (35) holds for all x∈[0,∞[ and such that for all initial population sizes X0∈N the parts (c) and (d) of Proposition 12 hold true.

3.22. Lower Bounds for the Cases βA,βH,αA,αH,λ∈PSP,4b×(R\[0,1])

By recalling PSP,4b:=βA,βH,αA,αH∈PSP:αA≠αH>0,βA=βH∈[1,∞[ (cf.(49)), the assertions preceding Proposition 13 remain valid. However, the proof of Proposition 13 in Appendix A.1 contains details which explain why it cannot be carried over to the current case PSP,4b. Thus, the generally valid lower bound Bλ,X0,nL≡1 cannot be improved with our methods.

3.23. Concluding Remarks on Alternative Lower Bounds for all Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1])

To achieve the Goals (G1′) to (G3′), in the above-mentioned investigations about lower bounds of the Hellinger integral Hλ(PA,n∥PH,n), λ∈R\[0,1], we have mainly focused on parameters pλL,qλL which satisfy (35) and additionally (56). Nevertheless, Theorem 1 (b) gives lower bounds Bλ,X0,nLwhenever (35) is fulfilled. However, this lower bound can be the trivial one, Bλ,X0,nL≡1. Let us remark here that for the parameter constellations βA,βH,αA,αH,λ∈PSP,2×R\[0,1]∪ISP,2∪PSP,3a×R\[0,1]∪ISP,3a∪PSP,3b×R\[0,1]∪ISP,3b one can prove that there exist pλL,qλL which satisfy (35) for all x∈N0 as well as the condition (generalizing (56))

pλL≥αλ,qλL≥βλ,(whereatleastoneoftheinequalitiesisstrict),

and that for such pλL,qλL one gets the validity of Hλ(PA,n∥PH,n)≥Bλ,X0,nL=B˜λ,X0,n(pλL,qλL)>1 for all X0∈N and all n∈N; consequently, Goal (G1′) is achieved. However, in these parameter constellations it can unpleasantly happen that n↦Bλ,X0,nL is oscillating (in contrast to the monotone behaviour in the Propositions 11 (b), 12 (b)).

As a final general remark, let us mention that the functions ϕλ,ytan(·), ϕλ,ksec(·), ϕλhor(·), ϕλ˜(·) –defined in (52)–(54) and Properties 3 (P20)–constitute linear lower bounds for ϕλ(·) on the domain N0 in the case λ∈R\[0,1]. Their parameters pλL∈pλ,ytan,pλ,ysec,pλ,yhor,pλ˜ and qλL∈qλ,ytan,qλ,ysec,qλ,yhor,qλ˜ lead to lower bounds Bλ,X0,nL of the Hellinger integrals that may or may not be consistent with Goals (G1′) to (G3′), and which may be possibly better respectively weaker respectively incomparable with the previous lower bounds when adding some relaxation of (G1′), such as e.g., the validity of Hλ(PA,n∥PH,n)>1 for all but finitely many n∈N.

3.24. Upper Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1])

For the cases λ∈R\[0,1], the investigation of upper bounds for the Hellinger integral Hλ(PA,n∥PH,n) is much easier than the above-mentioned derivations of lower bounds. In fact, we face a situation which is similar to the lower-bounds-studies for the cases λ∈]0,1[: due to Properties 3 (P19), the function ϕλ(·) is strictly convex on the nonnegative real line. Furthermore, it is asymptotically linear, as stated in (P20). The monotonicity Properties 2 (P10) to (P12) imply that for the tightest upper bound (within our framework) one should use the parameters pλU:=αAλαH1−λ>0 and qλU:=βAλβH1−λ>0. Lemma A1 states that pλU≥αλ resp. qλU≥βλ, with equality iff αA=αH resp. iff βA=βH. From Properties 1 (P3a) we see that for βA≠βH the corresponding sequence an(qλU)n∈N is convergent to x0(qλU)∈]0,−log(qλU)] if qλU≤min{1,eβλ−1} (i.e., if λ∈[λ−,λ+], cf. Lemma 1 (a)), and otherwise it diverges to ∞ faster than exponentially (cf. (P3b)). If βA=βH (i.e., if βA,βH,αA,αH∈PSP,4=PSP,4a∪PSP,4b), then one gets qλU=βλ and an(qλU)=0=x0(qλU) for all n∈N (cf. (P2)). Altogether, this leads to

Proposition 14.

For all βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1]) and all initial population sizes X0∈N there holds with pλU:=αAλαH1−λ,qλU:=βAλβH1−λ

(a)Bλ,X0,1U=B˜λ,X0,1(pλU,qλU)=expβAλβH1−λ−βλ·X0+αAλαH1−λ−αλ>1,(b)thesequenceBλ,X0,nUn∈NofupperboundsforHλ(PA,n∥PH,n)givenbyBλ,X0,nU=B˜λ,X0,n(pλU,qλU)=expan(qλU)·X0+∑k=1nbk(pλU,qλU)isstrictlyincreasing,(c)limn→∞Bλ,X0,nU=∞,(d)limn→∞1nlogBλ,X0,nU=pλU·expx0(qλU)−αλ>0,ifλ∈[λ−,λ+]\[0,1],∞,ifλ∈]−∞,λ−[∪]λ+,∞[,(e)themapX0↦Bλ,X0,nU=B˜λ,X0,n(pλU,qλU)isstrictlyincreasing.

4. Power Divergences of Non-Kullback-Leibler-Information-Divergence Type

4.1. A First Basic Result

For orders λ∈R\{0,1}, all the results of the previous Section 3 carry correspondingly over from the Hellinger integrals Hλ(·∥·) to the total variation distance V(·||·), by virtue of the relation (cf. (12))

21−H12(PA,n∥PH,n)≤V(PA,n∥PH,n)≤21−H12(PA,n∥PH,n)2,

to the Renyi divergences Rλ(·∥·), by virtue of the relation (cf. (7))

0≤RλPA,n∥PH,n=1λ(λ−1)logHλPA,n∥PH,n,withlog0:=−∞,

as well as to the power divergences Iλ·∥·, by virtue of the relation (cf. (2))

IλPA,n∥PH,n=1−Hλ(PA,n∥PH,n)λ·(1−λ),n∈N;

in the following, we concentrate on the latter. In particular, the above-mentioned carrying-over procedure leads to bounds on IλPA∥PH which are tighter than the general rudimentary bounds (cf. (10) and (11))

0≤IλPA,n∥PH,n<1λ(1−λ),forλ∈]0,1[,0≤IλPA,n∥PH,n≤∞,forλ∈R\[0,1].

Because power divergences have a very insightful interpretation as “directed distances” between two probability distributions (e.g., within our running-example epidemiological context), and function as important tools in statistics, information theory, machine learning, and artificial intelligence, we present explicitly the outcoming exact values respectively bounds of IλPA∥PH (λ∈R\{0,1}, n∈N), in the current and the following subsections. For this, recall the case-dependent parameters pA=pλA=pAβA,βH,αA,αH,λ and qA=qλA=qAβA,βH,αA,αH,λ (A∈{E,L,U}). To begin with, we can deduce from Theorem 1

Theorem 2.

  • (a) 
    For all βA,βH,αA,αH∈(PNI∪PSP,1), all initial population sizes X0∈N0, all observation horizons n∈N and all λ∈R\{0,1} one can recursively compute the exact value
    Iλ(PA,n∥PH,n)=1λ(λ−1)·expan(qλE)·X0+αAβA∑k=1nak(qλE)−1=:Vλ,X0,nI, (65)
    where αAβA can be equivalently replaced by αHβH and qλE:=βAλβH1−λ. Notice that on PNI the formula (65) simplifies significantly, since αA=αH=0.
  • (b) 
    For general parameters p∈R, q≠0 recall the general expression (cf. (42))
    B˜λ,X0,n(p,q):=expan(q)·X0+pq∑k=1nak(q)+n·pqβλ−αλ
    as well as
    B˜λ,X0,n(p,0):=exp−βλ·X0+p·e−βλ−αλ·n.
    Then, for all βA,βH,αA,αH∈PSP\PSP,1, all λ∈R\{0,1}, all coefficients pλL,pλU,qλL,qλU∈R which satisfy (35) for all x∈N0, all initial population sizes X0∈N and all observation horizons n∈N one gets the following recursive bounds for the power divergences: for λ∈]0,1[ there holds
    Iλ(PA,n∥PH,n)<1λ(1−λ)·1−Bλ,X0,nL=1λ(1−λ)·1−B˜λ,X0,n(pλL,qλL)=:Bλ,X0,nI,U,≥1λ(1−λ)·1−Bλ,X0,nU=1λ(1−λ)·1−minB˜λ,X0,n(pλU,qλU),1=:Bλ,X0,nI,L,
    whereas for λ∈R\[0,1] there holds
    Iλ(PA,n∥PH,n)<1λ(λ−1)·Bλ,X0,nU−1=1λ(λ−1)·B˜λ,X0,n(pλU,qλU)−1=:Bλ,X0,nI,U,≥1λ(λ−1)·Bλ,X0,nL−1=1λ(λ−1)·maxB˜λ,X0,n(pλL,qλL),1−1=:Bλ,X0,nI,L.

In order to deduce the subsequent detailed recursive analyses of power divergences, we also employ the obvious relations

limn→∞1nlog1λ(1−λ)−Iλ(PA,n∥PH,n)=limn→∞1n−logλ(1−λ)+logHλ(PA,n∥PH,n)=limn→∞1nlogHλ(PA,n∥PH,n),forλ∈]0,1[, (66)

as well as

limn→∞1nlogIλ(PA,n∥PH,n)=limn→∞1n−logλ(λ−1)+logHλ(PA,n∥PH,n)−1=limn→∞1nlog1−1Hλ(PA,n||PH,n)+logHλ(PA,n∥PH,n)=limn→∞1nlogHλ(PA,n∥PH,n), (67)

for λ∈R\[0,1] (provided that lim infn→∞Hλ(PA,n∥PH,n)>1).

4.2. Detailed Analyses of the Exact Recursive Values of Iλ(·∥·), i.e., for the Cases βA,βH,αA,αH,λ∈(PNI∪PSP,1)×(R\{0,1})

Corollary 2.

For all βA,βH,αA,αH,λ∈PNI×]0,1[ and all initial population sizes X0∈N there holds with qλE:=βAλβH1−λ

(a)Iλ(PA,1∥PH,1)=1λ(1−λ)·1−expβAλβH1−λ−βλ·X0>0,(b)thesequenceIλ(PA,n∥PH,n)n∈NgivenbyIλ(PA,n∥PH,n)=1λ(1−λ)·1−expan(qλE)·X0=:Vλ,X0,nIisstrictlyincreasing,(c)limn→∞Iλ(PA,n∥PH,n)=1λ(1−λ)·1−expx0(qλE)·X0∈]0,1λ(1−λ)[,(d)limn→∞1nlog1λ(1−λ)−Iλ(PA,n∥PH,n)=limn→∞1nlogHλ(PA,n∥PH,n)=0,(e)themapX0↦Vλ,X0,nIisstrictlyincreasing.

Corollary 3.

For all βA,βH,αA,αH,λ∈PNI×(R\[0,1]) and all initial population sizes X0∈N there holds with qλE:=βAλβH1−λ

(a)Iλ(PA,1∥PH,1)=1λ(λ−1)·expβAλβH1−λ−βλ·X0−1>0,(b)thesequenceIλ(PA,n∥PH,n)n∈NgivenbyIλ(PA,n∥PH,n)=1λ(λ−1)·expan(qλE)·X0−1=:Vλ,X0,nIisstrictlyincreasing,(c)limn→∞Iλ(PA,n∥PH,n)=1λ(λ−1)·expx0(qλE)·X0−1>0,ifλ∈[λ−,λ+]\[0,1],∞,ifλ∈]−∞,λ−[∪]λ+,∞[,(d)limn→∞1nlogIλ(PA,n∥PH,n)=0,ifλ∈[λ−,λ+]\[0,1],∞,ifλ∈]−∞,λ−[∪]λ+,∞[,(e)themapX0↦Vλ,X0,nIisstrictlyincreasing.

Corollary 4.

For all βA,βH,αA,αH,λ∈PSP,1×]0,1[ and all initial population sizes X0∈N there holds with qλE:=βAλβH1−λ

(a)Iλ(PA,1∥PH,1)=1λ(1−λ)·1−expβAλβH1−λ−βλ·X0+αAβA>0,(b)thesequenceIλ(PA,n∥PH,n)n∈NgivenbyIλ(PA,n∥PH,n)=1λ(1−λ)·1−expan(qλE)·X0+αAβA∑k=1nak(qλE)=:Vλ,X0,nIisstrictlyincreasing,(c)limn→∞Iλ(PA,n∥PH,n)=1λ(1−λ),(d)limn→∞1nlog1λ(1−λ)−Iλ(PA,n∥PH,n)=αAβA·x0(qλE)<0,(e)themapX0↦Vλ,X0,nIisstrictlyincreasing.

Corollary 5.

For all βA,βH,αA,αH,λ∈PSP,1×(R\[0,1]) and all initial population sizes X0∈N there holds with qλE:=βAλβH1−λ

(a)Iλ(PA,1∥PH,1)=1λ(λ−1)·expβAλβH1−λ−βλ·X0+αAβA−1>0,(b)thesequenceIλ(PA,n∥PH,n)n∈NgivenbyIλ(PA,n∥PH,n)=1λ(λ−1)·expan(qλE)·X0+αAβA∑k=1nak(qλE)−1=:Vλ,X0,nIisstrictlyincreasing,(c)limn→∞Iλ(PA,n∥PH,n)=∞,(d)limn→∞1nlogIλ(PA,n∥PH,n)=αAβA·x0(qλE)>0,ifλ∈[λ−,λ+]\[0,1],∞,ifλ∈]−∞,λ−[∪]λ+,∞[,(e)themapX0↦Vλ,X0,nIisstrictlyincreasing.

In the assertions (a), (b), (d) of the Corollaries 4 and 5 the fraction αA/βA can be equivalently replaced by αH/βH.

Let us now derive the corresponding detailed results for the bounds of the power divergences for the parameter cases PSP\PSP,1, where the Hellinger integral, and thus Iλ(PA,n∥PH,n), cannot be determined exactly. The extensive discussion on the Hellinger-integral bounds in the Section 3.4, Section 3.5, Section 3.6, Section 3.7, Section 3.8, Section 3.9, Section 3.10, Section 3.11, Section 3.12 and Section 3.13, as well as in the Section 3.16, Section 3.17, Section 3.18, Section 3.19, Section 3.20, Section 3.21, Section 3.22, Section 3.23 and Section 3.24 can be carried over directly to obtain power-divergence bounds. In the following, we summarize the outcoming key results, referring a detailed discussion on the possible choices of pλA=pAβA,βH,αA,αH,λ and qλA=qAβA,βH,αA,αH,λ (A∈{L,U}) to the corresponding above-mentioned subsections.

4.3. Lower Bounds of Iλ(·∥·) for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[

Corollary 6.

For all βA,βH,αA,αH,λ∈(PSP,2∪PSP,3a∪PSP,3b)×]0,1[ there exist parameters pλU,qλU which satisfy pλU∈αAλαH1−λ,αλ and qλU∈[βAλβH1−λ,βλ[ as well as (35) for all x∈N0, and for all such pairs (pλU,qλU) and all initial population sizes X0∈N there holds

(a)Bλ,X0,1I,L=1λ(1−λ)·1−expqλU−βλ·X0+pλU−αλ>0,(b)thesequenceBλ,X0,nI,Ln∈NoflowerboundsforIλ(PA,n∥PH,n)givenbyBλ,X0,nI,L=1λ(1−λ)·1−expan(qλU)·X0+∑k=1nbk(pλU,qλU)isstrictlyincreasing,(c)limn→∞Bλ,X0,nI,L=limn→∞Iλ(PA,n∥PH,n)=1λ(1−λ),(d)limn→∞1nlog1λ(1−λ)−Bλ,X0,nI,L=pλU·ex0(qλU)−αλ<0,(e)themapX0↦Bλ,X0,nI,Lisstrictlyincreasing.

Remark 4.

  • (a) 

    Notice that in the case βA,βH,αA,αH,λ∈PSP,2×]0,1[–where αAλαH1−λ=αλ=αA=αH=α–we get the special choice pλU=α and qλU=(α+βA)λ(α+βH)1−λ−α (cf. Section 3.7). For the constellations βA,βH,αA,αH,λ∈(PSP,3a∪PSP,3b)×]0,1[ there exist parameters pλU∈[αAλαH1−λ,αλ[, qλU∈[βAλβH1−λ,βλ[ which satisfy (35) for all x∈N0.

  • (b) 

    For the parameter setups βA,βH,αA,αH,λ∈(PSP,2∪PSP,3a∪PSP,3b)×]0,1[ there might exist parameter pairs (pλU,qλU) satisfying (35) and either pλU=αλ or qλU=βλ, for which all assertions of Corollary 6 still hold true.

  • (c) 

    Following the discussion in Section 3.10 for all βA,βH,αA,αH,λ∈PSP,3c×]0,1[ at least part (c) still holds true.

Corollary 7.

For all βA,βH,αA,αH,λ∈PSP,4a×]0,1[ there exist parameters pλU<αλ, 1>qλU>βλ=β such that (35) is satisfied for all x∈[0,∞[ and such that for all initial population sizes X0∈N at least the parts (c) and (d) of Corollary 6 hold true.

As in Section 3.12, for the parameter setup βA,βH,αA,αH,λ∈PSP,4b×]0,1[ we cannot derive a lower bound for the power divergences which improves the generally valid lower bound Iλ(PA,n∥PH,n)≥0 (cf. (10)) by employing our proposed (pλU,qλU)-method.

4.4. Upper Bounds of Iλ(·∥·) for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[

Since in this setup the upper bounds of the power divergences can be derived from the lower bounds of the Hellinger integrals, we here appropriately adapt the results of Proposition 6.

Corollary 8.

For all βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[ and all initial population sizes X0∈N there holds with pλL:=αAλαH1−λ and qλL:=βAλβH1−λ

(a)Bλ,X0,1I,U=1λ(1−λ)·1−expβAλβH1−λ−βλ·X0+αAλαH1−λ−αλ>0,(b)thesequenceofupperboundsBλ,X0,nI,Un∈NforIλ(PA,n∥PH,n)givenbyBλ,X0,nI,U=1λ(1−λ)·1−expan(qλL)·X0+pλLqλL∑k=1nak(qλL)+n·pλLqλL·βλ−αλisstrictlyincreasing,(c)limn→∞Bλ,X0,nI,U=1λ(1−λ),(d)limn→∞1nlog1λ(1−λ)−Bλ,X0,nI,U=pλLqλL·x0(qλL)+βλ−αλ=pλL·ex0(qλL)−αλ<0,(e)themapX0↦Bλ,X0,nI,Uisstrictlyincreasing.

4.5. Lower Bounds of Iλ(·∥·) for the Cases (βA,βH,αA,αH,λ)∈(PSP\PSP,1)×(R\[0,1])

In order to derive detailed results on lower bounds of the power divergences in the case λ∈R\[0,1], we have to subsume and adapt the Hellinger-integral concerning lower-bounds investigations from the Section 3.16, Section 3.17, Section 3.18, Section 3.19, Section 3.20, Section 3.21, Section 3.22 and Section 3.23. Recall the λ-sets ISP,2,ISP,3a,ISP,3b (cf. (58), (60), (62)). For the constellations PSP,2×ISP,2 we employ the special choice pλL=αAλαH1−λ=αλ=αA=αH=α together with qλL=(α+βA)λ(α+βH)1−λ−α>max{0,βλ} (cf. (58)) which satisfy (35) for all x∈N0 and (56), whereas for the constellations (PSP,3a×ISP,3a) ∪(PSP,3b×ISP,3b) we have proved the existence of parameters pλL,qλL satisfying both (35) for all x∈N0 and (56) with two strict inequalities. Subsuming this, we obtain

Corollary 9.

For all βA,βH,αA,αH,λ∈(PSP,2×ISP,2)∪(PSP,3a×ISP,3a)∪(PSP,3b×ISP,3b) there exist parameters pλL,qλL which satisfy max{0,αλ}≤pλL≤αAλαH1−λ,max{0,βλ}<qλL≤βAλβH1−λ as well as (35) for all x∈N0, and for all such pairs (pλL,qλL) and all initial population sizes X0∈N one gets

(a)Bλ,X0,1I,L=1λ(λ−1)·expqλL−βλ·X0+pλL−αλ−1>0,(b)thesequenceBλ,X0,nI,Ln∈NoflowerboundsforIλ(PA,n∥PH,n)givenbyBλ,X0,nI,L=1λ(λ−1)·expan(qλL)·X0+∑k=1nbk(pλL,qλL)−1isstrictlyincreasing,(c)limn→∞Bλ,X0,nI,L=limn→∞Iλ(PA,n∥PH,n)=∞,(d)limn→∞1nlogBλ,X0,nI,L=pλL·expx0(qλL)−αλ>0,ifqλL≤min1;eβλ−1,∞,ifqλL>min1;eβλ−1,(e)themapX0↦Bλ,X0,nI,Lisstrictlyincreasing.

Analogously to the discussions in the Section 3.17, Section 3.18, Section 3.19 and Section 3.20, for the parameter setups PSP,2×R\ISP,2∪[0,1] ∪PSP,3a×R\ISP,3a∪[0,1]∪PSP,3b×R\ISP,3b∪[0,1]∪PSP,3c×R\[0,1] and for all initial population sizes X0∈N one can still show

0<Iλ(PA,n∥PH,n),andlimn→∞Iλ(PA,n∥PH,n)=∞.

For the penultimate case we obtain

Corollary 10.

For all βA,βH,αA,αH,λ∈PSP,4a×(R\[0,1]) there exist parameters pλL>αλ (where not necessarily pλL≥0) and 0<qλL<βλ=β•<min{1,eβ•−1}=eβ•−1 such that (35) is satisfied for all x∈[0,∞[ and such that for all initial population sizes X0∈N at least the parts (c) and (d) of Corollary 9 hold true.

Notice that for the last case βA,βH,αA,αH,λ∈PSP,4b×R\[0,1] (where (βA=βH≥1) we cannot derive lower bounds of the power divergences which improve the generally valid lower bound Iλ(PA,n∥PH,n)≥0 (cf. (11)) by employing our proposed (pλU,qλU)-method.

4.6. Upper Bounds of Iλ(·∥·) for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1])

For these constellations we adapt Proposition 14, which after modulation becomes

Corollary 11.

For all βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1]) and all initial population sizes X0∈N there holds with pλU:=αAλαH1−λ and qλU:=βAλβH1−λ

(a)Bλ,X0,1I,U=1λ(λ−1)·expβAλβH1−λ−βλ·X0+αAλαH1−λ−αλ−1>0,(b)thesequenceBλ,X0,nI,Un∈NofupperboundsforIλ(PA,n∥PH,n)givenbyBλ,X0,nI,U=1λ(λ−1)·expan(qλU)·X0+∑k=1nbk(pλU,qλU)−1isstrictlyincreasing,(c)limn→∞Bλ,X0,nI,U=∞,(d)limn→∞1nlogBλ,X0,nI,U=pλU·expx0(qλU)−αλ>0,ifλ∈[λ−,λ+]\[0,1],∞,ifλ∈]−∞,λ−[∪]λ+,∞[,(e)themapX0↦Bλ,X0,nI,Uisstrictlyincreasing.

4.7. Applications to Bayesian Decision Making

As explained in Section 2.5, the power divergences fulfill

IλPA,n∥PH,n=∫01ΔBRLO˜pAprior·1−pApriorλ−2·pAprior−1−λdpAprior,λ∈R,(cf.(21)),

and

IλPA,n∥PH,n=limχ→pApriorΔBRLOλ,χpAprior,λ∈]0,1[,(cf.(22)),

and thus can be interpreted as (i) weighted-average decision risk reduction (weighted-average statistical information measure) about the degree of evidence deg concerning the parameter θ that can be attained by observing the GWI-path Xn until stage n, and as (ii) limit decision risk reduction (limit statistical information measure). Hence, by combining (21) and (22) with the investigations in the previous Section 4.1, Section 4.2, Section 4.3, Section 4.4, Section 4.5 and Section 4.6, we obtain exact recursive values respectively recursive bounds of the above-mentioned decision risk reductions. For the sake of brevity, we omit the details here.

5. Kullback-Leibler Information Divergence (Relative Entropy)

5.1. Exact Values Respectively Upper Bounds of I(·||·)

From (2), (3) and (6) in Section 2.4, one can immediately see that the Kullback-Leibler information divergence (relative entropy) between two competing Galton-Watson processes without/with immigration can be obtained by the limit

I(PA,n∥PH,n)=limλ↗1IλPA,n∥PH,n, (68)

and the reverse Kullback-Leibler information divergence (reverse relative entropy) by IPH,n∥PA,n=limλ↘0IλPA,n∥PH,n. Hence, in the following we concentrate only on (68), the reverse case works analogously. Accordingly, we can use (68) in appropriate combination with the λ∈]0,1[-parts of the previous Section 4 (respectively, the corresponding parts of Section 3) in order to obtain detailed analyses for IPH,n∥PA,n. Let us start with the following assertions on exact values respectively upper bounds, which will be proved in Appendix A.2:

Theorem 3.

  • (a) 
    For all βA,βH,αA,αH∈(PNI∪PSP,1), all initial population sizes X0∈N and all observation horizons n∈N the Kullback-Leibler information divergence (relative entropy) is given by
    I(PA,n∥PH,n)=IX0,n:=βA·logβAβH−1+βH1−βA·X0−αA1−βA·1−βAn+αA·βA·logβAβH−1+βHβA(1−βA)·n,ifβA≠1,βH−logβH−1·αA2·n2+X0+αA2·n,ifβA=1. (69)
  • (b) 
    For all βA,βH,αA,αH∈PSP\PSP,1, all initial population sizes X0∈N and all observation horizons n∈N there holds I(PA,n∥PH,n)≤EX0,nU, where
    EX0,nU:=βA·logβAβH−1+βH1−βA·X0−αA1−βA·1−βAn+αA·βA·logβAβH−1+βHβA(1−βA)+αAlogαAβHαHβA−βHβA+αH·n,ifβA≠1,βH−logβH−1·αA2·n2+X0+αA2·n+αAlogαAβHαH−βH+αH·n,ifβA=1. (70)

Remark 5.

(i) Notice that the exact values respectively upper bounds are in closed form (rather than in recursive form).

(ii) The n–behaviour of (the bounds of) the Kullback-Leibler information divergence/relative entropy I(PA,n∥PH,n) in Theorem 3 is influenced by the following facts:

  • (a) 

    βA·logβAβH−1+βH≥0 with equality iff βA=βH.

  • (b) 

    In the case βA≠1 of (70), there holds αA·βA·logβAβH−1+βHβA(1−βA)+αAlogαAβHαHβA−βHβA+αH≥0, with equality iff αA=αH and βA=βH.

5.2. Lower Bounds of I(·||·) for the Cases βA,βH,αA,αH∈(PSP\PSP,1)

Again by using (68) in appropriate combination with the “λ∈]0,1[-parts” of the previous Section 4 (respectively, the corresponding parts of Section 3), we obtain the following (semi-)closed-form lower bounds of IPH,n∥PA,n:

Theorem 4.

For all βA,βH,αA,αH∈PSP\PSP,1, all initial population sizes X0∈N and all observation horizons n∈N

I(PA,n∥PH,n)≥EX0,nL:=supk∈N0,y∈[0,∞[Ey,X0,nL,tan,Ek,X0,nL,sec,EX0,nL,hor∈[0,∞[, (71)

where for all y∈[0,∞[ we define the – possibly negatively valued– finite bound component

Ey,X0,nL,tan:=βAlogαA+βAyαH+βHy+βH1−αA+βAyαH+βHy·1−βAn1−βA·X0−αA1−βA+[αAβA(1−βA)βAlogαA+βAyαH+βHy+βH1−αA+βAyαH+βHy+αH−αAβHβA1−αA+βAyαH+βHy]·n,ifβA≠1,logαA+yαH+βHy+βH1−αA+yαH+βHy·αA2·n2+X0+αA2·n+αH−αAβH1−αA+yαH+βHy·n,ifβA=1, (72)

and for all k∈N0 the – possibly negatively valued– finite bound component

Ek,X0,nL,sec:=fA(k+1)logfA(k+1)fH(k+1)−fA(k)logfA(k)fH(k)+βH−βA·1−βAn1−βA·X0−αA1−βA+[αAβA(1−βA)fA(k+1)logfA(k+1)fH(k+1)−fA(k)logfA(k)fH(k)+βH−βA−fA(k+1)logfA(k+1)fH(k+1)−fA(k)logfA(k)fH(k)·k+αAβA+fA(k)logfA(k)fH(k)−αAβHβA+αH]·n,ifβA≠1,fA(k+1)logfA(k+1)fH(k+1)−fA(k)logfA(k)fH(k)+βH−1·αA2·n2+X0+αA2·n−[fA(k+1)logfA(k+1)fH(k+1)−fA(k)logfA(k)fH(k)k+αA−fA(k)logfA(k)fH(k)+αAβH−αH]·n,ifβA=1. (73)

Furthermore, on PSP,4 we set EX0,nL,hor:=0 for all n∈N whereas on PSP\(PSP,1∪PSP,4) we define

EX0,nL,hor:=αA+βAz*·logαA+βAz*αH+βHz*−1+αH+βHz*·n,,n∈N, (74)

with z*:=argmaxx∈N0(αA+βAx)−logαA+βAxαH+βHx+1−(αH+βHx).

On PSP\(PSP,1∪PSP,3c) one even gets EX0,nL>0 for all X0∈N and all n∈N.

For the subcase PSP,3c, one obtains for each fixed n∈N and each fixed X0∈N the strict positivity EX0,nL>0 if ∂∂yEy,nL,tan(y*)≠0, where y*:=αA−αHβH−βA∈N and hence

∂∂yEy,X0,nL,tan(y*)=−(βA−βH)3αAβH−αHβA·1−βAn1−βA·X0−αA1−βA−(βA−βH)2βA1+αA(βA−βH)(1−βA)(αAβH−αHβA)·n,ifβA≠1,−(1−βH)3αAβH−αH·αA2·n2+X0+αA2·n−(1−βH)2·n,ifβA=1. (75)

A proof of this theorem is given in in Appendix A.2.

Remark 6.

Consider the exemplary parameter setup βA,βH,αA,αH=(13,23,2,1)∈PSP,3c; within our running-example epidemiological context of Section 2.3, this corresponds to a “semi-mild” infectious-disease-transmission situation (H) (with subcritical reproduction number βH=23 and importation mean of αH=1), whereas (A) describes a “mild” situation (with “low” subcritical βA=13 and αA=2). In the case of X0=3 there holds ∂∂yEy,X0,nL,tan(y*)=0 for all n∈N, whereas for X0≠3 one obtains ∂∂yEy,X0,nL,tan(y*)≠0 for all n∈N.

It seems that the optimization problem in (71) admits in general only an implicitly representable solution, and thus we have used the prefix “(semi-)” above. Of course, as a less tight but less involved explicit lower bound of the Kullback-Leibler information divergence (relative entropy) I(PA,n||PH,n) one can use any term of the form maxEy,X0,nL,tan,Ek,X0,nL,sec,EX0,nL,hor (y∈[0,∞[, k∈N0), as well as the following

Corollary 12.

(a) For all βA,βH,αA,αH∈PSP\PSP,1, all initial population sizes X0∈N and all observation horizons n∈N

I(PA,n∥PH,n)≥EX0,nL≥E˜X0,nL:=maxE∞,X0,nL,tan,E0,X0,nL,sec,EX0,nL,hor∈[0,∞[,

with EX0,nL,hor defined by (74), with – possibly negatively valued– finite bound component E∞,X0,nL,tan:=limy→∞Ey,X0,nL,tan, where

E∞,X0,nL,tan:=βA·logβAβH−1+βH1−βA·X0−αA1−βA·1−βAn+αA·βA·logβAβH−1+βHβA(1−βA)+αA1−βHβA+αH1−βAβH·n,ifβA≠1,βH−logβH−1·αA2·n2+X0+αA2·n+αA1−βH+αH1−1βH·n,ifβA=1,

and –possibly negatively valued–finite bound component

E0,X0,nL,sec=αA+βA·logαA+βAαH+βH−αA·logαAαH+βH−βA·1−βAn1−βA·X0−αA1−βA+{αAβA(1−βA)αA+βA·logαA+βAαH+βH−αA·logαAαH−αA1−βA1−βH−αA1+αAβA·logαH(αA+βA)αA(αH+βH)+αH}·n,ifβA≠1,αA+1·logαA+1αH+βH−αA·logαAαH+βH−1·n·X0+αA2·n2+{αA2αA+1·logαA+1αH+βH−αA·logαAαH−βH−1−αA1+αA·logαH(αA+1)αA(αH+βH)+αH}·n,ifβA=1.

For the cases PSP,2∪PSP,3a∪PSP,3b one gets even E˜X0,nL>0 for all X0∈N and all n∈N.

5.3. Applications to Bayesian Decision Making

As explained in Section 2.5, the Kullback-Leibler information divergence fulfills

IPA,n∥PH,n=∫01ΔBRLO˜pAprior·1−pAprior−1·pAprior−2dpAprior,(cf.(21)withλ=1),

and thus can be interpreted as weighted-average decision risk reduction (weighted-average statistical information measure) about the degree of evidence deg concerning the parameter θ that can be attained by observing the GWI-path Xn until stage n. Hence, by combining (21) with the investigations in the previous Section 5.1 and Section 5.2, we obtain exact values respectively bounds of the above-mentioned decision risk reductions. For the sake of brevity, we omit the details here.

6. Explicit Closed-Form Bounds of Hellinger Integrals

6.1. Principal Approach

Depending on the parameter constellation βA,βH,αA,αH,λ∈P×(R\{0,1}), for the Hellinger integrals HλPA,n∥PH,n we have derived in Section 3 corresponding lower/upper bounds respectively exact values–of recursive nature– which can be obtained by choosing appropriate p=pλA=pAβA,βH,αA,αH,λ,q=qλA=qAβA,βH,αA,αH,λ (A∈{E,L,U}) and by using those together with the recursion an(q)n∈N defined by (36) as well as the sequence bn(p,q)n∈N obtained from an(q)n∈N by the linear transformation (38). Both sequences are “stepwise fully evaluable” but generally seem not to admit a closed-form representation in the observation horizons n; consequently, the time-evolution n↦HλPA,n∥PH,n–respectively the time-evolution of the corresponding recursive bounds– can generally not be seen explicitly. On order to avoid this intransparency (at the expense of losing some precision) one can approximate (36) by a recursion that allows for a closed-form representation; by the way, this will also turn out to be useful for investigations concerning diffusion limits (cf. the next Section 7).

To explain the basic underlying principle, let us first assume some general q∈]0,βλ[ and λ∈]0,1[. With Properties 1 (P1) we see that the sequence an(q)n∈N is strictly negative, strictly decreasing and converges to x0(q)∈]−βλ,q−βλ[. Recall that this sequence is obtained by the recursive application of the function ξλ(q)(x):=q·ex−βλ, through a1(q)=ξλ(q)(0)=q−βλ<0, an(q)=ξλ(q)an−1(q)=qean−1(q)−βλ (cf. (36)). As a first step, we want to approximate ξλ(q)(·) by a linear function on the interval x0(q),0. Due to convexity (P9), this is done by using the tangent line of ξλ(q)(·) at x0(q)

ξλ(q),T(x):=c(q),T+d(q),T·x:=x0(q)1−q·ex0(q)+q·ex0(q)·x, (76)

as a linear lower bound, and the secant line of ξλ(q)(·) across its arguments 0 and x0(q)

ξλ(q),S(x):=c(q),S+d(q),S·x:=q−βλ+x0(q)−(q−βλ)x0(q)·x, (77)

as a linear upper bound. With the help of these functions, we can define the linear recursions

a0(q),T:=0,an(q),T:=ξλ(q),Tan−1(q),T,n∈N, (78)
aswellasa0(q),S:=0,an(q),S:=ξλ(q),San−1(q),S,n∈N. (79)

In the following, we will refer to these sequences as the rudimentary closed-form sequence-bounds.

Clearly, both sequences are strictly negative (on N), strictly decreasing, and one gets the sandwiching

an(q),T<an(q)≤an(q),S (80)

for all n∈N, with equality on the right side iff n=1 (where a1(q)=q−βλ<0); moreover,

limn→∞an(q),T=limn→∞an(q),S=limn→∞an(q)=x0(q). (81)

Furthermore, such linear recursions allow for a closed-form representation, namely

an(q),*=c(q),*1−d(q),*·1−d(q),*n=x0(q)·1−d(q),*n, (82)

where the “ * ” stands for either S or T. Notice that this representation is valid due to d(q),T,d(q),S∈]0,1[. So far, we have considered the case q∈]0,βλ[. If q=βλ, then one can see from Properties 1 (P2) that an(q)≡0, which is also an explicitly given (though trivial) sequence. For the remaining case, where q>βλ and thus ξλ(q)(0)=a1(q)=q−βλ>0), we want to exclude q≥min1,eβλ−1 for the following reasons. Firstly, if q>min1,eβλ−1, then from (P3) we see that the sequence an(q)n∈N is strictly increasing and divergent to ∞, at a rate faster than exponentially (P3b); but a linear recursion is too weak to approximate such a growth pattern. Secondly, if q=min1,eβλ−1, then one necessarily gets q=eβλ−1<1 (since we have required q>βλ, and otherwise one obtains the contradiction βλ<q=1≤eβλ−1). This means that the function ξλ(q)(·) now touches the straight line id(·) in the point −log(q), i.e., ξλ(q)−log(q)=−log(q). Our above-proposed method, namely to use the tangent line of ξλ(q)(·) at x=x0(q)=−log(q) as a linear lower bound for ξλ(q)(·), leads then to the recursion an(q),T≡0 (cf. (78)). This is due to the fact that the tangent line ξλ(q),T(·) is in the current case equivalent with the straight line id(·). Consequently, (81) would not be satisfied.

Notice that in the case βλ<q<min1,eβλ−1, the above-introduced functions ξλ(q),T(·),ξλ(q),S(·) constitute again linear lower and upper bounds for ξλ(q)(·), however, this time on the interval 0,x0(q). The sequences defined in (78) and (79) still fulfill the assertions (80) and (81), and additionally allow for the closed-form representation (82). Furthermore, let us mention that these rudimentary closed-form sequence-bounds can be defined analogously for λ∈R\[0,1] and either 0<q<βλ, or q=βλ, or max{0,βλ}<q<min{1,eβλ−1}.

In a second step, we want to improve the above-mentioned linear (lower and upper) approximations of the sequence an(q) by reducing the faced error within each iteration. To do so, in both cases of lower and upper approximates we shall employ context-adapted linear inhomogeneous difference equations of the form

a˜0:=0;a˜n:=ξ˜a˜n−1+ρn−1,n∈N, (83)

with

ξ˜(x):=c+d·x,x∈R, (84)
ρn−1:=K1·ϰn−1+K2·νn−1,n∈N, (85)

for some constants c∈R, d∈]0,1[, K1,K2,ϰ,ν∈R with 0≤ν<ϰ≤d. This will be applied to c:=c(q),S, c:=c(q),T, d:=d(q),S and d:=d(q),T later on. Meanwhile, let us first present some facts and expressions which are insightful for further formulations and analyses.

Lemma 2.

Consider the sequence a˜nn∈N0 defined in (83) to (85). If 0≤ν<ϰ<d, then one gets the closed-form representation

a˜n=a˜nhom+c˜nwitha˜nhom=c·1−dn1−dandc˜n=K1·dn−ϰnd−ϰ+K2·dn−νnd−ν, (86)

which leads for all n∈N to

∑k=1na˜k=K1d−ϰ+K2d−ν−c1−d·d·1−dn1−d−K1·ϰ·1−ϰn(d−ϰ)(1−ϰ)−K2·ν·1−νn(d−ν)(1−ν)+c1−d·n. (87)

If 0≤ν<ϰ=d, then one gets the closed-form representation

a˜n=a˜nhom+c˜nwitha˜nhom=c·1−dn1−dandc˜n=K1·n·dn−1+K2·dn−νnd−ν, (88)

which leads for all n∈N to

∑k=1na˜k=K1d(1−d)+K2d−ν−c1−d·d·1−dn1−d−K2·ν·1−νn(d−ν)(1−ν)+c1−d−K1·dn1−d·n. (89)

Lemma 2 will be proved in Appendix A.3. Notice that (88) is consistent with taking the limit ϰ↗d in (86). Furthermore, for the special case K2=−K1>0 one has from (85) for all integers n≥2 the relation ρn−1<0 and thus a˜n−a˜nhom<0, leading to

c˜n<0and∑k=1nc˜n<0. (90)

Lemma 2 gives explicit expressions for a linear inhomogeneous recursion of the form (83) possessing the extra term given by (85). Therefrom we derive lower and upper bounds for the sequence an(q)n∈N by employing an(q),T resp. an(q),S as the homogeneous solution of (83), i.e., by setting a˜nhom:=an(q),T resp. a˜nhom:=an(q),S. Moreover, our concrete approximation-error-reducing “correction terms” ρn will have different form, depending on whether 0<q<βλ or q>max{0,βλ}. In both cases, we express ρn by means of the slopes d(q),T=qex0(q) resp. d(q),S=x0(q)−(q−βλ)x0(q) of the tangent line ξλ(q),T(·) (cf. (76)) resp. the secant line ξλ(q),S(·) (cf. (77)), as well as in terms of the parameters

Γ<(q):=12·x0(q)2·q·ex0(q),for0<q<βλ,andΓ>(q):=q2·x0(q)2,forq>max{0,βλ}. (91)

In detail, let us first define the lower approximate by

a_0(q):=0,a_n(q):=ξλ(q),Ta_n−1(q)+ρ_n−1(q),n∈N, (92)

where

ρ_n−1(q):=Γ<(q)·d(q),T2(n−1),if0<q<βλ,Γ>(q)·d(q),S2(n−1),ifmax{0,βλ}<q<min{1,eβλ−1}. (93)

The upper approximate is defined by

a¯0(q):=0,a¯n(q):=ξλ(q),Sa¯n−1(q)+ρ¯n−1(q),n∈N, (94)

where

ρ¯n−1(q):=−Γ<(q)·d(q),Tn−1·1−d(q),Sn−1,if0<q<βλ,−Γ>(q)·d(q),Sn−1·1−d(q),Tn−1,ifmax{0,βλ}<q<min{1,eβλ−1}. (95)

In terms of (85), we use for ρ_n(q) the constants K2=ν=0 as well as K1=Γ<(q),ϰ=d(q),T2 for 0<q<βλ respectively K1=Γ>(q),ϰ=d(q),S2 for max{0,βλ}<q<min{1,eβλ−1}. For ρ¯n(q) we shall employ the constants −K1=K2=Γ<(q),ϰ=d(q),T,ν=d(q),Sd(q),T for 0<q<βλ, and −K1=K2=Γ>(q),ϰ=d(q),S,ν=d(q),Sd(q),T for max{0,βλ}<q<min{1,eβλ−1}. Recall from (76) the constants c(q),T:=x0(q)(1−qex0(q)), d(q),T:=qex0(q) and from (77) c(q),S:=q−βλ, d(q),S:=x0(q)−(q−βλ)x0(q). In the following, we will refer to the sequences a_n(q) resp. a¯n(q) as the improved closed-form sequence-bounds. Putting all ingredients together, we arrive at the

Lemma 3.

For all βA,βH,αA,αH∈P there holds with d(q),T=qex0(q) and d(q),S=x0(q)−(q−βλ)x0(q)

  • (a) 
    in the case 0<q<βλ:
    • (i) 
      a_n(q)<an(q)≤a¯n(q)foralln∈N,
      with equality on the right-hand side iff n=1, where
      a_n(q)=x0(q)·1−d(q),Tn+Γ<(q)·d(q),Tn−11−d(q),T·1−d(q),Tn>an(q),T,anda¯n(q)=x0(q)·1−d(q),Sn−Γ<(q)·d(q),Sn−d(q),Tnd(q),S−d(q),T−d(q),Sn−11−d(q),Tn1−d(q),T≤an(q),S,
      with an(q),T and an(q),S defined by (78) and (79).
    • (ii) 
      Both sequences a_n(q)n∈N and a¯n(q)n∈N are strictly decreasing.
    • (iii) 
      limn→∞a_n(q)=limn→∞a¯n(q)=limn→∞an(q)=x0(q)∈]−βλ,q−βλ[.
  • (b) 
    in the case max{0,βλ}<q<min1,eβλ−1:
    • (i) 
      a_n(q)<an(q)≤a¯n(q),foralln∈N,
      with equality on the right-hand side iff n=1, where
      a_n(q)=x0(q)·1−d(q),Tn+Γ>(q)·d(q),Tn−d(q),S2nd(q),T−d(q),S2>an(q),Tanda¯n(q)=x0(q)·1−d(q),Sn−Γ>(q)·d(q),Sn−1n−1−d(q),Tn1−d(q),T≤an(q),S,
      with an(q),T and an(q),S defined by (78) and (79).
    • (ii) 
      Both sequences a_n(q)n∈N and a¯n(q)n∈N are strictly increasing.
    • (iii) 
      limn→∞a_n(q)=limn→∞a¯n(q)=limn→∞an(q)=x0(q)∈]q−βλ,−log(q)[.

A detailed proof of Lemma 3 is provided in Appendix A.3. In the following, we employ the above-mentioned investigations in order to derive the desired closed-form bounds of the Hellinger integrals Hλ(PA,n∥PH,n).

6.2. Explicit Closed-Form Bounds for the Cases βA,βH,αA,αH,λ∈(PNI∪PSP,1)×(R\{0,1})

Recall that in this setup, we have obtained the recursive, non-explicit exact values Vλ,X0,n=Hλ(PA,n∥PH,n) given in (39) of Theorem 1, where we used q=qλE=qE(βA,βH,λ)=βAλβH1−λ∈]0,βλ[ in the case λ∈]0,1[ respectively q=qλE=βAλβH1−λ>max{0,βλ} in the case λ∈R\[0,1]. For the latter, Lemma 1 implies that qλE<min{1,eβλ−1} iff λ∈]λ−,λ+[\[0,1]. This—together with (39) from Theorem 1, Lemma 2 and with the quantities d(q),T,d(q),S, Γ<(q) and Γ>(q) as defined in (76) and (77) resp. (91) –leads to

Theorem 5.

Let pλE:=αAλαH1−λ and qλE:=βAλβH1−λ. For all βA,βH,αA,αH,λ∈(PNI∪PSP,1)×]λ−,λ+[\{0,1}, all initial population sizes X0∈N and for all observation horizons n∈N the following assertions hold true:

  • (a) 
    the Hellinger integral can be bounded by the closed-form lower and upper bounds
    Cλ,X0,n(pλE,qλE),T≤Cλ,X0,n(pλE,qλE),L≤Vλ,X0,n=Hλ(PA,n∥PH,n)≤Cλ,X0,n(pλE,qλE),U≤Cλ,X0,n(pλE,qλE),S,
  • (b) 
    limn→∞1nlogVλ,X0,n=limn→∞1nlogCλ,X0,n(pλE,qλE),L=limn→∞1nlogCλ,X0,n(pλE,qλE),U=limn→∞1nlogCλ,X0,n(pλE,qλE),T=limn→∞1nlogCλ,X0,n(pλE,qλE),S=αAβA·x0(qλE),

where the involved closed-form lower bounds are defined by

Cλ,X0,n(pλE,qλE),L:=Cλ,X0,n(pλE,qλE),T·expζ_n(qλE)·X0+αAβA·ϑ_n(qλE),withCλ,X0,n(pλE,qλE),T:=expx0(qλE)·X0−αAβA·d(qλE),T1−d(qλE),T·1−d(qλE),Tn+αAβAx0(qλE)·n, (96)

and the closed-form upper bounds are defined by

Cλ,X0,n(pλE,qλE),U:=Cλ,X0,n(pλE,qλE),S·exp−ζ¯n(qλE)·X0−αAβA·ϑ¯n(qλE),withCλ,X0,n(pλE,qλE),S:=expx0(qλE)·X0−αAβA·d(qλE),S1−d(qλE),S·1−d(qλE),Sn+αAβAx0(qλE)·n, (97)

where in the case λ∈]0,1[

ζ_n(qλE):=Γ<(qλE)·d(qλE),Tn−11−d(qλE),T·1−d(qλE),Tn>0, (98)
ϑ_n(qλE):=Γ<(qλE)·1−d(qλE),Tn1−d(qλE),T2·1−d(qλE),T1+d(qλE),Tn1+d(qλE),T>0, (99)
ζ¯n(qλE):=Γ<(qλE)·d(qλE),Sn−d(qλE),Tnd(qλE),S−d(qλE),T−d(qλE),Sn−1·1−d(qλE),Tn1−d(qλE),T>0, (100)
ϑ¯n(qλE):=Γ<(qλE)·d(qλE),T1−d(qλE),T·1−d(qλE),Sd(qλE),Tn1−d(qλE),Sd(qλE),T−d(qλE),Sn−d(qλE),Tnd(qλE),S−d(qλE),T>0, (101)

and where in the case λ∈]λ−,λ+[\[0,1]

ζ_n(qλE):=Γ>(qλE)·d(qλE),Tn−d(qλE),S2nd(qλE),T−d(qλE),S2>0, (102)
ϑ_n(qλE):=Γ>(qλE)d(qλE),T−d(qλE),S2d(qλE),T1−d(qλE),Tn1−d(qλE),T−d(qλE),S21−d(qλE),S2n1−d(qλE),S2>0, (103)
ζ¯n(qλE):=Γ>(qλE)·d(qλE),Sn−1·n−1−d(qλE),Tn1−d(qλE),T>0, (104)
ϑ¯n(qλE):=Γ>(qλE)·[d(qλE),S−d(qλE),T1−d(qλE),S21−d(qλE),T·1−d(qλE),Sn+d(qλE),T1−d(qλE),Sd(qλE),Tn1−d(qλE),T1−d(qλE),Sd(qλE),T−d(qλE),Sn1−d(qλE),S·n]>0. (105)

Notice that αAβA can be equivalently be replaced by αHβH in (96) and in (97).

A proof of Theorem 5 is given in Appendix A.3.

6.3. Explicit Closed-Form Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[

To derive (explicit) closed-form lower bounds of the (nonexplicit) recursive lower bounds Bλ,X0,nL for the Hellinger integral Hλ(PA,n∥PH,n) respectively closed-form upper bounds of the recursive upper bounds Bλ,X0,nU for all parameters cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\{0,1}), we combine part (b) of Theorem 1, Lemma 2, Lemma 3 together with appropriate parameters pλL=pLβA,βH,αA,αH,λ,pλU=pUβA,βH,αA,αH,λ≥0 and qλL=qLβA,βH,αA,αH,λ, qλU=qUβA,βH,αA,αH,λ>0 satisfying (35). Notice that the representations of the lower and upper closed-form sequence-bounds depend on whether 0<qλA<βλ, 0<qλA=βλ or max{0,βλ}<qλA<min{1,eβλ−1} (A∈{L,U}).

Let us start with closed-form lower bounds for the case λ∈]0,1[; recall that the choice pλL=αAλαH1−λ,qλL=βAλβH1−λ led to the optimal recursive lower bounds Bλ,X0,nL of the Hellinger integral (cf. Theorem 1(b) and Section 3.5). Correspondingly, we can derive

Theorem 6.

Let pλL=αAλαH1−λ and qλL=βAλβH1−λ. Then, the following assertions hold true:

  • (a) 
    For all βA,βH,αA,αH,λ∈PSP,2∪PSP,3a∪PSP,3b∪PSP,3c×]0,1[ (for which particularly 0<qλL<βλ, βA≠βH), all initial population sizes X0∈N and all observation horizons n∈N there holds
    Cλ,X0,n(pλL,qλL),T≤Cλ,X0,n(pλL,qλL),L≤Bλ,X0,nL<1,
    whereCλ,X0,n(pλL,qλL),L:=Cλ,X0,n(pλL,qλL),T·expζ_n(qλL)·X0+pλLqλL·ϑ_n(qλL) (106)
    withCλ,X0,n(pλL,qλL),T:=exp{x0(qλL)·X0−pλLqλL·d(qλL),T1−d(qλL),T·1−d(qλL),Tn+pλLqλL·βλ+x0(qλL)−αλ·n},andwithζ_n(qλL):=Γ<(qλL)·d(qλL),Tn−11−d(qλL),T·1−d(qλL),Tn>0, (107)
    ϑ_n(qλL):=Γ<(qλL)·1−d(qλL),Tn1−d(qλL),T2·1−d(qλL),T1+d(qλL),Tn1+d(qλL),T>0. (108)
  • (b) 
    For all βA,βH,αA,αH,λ∈(PSP,4a∪PSP,4b)×]0,1[ (for which particularly 0<qλL=βλ, βA=βH), all initial population sizes X0∈N and all observation horizons n∈N there holds
    Cλ,X0,n(pλL,qλL),L:=Cλ,X0,n(pλL,qλL),T:=Bλ,X0,nL=exppλL−αλ·n<1.
  • (c) 
    For all βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[ and all initial population sizes X0∈N one gets
    limn→∞1nlogCλ,X0,n(pλL,qλL),T=limn→∞1nlogCλ,X0,n(pλL,qλL),L=limn→∞1nlogBλ,X0,nL=pλLqλL·βλ+x0(qλL)−αλ<0,
    where in the case βA=βH there holds qλL=βλ and x0(qλL)=0.

The proof will be provided in Appendix A.3.

In order to deduce closed-form upper bounds for the case λ∈]0,1[, we first recall from the Section 3.6, Section 3.7, Section 3.8, Section 3.9, Section 3.10, Section 3.11, Section 3.12 and Section 3.13, that we have to employ suitable parameters pλU=pUβA,βH,αA,αH,λ,qλU=qUβA,βH,αA,αH,λ satisfying (35). Notice that we automatically obtain pλU≥pλL=αAλαH1−λ>0. Correspondingly, we obtain

Theorem 7.

For all βA,βH,αA,αH,λ∈(PSP\PSP,1)×]0,1[, all coefficients pλU,qλU which satisfy (35) for all x∈N0 and additionally either 0<qλU≤βλ or βλ<qλU<min{1,eβλ−1}, all initial population sizes X0∈N and all observation horizons n∈N the following assertions hold true:

Cλ,X0,n(pλU,qλU),S≥Cλ,X0,n(pλU,qλU),U≥B˜λ,X0,n(pλU,qλU)≥Bλ,X0,nU,where (109)
  • (a) 
    in the case 0<qλU<βλ one has
    Cλ,X0,n(pλU,qλU),U:=Cλ,X0,n(pλU,qλU),S·exp−ζ¯n(qλU)·X0−pλUqλU·ϑ¯n(qλU) (110)
    withCλ,X0,n(pλU,qλU),S:=exp{x0(qλU)·X0−pλUqλU·d(qλU),S1−d(qλU),S·1−d(qλU),Sn+pλUqλU·βλ+x0(qλU)−αλ·n},ζ¯n(qλU):=Γ<(qλU)·d(qλU),Sn−d(qλU),Tnd(qλU),S−d(qλU),T−d(qλU),Sn−1·1−d(qλU),Tn1−d(qλU),T>0, (111)
    ϑ¯n(qλU):=Γ<(qλU)·d(qλU),T1−d(qλU),T·1−d(qλU),Sd(qλU),Tn1−d(qλU),Sd(qλU),T−d(qλU),Sn−d(qλU),Tnd(qλU),S−d(qλU),T>0; (112)
    furthermore, whenever pλU,qλU satisfy additionally (47) (such parameters exist particularly in the setups PSP,2∪PSP,3a∪PSP,3b, cf. Section 3.7, Section 3.8 and Section 3.9), then
    1>Cλ,X0,n(pλU,qλU),SandB˜λ,X0,n(pλU,qλU)=Bλ,X0,nU∀n∈N;
  • (b) 
    in the case 0<qλU=βλ one has
    Cλ,X0,n(pλU,qλU),U:=Cλ,X0,n(pλU,qλU),S:=B˜λ,X0,n(pλU,qλU)=exppλU−αλ·n;
  • (c) 
    in the case βλ<qλU<min1,eβλ−1 the formulas (109) and (110) remain valid, but with
    ζ¯n(qλU):=Γ>(qλU)·d(qλU),Sn−1·n−1−d(qλU),Tn1−d(qλU),T>0, (113)
    ϑ¯n(qλU):=Γ>(qλU)·[d(qλU),S−d(qλU),T1−d(qλU),S21−d(qλU),T·1−d(qλU),Sn+d(qλU),T1−d(qλU),Sd(qλU),Tn1−d(qλU),T1−d(qλU),Sd(qλU),T−d(qλU),Sn1−d(qλU),S·n]>0; (114)
  • (d) 
    for all cases (a) to (c) one gets
    limn→∞1nlogCλ,X0,n(pλU,qλU),S=limn→∞1nlogCλ,X0,n(pλU,qλU),U=limn→∞1nlogB˜λ,X0,n(pλU,qλU)=pλUqλU·βλ+x0(qλU)−αλ,
    where in the case qλU=βλ there holds x0(qλU)=0.

This Theorem 7 will be proved in Appendix A.3. Notice that for an inadequate choice of pλU,qλU it may hold that pλUqλU(βλ+x0(qλU))−αλ>0 in part (d) of Theorem 7.

6.4. Explicit Closed-Form Bounds for the Cases βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1])

For λ∈R\[0,1], let us now construct closed-form lower bounds of the recursive lower bound components B˜λ,X0,n(pλL,qλL), for suitable parameters pλL≥0 and either 0<qλL≤βλ or max{0,βλ}<qλL<min{1,eβλ−1} satisfying (35).

Theorem 8.

For all βA,βH,αA,αH,λ∈(PSP\PSP,1)×(R\[0,1]), all coefficients pλL≥0,qλL>0 which satisfy (35) for all x∈N0 and either 0<qλL≤βλ or max{0,βλ}<qλL<min{1,eβλ−1}, all initial population sizes X0∈N and all observation horizons n∈N the following assertions hold true:

Cλ,X0,n(pλL,qλL),T≤Cλ,X0,n(pλL,qλL),L≤B˜λ,X0,n(pλL,qλL)≤Bλ,X0,nL,where (115)
  • (a) 
    in the case 0<qλL<βλ one has
    Cλ,X0,n(pλL,qλL),L:=Cλ,X0,n(pλL,qλL),T·expζ_n(qλL)·X0+pλLqλL·ϑ_n(qλL), (116)
    withCλ,X0,n(pλL,qλL),T:=exp{x0(qλL)·X0−pλLqλL·d(qλL),T1−d(qλL),T·1−d(qλL),Tn+pλLqλL·βλ+x0(qλL)−αλ·n}ζ_n(qλL):=Γ<(qλL)·d(qλL),Tn−11−d(qλL),T·1−d(qλL),Tn>0, (117)
    ϑ_n(qλL):=Γ<(qλL)·1−d(qλL),Tn1−d(qλL),T2·1−d(qλL),T1+d(qλL),Tn1+d(qλL),T>0; (118)
    furthermore, whenever pλL,qλL satisfy additionally (56) (such parameters exist particularly in the setups PSP,2∪PSP,3a∪PSP,3b, cf. Section 3.17, Section 3.18 and Section 3.19), then
    1<Cλ,X0,n(pλL,qλL),TandB˜λ,X0,n(pλL,qλL)=Bλ,X0,nL∀n∈N;
  • (b) 
    in the case 0<qλL=βλ one has
    Cλ,X0,n(pλL,qλL),L:=Cλ,X0,n(pλL,qλL),T=B˜λ,X0,n(pλL,qλL)=exppλL−αλ·n;
  • (c) 
    in the case max{0,βλ}<qλL<min1,eβλ−1 the formulas (115) and (116) remain valid, but with
    ζ_n(qλL):=Γ>(qλL)·d(qλL),Tn−d(qλL),S2nd(qλL),T−d(qλL),S2>0, (119)
    ϑ_n(qλL):=Γ>(qλL)d(qλL),T−d(qλL),S2·d(qλL),T·1−d(qλL),Tn1−d(qλL),T−d(qλL),S2·1−d(qλL),S2n1−d(qλL),S2>0; (120)
  • (d) 
    for all cases (a) to (c) one gets
    limn→∞1nlogCλ,X0,n(pλL,qλL),T=limn→∞1nlogCλ,X0,n(pλL,qλL),L=limn→∞1nlogB˜λ,X0,n(pλL,qλL)=pλLqλL·βλ+x0(qλL)−αλ,
    where in the case qλL=βλ there holds x0(qλL)=0.

For the proof of Theorem 8, see Appendix A.3. Notice that for an inadequate choice of pλL,qλL it may hold that pλLqλL(βλ+x0(qλU))−αλ<0 in the last assertion of Theorem 8.

To derive closed-form upper bounds of the recursive upper bounds Bλ,X0,nU of the Hellinger integral in the case λ∈R\[0,1], let us first recall from Section 3.24 that we have to use the parameters pλU=αAλαH1−λ>0 and qλU=βAλβH1−λ>0. Furthermore, in the case βA≠βH we obtain from Lemma 1 (setting qλ=qλU) the assertion that max{0,βλ}<qλU<min{1,eβλ−1} iff λ∈]λ−,λ+[\[0,1](implying that the sequence an(qλU)n∈N converges). In the case βA=βH on gets qλU=βAλβH1−λ=βA=βH=βλ and therefore (cf. (P2)) an(qλU)=0 for all n∈N and for all λ∈R\[0,1]. Correspondingly, we deduce

Theorem 9.

Let pλU=αAλαH1−λ and qλU=βAλβH1−λ. Then, the following assertions hold true:

  • (a) 
    For all βA,βH,αA,αH,λ∈(PSP,2∪PSP,3a∪PSP,3b∪PSP,3c)×(]λ−,λ+[\[0,1]) (in particular for βA≠βH), all initial population sizes X0∈N and all observation horizons n∈N there holds
    ∞>Cλ,X0,n(pλU,qλU),S≥Cλ,X0,n(pλU,qλU),U≥Bλ,X0,nU>1,
    whereCλ,X0,n(pλU,qλU),U:=Cλ,X0,n(pλU,qλU),S·exp−ζ¯n(qλU)·X0−pλUqλU·ϑ¯n(qλU) (121)
    withCλ,X0,n(pλU,qλU),S:=exp{x0(qλU)·X0−pλUqλU·d(qλU),T1−d(qλU),T·1−d(qλU),Tn+pλUqλU·βλ+x0(qλU)−αλ·n},ζ¯n(qλU):=Γ>(qλU)·d(qλU),Sn−1·n−1−d(qλU),Tn1−d(qλU),T>0, (122)
    ϑ¯n(qλU):=Γ>(qλU)·[d(qλU),S−d(qλU),T1−d(qλU),S21−d(qλU),T·1−d(qλU),Sn+d(qλU),T1−d(qλU),Sd(qλU),Tn1−d(qλU),T1−d(qλU),Sd(qλU),T−d(qλU),Sn1−d(qλU),S·n]>0. (123)
  • (b) 
    For all βA,βH,αA,αH,λ∈(PSP,4a∪PSP,4b)×(R\[0,1]) (for which particularly 0<qλU=βλ, βA=βH), all initial population sizes X0∈N and all observation horizons n∈N there holds
    Cλ,X0,n(pλU,qλU),U:=Cλ,X0,n(pλU,qλU),S:=Bλ,X0,nU=exppλU−αλ·n>1.
  • (c) 
    For all βA,βH,αA,αH,λ∈(PSP\PSP,1)×(]λ−,λ+[\[0,1]) and all initial population sizes X0∈N one gets
    limn→∞1nlogCλ,X0,n(pλU,qλU),S=limn→∞1nlogCλ,X0,n(pλU,qλU),U=limn→∞1nlogBλ,X0,nU=pλUqλU·βλ+x0(qλU)−αλ>0,
    where in the case βA=βH there holds qλU=βλ and x0(qλU)=0.

A proof of Theorem 9 is provided in Appendix A.3.

Remark 7.

Substituting an(q) by an(q),T resp. an(q),S (cf. (78) resp. (79)) in B˜λ,X0,n(p,q) from (42) leads to the “rudimentary” closed-form bounds Cλ,X0,n(p,q),T resp. Cλ,X0,n(p,q),S, whereas substituting an(q) by a_n(q) resp. a¯n(q) (cf. (92) resp. (94)) in B˜λ,X0,n(p,q) from (42) leads to the “improved” closed-form bounds Cλ,X0,n(p,q),L resp. Cλ,X0,n(p,q),U in all the Theorems 5–9.

6.5. Totally Explicit Closed-Form Bounds

The above-mentioned results give closed-form lower bounds Cλ,X0,n(p,q),L, Cλ,X0,n(p,q),T resp. closed-form upper bounds Cλ,X0,n(p,q),U, Cλ,X0,n(p,q),S of the Hellinger integrals Hλ(PA,n∥PH,n) for case-dependent choices of p,q. However, these bounds still involve the fixed point x0(q) which in general has to be calculated implicitly. In order to get “totally” explicit but “slightly” less tight closed-form bounds of Hλ(PA,n∥PH,n), one can proceed as follows:

  1. in all the closed-form lower bound formulas of the Theorems 5, 6 and 8–including the definitions (76), (77) and (91)–replace the implicit x0(q) by a close explicitly known point x_0(q)<x0(q);

  2. in all closed-form upper bound formulas of the Theorems 5, 7 and 9–including (76), (77) and (91)–replace x0(q) by a close explicitly known point x¯0(q)>x0(q).

For instance, one can use the following choices which will be also employed as an auxiliary tool for the diffusion-limit-concerning proof of Lemma A6 in Appendix A.4:

x_0(q):=q−1·e−x__0(q)·1−q−1−q2−2·q·ex__0(q)·q−βλ,ifq∈]0,βλ[,q−1·1−q−1−q2−2·q·q−βλ,ifmax{0,βλ}<q<min{1,eβλ−1}, (124)
wherex__0(q):=max−βλ,q−βλ1−q,ifq∈]0,1[,−βλ,ifq≥1, (125)
x¯0(q):=q−1·1−q−1−q2−2·q·q−βλ,ifq∈]0,βλ[,1−q−1−q2−2·q−βλ,ifmax{0,βλ}<q<min{1,eβλ−1}and1−q2−2·q·q−βλ≥0,x¯¯0(q):=−log(q)ifmax{0,βλ}<q<min{1,eβλ−1}and1−q2−2·q·q−βλ<0. (126)

Behind this choice “lies” the idea that–in contrast to the solution x0(q) of ξλ(q)(x):=qex−βλ=x–the point x_0(q) is a solution of (the obviously explicitly solvable) Q_λ(q)(x):=a_λ(q)x2+b_λ(q)x+c_λ(q)=x in both cases 0<q<βλ and max{0,βλ}<q<min{1,eβλ−1}, whereas the point x¯0(q) is a solution of Q¯λ(q)(x):=a¯λ(q)x2+b¯λ(q)x+c¯λ(q)=x in the case 0<q<βλ and in the case max{0,βλ}<q<min{1,eβλ−1} together with 1−q2−2·q·q−βλ≥0. Thereby, Q_λ(q)(·) and Q¯λ(q)(·) are the lower resp. upper quadratic approximates of ξλ(q)(·) satisfying the following constraints:

  • for q∈]0,βλ[ (mostly but not only for λ∈]0,1[) (lower bound):
    Q_λ(q)(0)=ξλ(q)(0)=q−βλ,Q_λ(q)′(0)=ξλ(q)′(0)=q,Q_λ(q)′′(x)=ξλ(q)′′(y)=qey,x∈R,
    for some explicitly known approximate y<x0(q)(leading to the (tighter) explicit lower approximate x_0(q)∈]y,x0(q)[); here, we choose
    y:=x__0(q):=max−βλ,q−βλ1−q,ifq<1,−βλ,ifq≥1;
  • for q∈]0,βλ[ (mostly but not only for λ∈]0,1[) (upper bound):
    Q¯λ(q)(0)=ξλ(q)(0)=q−βλ,Q¯λ(q)′(0)=ξλ(q)′(0)=q,Q¯λ(q)′′(x)=ξλ(q)′′(0)=q,x∈R;
  • for max{0,βλ}<q<min{1,eβλ−1} (mostly but not only for λ∈R\[0,1]) (lower bound):
    Q_λ(q)(0)=ξλ(q)(0)=q−βλ,Q_λ(q)′(0)=ξλ(q)′(0)=q,Q_λ(q)′′(x)=ξλ(q)′′(0)=q,x∈R;
  • for max{0,βλ}<q<min{1,eβλ−1} in combination with 1−q2−2·q·q−βλ≥0 (mostly but not only for λ∈R\[0,1]) (upper bound):
    Q¯λ(q)(0)=ξλ(q)(0)=q−βλ,Q¯λ(q)′(0)=ξλ(q)′(0)=q,Q¯λ(q)′′(x)=ξλ(q)′′(−log(q))=1,x∈R.

If max{0,βλ}<q<min{1,eβλ−1} and 1−q2−2·q·q−βλ<0, then a real-valued solution Q¯λ(q)(x)=x does not exist and we set x¯0(q):=x¯¯0(q):=−log(q), with ξλ(q)′x¯¯0(q)=1. The above considerations lead to corresponding unique choices of constants a_λ(q),b_λ(q),c_λ(q),a¯λ(q),b¯λ(q),c¯λ(q) culminating in

Q_λ(q)(x):=q2·ex__0(q)·x2+q·x+q−βλ,if0<q<βλ,q2·x2+q·x+q−βλ,ifmax{0,βλ}<q<min{1,eβλ−1}, (127)
Q¯λ(q)(x):=q2·x2+q·x+q−βλ,if0<q<βλ,12·x2+q·x+q−βλ,ifmax{0,βλ}<q<min{1,eβλ−1}. (128)

6.6. Closed-Form Bounds for Power Divergences of Non-Kullback-Leibler-Information-Divergence Type

Analogously to Section 4 (see especially Section 4.1), for orders λ∈R\{0,1} all the results of the previous Section 6.1, Section 6.2, Section 6.3, Section 6.4 and Section 6.5 carry correspondingly over from closed-form bounds of the Hellinger integrals Hλ(·∥·) to closed-form bounds of the total variation distance V(·||·), by virtue of the relation (cf. (12))

21−H12(PA,n∥PH,n)≤V(PA,n∥PH,n)≤21−H12(PA,n∥PH,n)2,

to closed-form bounds of the Renyi divergences Rλ(·∥·), by virtue of the relation (cf. (7))

0≤RλPA,n∥PH,n=1λ(λ−1)logHλPA,n∥PH,n,withlog0:=−∞,

as well as to closed-form bounds of the power divergences Iλ·∥·, by virtue of the relation (cf. (2))

IλPA,n∥PH,n=1−Hλ(PA,n∥PH,n)λ·(1−λ),n∈N.

For the sake of brevity, the–merely repetitive–exact details are omitted.

6.7. Applications to Decision Making

The above-mentioned investigations of the Section 6.1 to Section 6.6 can be applied to the context of Section 2.5 on dichotomous decision making on the space of all possible path scenarios (path space) of Poissonian Galton-Watson processes without (with) immigration GW(I) (e.g., in combination with our running-example epidemiological context of Section 2.3). More detailed, for the minimal mean decision loss (Bayes risk) Rn defined by (18) we can derive explicit closed-form upper (respectively lower) bounds by using (19) respectively (20) together with the results of the Section 6.1, Section 6.2, Section 6.3, Section 6.4 and Section 6.5 concerning Hellinger integrals of order λ∈]0,1[; we can proceed analogously in the Neyman-Pearson context in order to deduce closed-form bounds of type II error probabilities, by means of (23) and (24). Moreover, in an analogous way we can employ the investigations of Section 6.6 on power divergences in order to obtain closed-form bounds of (i) the corresponding (cf. (21)) weighted-average decision risk reduction (weighted-average statistical information measure) about the degree of evidence deg concerning the parameter θ that can be attained by observing the GW(I)-path Xn until stage n, as well as (ii) the corresponding (cf. (22)) limit decision risk reduction (limit statistical information measure). For the sake of brevity, the–merely repetitive–exact details are omitted.

7. Hellinger Integrals and Power Divergences of Galton-Watson Type Diffusion Approximations

7.1. Branching-Type Diffusion Approximations

One can show that a properly rescaled Galton-Watson process without (respectively with) immigration GW(I) converges weakly to a diffusion process X˜:=X˜s,s∈[0,∞[ which is the unique, strong, nonnegative – and in case of ησ2≥12 strictly positive– solution of the stochastic differential equation (SDE) of the form

dX˜s=η−κX˜sds+σX˜sdWs,s∈[0,∞[,X˜0∈]0,∞[given, (129)

where η∈[0,∞[, κ∈[0,∞[, σ∈]0,∞[ are constants and Ws,s∈[0,∞[ denotes a standard Brownian motion with respect to the underlying probability measure P; see e.g., Feller [130], Jirina [131], Lamperti [132,133], Lindvall [134,135], Grimvall [136], Jagers [56], Borovkov [137], Ethier & Kurtz [138], Durrett [139] for the non-immigration case corresponding to η=0, κ≥0, Kawazu & Watanabe [140], Wei & Winnicki [141], Winnicki [64] for the immigration case corresponding to η≠0, κ=0, as well as Sriram [142] for the general case η∈[0,∞[, κ∈R. Feller-type branching processes of the form (129), which are special cases of continuous state branching processes with immigration (see e.g., Kawazu & Watanabe [140], Li [143], as well as Dawson & Li [144] for imbeddings to affine processes) play for instance an important role in the modelling of the term structure of interest rates, cf. the seminal Cox-Ingersoll-Ross CIR model [145] and the vast follow-up literature thereof. Furthermore, (129) is also prominently used as (a special case of) Cox & Ross’s [146] constant elasticity of variance CEV asset price process, as (part of) Heston’s [147] stochastic asset-volatility framework, as a model of neuron activity (see e.g., Lansky & Lanska [148], Giorno et al. [149], Lanska et al. [150], Lansky et al [151], Ditlevsen & Lansky [152], Höpfner [153], Lansky & Ditlevsen [154]), as a time-dynamic description of the nitrous oxide emission rate from the soil surface (see e.g., Pedersen [155]), as well as a model for the individual hazard rate in a survival analysis context (see e.g., Aalen & Gjessing [156]).

Along these lines of branching-type diffusion limits, it makes sense to consider the solutions of two SDEs (129) with different fixed parameter sets (η,κA,σ) and (η,κH,σ), determine for each of them a corresponding approximating GW(I), investigate the Hellinger integral between the laws of these two GW(I), and finally calculate the limit of the Hellinger integral (bounds) as the GW(I) approach their SDE solutions. Notice that for technicality reasons (which will be explained below), the constants η and σ ought to be independent of A, H in our current context.

In order to make the above-mentioned limit procedure rigorous, it is reasonable to work with appropriate approximations such that in each convergence step m one faces the setup PNI∪PSP,1 (i.e., the non-immigration or the equal-fraction case), where the corresponding Hellinger integral can be calculated exactly in a recursive way, as stated in Theorem 1. Let us explain the details in the following.

Consider a sequence of GW(I) X(m)m∈N with probability laws P•(m) on a measurable space (Ω,F), where as above the subscript • stands for either the hypothesis H or the alternative A. Analogously to (1), we use for each fixed step m∈N the representation X(m):=Xℓ(m),ℓ∈N with

Xℓ(m):=∑j=1Xℓ−1(m)Yℓ−1,j(m)+Y˜ℓ(m),ℓ∈N,X0(m)∈Ngiven, (130)

where under the law P•(m)

  • the collection Y(m):=Yi,j(m),i∈N0,j∈N consists of i.i.d. random variables which are Poisson distributed with parameter β•(m)>0,

  • the collection Y˜(m):=Y˜i(m),i∈N consists of i.i.d. random variables which are Poisson distributed with parameter α•(m)≥0,

  • Y(m) and Y˜(m) are independent.

From arbitrary drift-parameters η∈[0,∞[, κ•∈[0,∞[, and diffusion-term-parameter σ>0, we construct the offspring-distribution-parameter and the immigration-distribution parameter of the sequence Xℓ(m)ℓ∈N by

β•(m):=1−κ•σ2mandα•(m):=β•(m)·ησ2. (131)

Here and henceforth, we always assume that the approximation step m is large enough to ensure that β•(m)∈]0,1] and at least one of βA(m), βH(m) is strictly less than 1; this will be abbreviated by m∈N¯. Let us point out that – as mentioned above–our choice entails the best-to-handle setup PNI∪PSP,1 (which does not happen if instead of η one uses η• with ηA≠ηH). Based on the GW(I) X(m), let us construct the continuous-time branching process X˜(m):=X˜s(m),s∈[0,∞[ by

X˜s(m):=1mXσ2ms(m), (132)

living on the state space E(m):=1mN0. Notice that X˜(m) is constant on each time-interval [kσ2m,k+1σ2m[ and takes at s=kσ2m the value 1mXk(m) of the k-th GW(I) generation size, divided by m, i.e., it “jumps” with the jump-size 1mXk(m)−Xk−1(m) which is equal to the 1m-fold difference to the previous generation size. From (132) one can immediately see the necessity of having σ to be independent of A, H because for the required law-equivalence in (the corresponding version of) (13) both models at stake have to “live” on the same time-scale τs(m):=σ2ms. For this setup, one obtains the following convergenc result:

Theorem 10.

Let η∈[0,∞[, κ•∈[0,∞[, σ∈]0,∞[ and X˜(m) be as defined in (130) to (132). Furthermore, let us suppose that limm→∞1mX0(m)=X˜0>0 and denote by d([0,∞[,[0,∞[) the space of right-continuous functions f:[0,∞[↦[0,∞[ with left limits. Then the sequence of processes X˜(m)m∈N¯ convergences in distribution in d([0,∞[,[0,∞[) to a diffusion process X˜ which is the unique strong, nonnegative–and in case of ησ2≥12 strictly positive–solution of the SDE

dX˜s=η−κ•X˜sds+σX˜sdWs•,s∈[0,∞[,X˜0∈]0,∞[given, (133)

where Ws•,s∈[0,∞[ denotes a standard Brownian motion with respect to the limit probability measure P˜•.

Remark 8.

Notice that the condition ησ2≥12 can be interpreted in our approximation setup (131) as α•(m)≥β•(m)/2, which quantifies the intuitively reasonable indication that if the probability P•[Y˜ℓ(m)=0]=e−α•(m) of having no immigration is small enough relative to the probability P•[Yℓ−1,k(m)=0]=e−β•(m) of having no offspring (m∈N¯), then the limiting diffusion X˜ never hits zero almost surely.

The corresponding proof of Theorem 10–which is outlined in Appendix A.4–is an adaption of the proof of Theorem 9.1.3 in Ethier & Kurtz [138] which deals with drift-parameters η=0, κ•=0 in the SDE (133) whose solution is approached on a σ–independent time scale by a sequence of (critical) Galton-Watson processes without immigration but with general offspring distribution with mean 1 and variance σ. Notice that due to (131) the latter is inconsistent with our Poissonian setup, but this is compensated by our chosen σ–dependent time scale. Other limit investigations for (133) involving offspring/immigration distributions and parametrizations which are also incompatible to ours, are e.g., treated in Sriram [142].

As illustration of our proposed approach, let us give the following

Example 3.

Consider the parameter setup (η,κ•,σ)=(5,2,0.4) and initial generation size X˜0=3. Figure 4 shows the diffusion-approximation X˜s(m) (blue) of the corresponding solution X˜s of the SDE (133) up to the time horizon T=10, for the approximation steps m∈{13,50,200,1000}. Notice that in this setup there holds N¯={k∈N:k≥13} (recall that N¯ is the subset of the positive integers such that β•(m)=1−κ•σ2·m>0). The “long-term mean” of the limit process X˜s is ηκ•=2.5 and is indicated as red line. The “long-term mean” of the approximations X˜s(m) is equal to α•(m)1−β•(m)=ηκ•−ησ2·m=2.5−31.25/m and is displayed as green line.

Figure 4.

Figure 4

Simulation of the process X˜s(m) for the approximation steps m∈{13,50,200,1000} in the parameter setup (η,κ•,σ)=(5,2,0.4) and with initial starting value X˜0=3.

7.2. Bounds of Hellinger Integrals for Diffusion Approximations

For each approximation step m and each observation horizon t∈[0,∞[, let us now investigate the behaviour of the Hellinger integrals HλPA,t(m),CdA∥PH,t(m),CdA, where P•,t(m),CdA denotes the canonical law (under H resp. A) of the continuous-time diffusion approximationX˜(m) (cf. (132)), restricted to [0,t]. It is easy to see that HλPA,t(m),CdA∥PH,t(m),CdA coincides with HλPA,σ2mt(m)∥PH,σ2mt(m) of the law restrictions of the GW(I) generations sizes Xℓ(m)ℓ∈{0,…,σ2mt}, where σ2mtσ2m can be interpreted as the last “jump-time” of X˜(m) before t. These Hellinger integrals obey the results of

  • the Propositions 2 and 3 (for η=0) respectively the Propositions 4 and 5 (for η∈]0,∞[), as far as recursively computable exact values are concerned,

  • Theorem 5 as far as closed-form bounds are concerned; recall that the current setup is of type PNI∪PSP,1, and thus we can use the simplifications proposed in the Remark 7(a).

In order to obtain the desired Hellinger integral limits limm→∞HλPA,σ2mt(m)∥PH,σ2mt(m), one faces several technical problems which will be described in the following. To begin with, for fixed m∈N¯ we apply the Propositions 2(b), 3(b), 4(b), 5(b) to the current setup (βA(m),βH(m),αA(m),αH(m))∈PNI∪PSP,1 with

β•(m):=β•(m,κ•,σ2):=1−κ•σ2mandα•(m):=α•(m,κ•,σ2,η):=β•(m)·ησ2(cf.(131)).

Notice that η=0 corresponds to the no-immigration (NI) case and that α•(m)β•(m)=ησ2. Accordingly, we set αλ(m):=λ·αA(m)+(1−λ)·αH(m),βλ(m):=λ·βA(m)+(1−λ)·βH(m). By using

qλ(m):=q(m,κ•,σ2,λ):=βA(m)λβH(m)1−λ,λ∈R\{0,1}, (134)

as well as the connected sequence an(m)n∈N:=an(qλ(m))n∈N we arrive at the

Corollary 13.

For all βA(m),βH(m),αA(m),αH(m),λ∈(PNI∪PSP,1)×(R\{0,1}) and all population sizes X0(m)∈N there holds

hλ(m):=HλPA,σ2mt(m)∥PH,σ2mt(m)=expaσ2mt(qλ(m))·X0(m)+ησ2∑k=1σ2mtak(qλ(m)) (135)

with η=0 in the NI case.

In the following, we employ the SDE-parameter constellations (which are consistent with (131) in combination with our requirement to work here only on (PNI∪PSP,1))

P˜NI:=(κA,κH,η),η=0,κA∈[0,∞[,κH∈[0,∞[,κA≠κH, (136)
P˜SP,1:=(κA,κH,η),η>0,κA∈[0,∞[,κH∈[0,∞[,κA≠κH. (137)

Due to the–not in closed-form representable–recursive nature of the sequences an(q)n∈N defined by (36), the calculation of limm→∞hλ(m) in (135) seems to be not (straightforwardly) tractable; after all, one “has to move along” a sequence of recursions (roughly speaking) since σ2mt→∞ as m tends to infinity. One way to “circumvent” such technical problems is to compute instead of the limit limm→∞hλ(m) of the (exact values of the) Hellinger integrals hλ(m), the limits of the corresponding (explicit) closed-form lower resp. upper bounds adapted from Theorem 5. In order to achieve this, one first needs a preparatory step, due to the fact that the sequence aσ2mt(qλ(m))m∈N¯ (and hence its bounds leading to closed-form expressions) does not necessarily converge for all λ∈R\[0,1]; roughly, this can be conjectured from the Propositions 3(c) and 5(c) in combination with σ2mt→∞. Correspondingly, for our “sequence-of-recursions” context equipped with the diffusion-limit’s drift-parameter constellations (κA,κH,η) we have to derive a “convergence interval” [λ˜−,λ˜+]\[0,1] which replaces the single-recursion-concerning [λ−,λ+]\[0,1] (cf. Lemma 1). This amounts to

Proposition 15.

For all (κA,κH,η)∈P˜NI∪P˜SP,1 define

0>λ˜−:=−∞,ifκA<κH,−κH2κA2−κH2,ifκA>κH,and1<λ˜+:=κH2κH2−κA2,ifκA<κH,∞,ifκA>κH. (138)

Then, for all (κA,κH,η,λ)∈(P˜NI∪P˜SP,1)×]λ˜−,λ˜+[\[0,1] there holds for all sufficiently large m∈N¯

qλ(m):=1−κAσ2mλ1−κHσ2m1−λ<min1,eβλ(m)−1, (139)

and thus the sequence an(qλ(m))n∈N converges to the fixed point x0(m)∈]0,−logqλ(m)[.

This will be proved in Appendix A.4.

We are now in the position to determine bounds of the Hellinger integral limits limm→∞HλPA,σ2mt(m)∥PH,σ2mt(m) in form of m-limits of appropriate versions of closed-form bounds from Section 6. For the sake of brevity, let us henceforth use the abbreviations x0(m):=x0(qλ(m)), Γ<(m):=Γ<(qλ(m))=qλ(m)2·ex0(m)·x0(m)2, Γ>(m):=Γ>(qλ(m))=qλ(m)2·x0(m)2, d(m),S:=d(qλ(m)),S=x0(m)−(qλ(m)−βλ(m))x0(m) and d(m),T:=d(qλ(m)),T=qλ(m)·ex0(m). By the above considerations, the Theorem 5 (together with Remark 7(a)) adapts to the current setup as follows:

Corollary 14.

(a) For all (κA,κH,η,λ)∈(P˜NI∪P˜SP,1)×]0,1[, all t∈[0,∞[, all approximation steps m∈N¯ and all initial population sizes X0(m)∈N the Hellinger integral can be bounded by

Cλ,X0(m),t(m),L:=exp{x0(m)·X0(m)−ησ2d(m),T1−d(m),T1−d(m),Tσ2mt+x0(m)ησ2·σ2mt+ζ_σ2mt(m)·X0(m)+ησ2·ϑ_σ2mt(m)} (140)
≤HλPA,σ2mt(m)∥PH,σ2mt(m)≤exp{x0(m)·X0(m)−ησ2d(m),S1−d(m),S1−d(m),Sσ2mt+x0(m)ησ2·σ2mt−ζ¯σ2mt(m)·X0(m)−ησ2·ϑ¯σ2mt(m)}=:Cλ,X0(m),t(m),U, (141)

where we define analogously to (98) to (101)

ζ_n(m):=Γ<(m)·d(m),Tn−11−d(m),T·1−d(m),Tn>0, (142)
ϑ_n(m):=Γ<(m)·1−d(m),Tn1−d(m),T2·1−d(m),T1+d(m),Tn1+d(m),T>0, (143)
ζ¯n(m):=Γ<(m)·d(m),Sn−d(m),Tnd(m),S−d(m),T−d(m),Sn−1·1−d(m),Tn1−d(m),T>0, (144)
ϑ¯n(m):=Γ<(m)·d(m),T1−d(m),T·1−d(m),Sd(m),Tn1−d(m),Sd(m),T−d(m),Sn−d(m),Tnd(m),S−d(m),T>0. (145)

Notice that (140) and (141) simplify significantly for (κA,κH,η,λ)∈P˜NI×]0,1[ for which η=0 holds.

(b) For all (κA,κH,η,λ)∈(P˜NI∪P˜SP,1)×]λ˜−,λ˜+[\[0,1] and all initial population sizes X0(m)∈N the Hellinger integral bounds (140) and (141) are valid for all sufficiently large m∈N¯, where the expressions (142) to (145) have to be replaced by

ζ_n(m):=Γ>(m)·d(m),Tn−d(m),S2nd(m),T−d(m),S2>0, (146)
ϑ_n(m):=Γ>(m)d(m),T−d(m),S2·d(m),T·1−d(m),Tn1−d(m),T−d(m),S2·1−d(m),S2n1−d(m),S2>0,ζ¯n(m):=Γ>(m)·d(m),Sn−1·n−1−d(m),Tn1−d(m),T>0, (147)
ϑ¯n(m):=Γ>(m)·[d(m),S−d(m),T1−d(m),S21−d(m),T·1−d(m),Sn (148)
+d(m),T1−d(m),Sd(m),Tn1−d(m),T1−d(m),Sd(m),T−d(m),Sn1−d(m),S·n]. (149)

Let us finally present the desired assertions on the limits of the bounds given in Corollary 14 as the approximation step m tends to infinity, by employing for λ∈]λ˜−,λ˜+[⊋[0,1] the quantities

κλ:=λκA+(1−λ)κHaswellasΛλ:=λκA2+(1−λ)κH2, (150)

for which the following relations hold:

Λλ>κλ>0,forλ∈]0,1[, (151)
0<Λλ<κλ,forλ∈]λ˜−,λ˜+[\[0,1]. (152)

Theorem 11.

Let the initial SDE-value X˜0∈]0,∞[ be arbitrary but fixed, and suppose that limm→∞1mX0(m)=X˜0. Then, for all (κA,κH,η,λ)∈(P˜NI∪P˜SP,1)×]λ˜−,λ˜+[\{0,1} and all t∈[0,∞[ the Hellinger integral limit can be bounded by

Dλ,X˜0,tL:=exp{−Λλ−κλσ2X˜0−ηΛλ1−e−Λλ·t−ησ2Λλ−κλ·t+Lλ(1)(t)·X˜0+ησ2·Lλ(2)(t)} (153)
≤limm→∞HλPA,σ2mt(m)∥PH,σ2mt(m)≤exp{−Λλ−κλσ2X˜0−η12(Λλ+κλ)1−e−12(Λλ+κλ)·t−ησ2Λλ−κλ·t−Uλ(1)(t)·X˜0−ησ2·Uλ(2)(t)}=:dλ,X˜0,tU, (154)

where for the (sub)case of all λ∈]0,1[ and all t≥0

Lλ(1)(t):=Λλ−κλ22σ2·Λλ·e−Λλ·t·1−e−Λλ·t, (155)
Lλ(2)(t):=14·Λλ−κλΛλ2·1−e−Λλ·t2, (156)
Uλ(1)(t):=Λλ−κλ2σ2·e−12(Λλ+κλ)·t−e−Λλ·tΛλ−κλ−e−12(Λλ+κλ)·t1−e−Λλ·t2·Λλ, (157)
Uλ(2)(t):=Λλ−κλ2Λλ·1−e−123Λλ+κλ·t3Λλ+κλ+e−Λλ·t−e−12(Λλ+κλ)·tΛλ−κλ, (158)

and for the remaining (sub)case of all λ∈]λ˜−,λ˜+[\[0,1] and all t≥0

Lλ(1)(t):=Λλ−κλ22σ2·κλ·e−Λλ·t·1−e−κλ·t, (159)
Lλ(2)(t):=Λλ−κλ22·κλ·1−e−Λλ·tΛλ−1−e−(Λλ+κλ)·tΛλ+κλ, (160)
Uλ(1)(t):=Λλ−κλ22·σ2·e−12(Λλ+κλ)·t·t−1−e−Λλ·tΛλ, (161)
Uλ(2)(t):=Λλ−κλ2·Λλ−κλ1−e−12(Λλ+κλ)·tΛλ·Λλ+κλ2+1−e−12(3Λλ+κλ)·tΛλ·3Λλ+κλ−e−12(Λλ+κλ)·tΛλ+κλ·t. (162)

Notice that the components Lλ(i)(t) and Uλ(i)(t)(for i=1,2 and in both cases λ∈]0,1[ and λ∈]λ˜−,λ˜+[\[0,1]) are strictly positive for t>0 and do not depend on the parameter η. Furthermore, the bounds dλ,X˜0,tL and dλ,X˜0,tU simplify significantly in the case (κA,κH,η)∈P˜NI, for which η=0 holds.

This will be proved in Appendix A.4. For the time-asymptotics, we obtain the

Corollary 15.

Let the initial SDE-value X˜0∈]0,∞[ be arbitrary but fixed, and suppose that limm→∞1mX0(m)=X˜0. Then:

(a) For all (κA,κH,η,λ)∈P˜NI×]λ˜−,λ˜+[\{0,1} the Hellinger integral limit converges to

limt→∞limm→∞logHλPA,σ2mt(m)∥PH,σ2mt(m)=−X˜0σ2·Λλ−κλ<0,forλ∈]0,1[,>0,forλ∈]λ˜−,λ˜+[\[0,1].

(b) For all (κA,κH,η,λ)∈P˜SP,1×]λ˜−,λ˜+[\{0,1} the Hellinger integral limit possesses the asymptotical behaviour

limt→∞1tloglimm→∞HλPA,σ2mt(m)∥PH,σ2mt(m)=−ησ2·Λλ−κλ<0,forλ∈]0,1[,>0,forλ∈]λ˜−,λ˜+[\[0,1].

The assertions of Corollary 15 follow immediately by inspecting the expressions in the exponential of (153) and (154) in combination with (155) to (162).

7.3. Bounds of Power Divergences for Diffusion Approximations

Analogously to Section 4 (see especially Section 4.1), for orders λ∈R\{0,1} all the results of the previous Section 7.2 carry correspondingly over from (limits of) bounds of the Hellinger integrals HλPA,σ2mt(m)∥PH,σ2mt(m) to (limits of) bounds of the total variation distance VPA,σ2mt(m)∥PH,σ2mt(m) (by virtue of (12)), to (limits of) bounds of the Renyi divergences RλPA,σ2mt(m)∥PH,σ2mt(m) (by virtue of (7)) as well as to (limits of) bounds of the power divergences IλPA,σ2mt(m)∥PH,σ2mt(m) (by virtue of (2)). For the sake of brevity, the–merely repetitive–exact details are omitted. Moreover, by combining the outcoming results on the above-mentioned power divergences with parts of the Bayesian-decision-making context of Section 2.5, we obtain corresponding assertions on (i) the (cf. (21)) weighted-average decision risk reduction (weighted-average statistical information measure) about the degree of evidence deg concerning the parameter θ that can be attained by observing the GWI-path Xn until stage n, as well as (ii) the (cf. (22)) limit decision risk reduction (limit statistical information measure).

In the following, let us concentrate on the derivation of the Kullback-Leibler information divergence KL (relative entropy) within the current diffusion-limit framework. Notice that altogether we face two limit procedures simultaneously: by the first limit limλ↑1IλPA,σ2mt(m)∥PH,σ2mt(m) we obtain the KL IPA,σ2mt(m)∥PH,σ2mt(m) for every fixed approximation step m∈N¯; on the other hand, for each fixed λ∈]0,1[, the second limit limm→∞IλPA,σ2mt(m)∥PH,σ2mt(m) describes the limit of the power divergence – as the sequence of rescaled and continuously interpolated GW(I)’s X˜s(m)s∈[0,∞[m∈N¯(equipped with probability law PA,σ2mt(m) resp. PH,σ2mt(m) up to time σ2mt) converges weakly to the continuous-time CIR-type diffusion process X˜ss∈[0,∞[ (with probability law P˜A,t resp. P˜H,t up to time t). In Appendix A.4 we shall prove that these two limits can be interchanged:

Theorem 12.

Let the initial SDE-value X˜0∈]0,∞[ be arbitrary but fixed, and suppose that limm→∞1mX0(m)=X˜0. Then, for all (κA,κH,η)∈P˜NI∪P˜SP,1 and all t∈[0,∞[, one gets the Kullback-Leibler information divergence (relative entropy) convergences

limm→∞IPA,σ2mt(m)∥PH,σ2mt(m)=limm→∞limλ↗1IλPA,σ2mt(m)∥PH,σ2mt(m)=κA−κH22σ2·κA·X˜0−ηκA·1−e−κA·t+η·t,ifκA>0,κH22σ2·η2·t2+X˜0·t,ifκA=0,=limλ↗1limm→∞IλPA,σ2mt(m)∥PH,σ2mt(m). (163)

This immediately leads to the following

Corollary 16.

Let the initial SDE-value X˜0∈]0,∞[ be arbitrary but fixed, and suppose that limm→∞1mX0(m)=X˜0. Then, the KL limit (163) possesses the following time-asymptotical behaviour:

(a) For all (κA,κH,η)∈P˜NI (i.e., η=0) one gets

(i)inthecaseκA>0limt→∞limm→∞IPA,σ2mt(m)∥PH,σ2mt(m)=X˜0·(κA−κH)22σ2·κA,(ii)inthecaseκA=0limt→∞limm→∞1t·IPA,σ2mt(m)∥PH,σ2mt(m)=X˜0·κH24σ2.

(b) For all (κA,κH,η)∈P˜SP,1 (i.e., η>0) one gets

(i)inthecaseκA>0limt→∞limm→∞1t·IPA,σ2mt(m)∥PH,σ2mt(m)=η·(κA−κH)22σ2·κA,(ii)inthecaseκA=0limt→∞limm→∞1t2·IPA,σ2mt(m)∥PH,σ2mt(m)=η·κH24σ2.

Remark 9.

In Appendix A.4 we shall see that the proof of the last (limit-interchange concerning) equality in (163) relies heavily on the use of the extra terms Lλ(1)(t),Lλ(2)(t),Uλ(1)(t),Uλ(2)(t) in (153) and (154). Recall that these terms ultimately stem from (manipulations of) the corresponding parts of the “improved closed-form bounds” in Theorem 5, which were derived by using the linear inhomogeneous difference equations a_n(q) resp. a¯n(q) (cf. (92) resp. (94)) instead of the linear homogeneous difference equations an(q),T resp. an(q),S (cf. (78) resp. (79)) as explicit approximates of the sequence an(q). Not only this fact shows the importance of this more tedious approach.

Interesting comparisons of the above-mentioned results in Section 7.2 and Section 7.3 with corresponding information measures of the solutions of the SDE (129) themselves (rather their branching approximations), can be found in Kammerer [157].

7.4. Applications to Decision Making

Analogously to Section 6.7, the above-mentioned investigations of the Section 7.1, Section 7.2 and Section 7.3 can be applied to the context of Section 2.5 on dichotomous decision making about GW(I)-type diffusion approximations of solutions of the stochastic differential Equation (129). For the sake of brevity, the–merely repetitive–exact details are omitted.

Acknowledgments

We are very grateful to the referees for their patience to review this long manuscript, and for their helpful suggestions. Moreover, we would like to thank Andreas Greven for some useful remarks.

Appendix A. Proofs and Auxiliary Lemmas

Appendix A.1. Proofs and Auxiliary Lemmas for Section 3

Lemma A1.

For all real numbers x,y,z>0 and all λ∈R one has

xλy1−λ−λxzλ−1+(1−λ)yzλ≤0,forλ∈]0,1[,=0,forλ∈{0,1},≥0,forλ∈R\[0,1],

with equality in the cases λ∈R\{0,1} iff xy=z.

Proof of Lemma A1.

For fixed x˜:=xzλ−1>0, y˜:=yzλ>0 with x˜≠y˜ we inspect the function g on R defined by g(λ):=x˜λy˜1−λ−(λx˜+(1−λ)y˜) which satisfies g(0)=g(1)=0, g′(0)=y˜log(x˜/y˜)−(x˜−y˜)<y˜((x˜/y˜)−1)−(x˜−y˜)=0 and which is strictly convex. Thus, the assertion follows immediately by taking into account the obvious case x˜=y˜. □

Proof of Properties 1.

Property (P9) is trivially valid. To show (P1) we assume 0<q<βλ, which implies a1(q)=ξλ(q)(0)=q−βλ<0. By induction, ann∈N is strictly negative and strictly decreasing. As stated in (P9), the function ξλ(q) is strictly increasing, strictly convex and converges to −βλ for x→−∞. Thus, it hits the straight line id(x)=x once and only once on the negative real line at x0(q)∈]−βλ,0[ (cf. (44)). This implies that the sequence an(q)n∈N converges to x0(q)∈]−βλ,q−βλ[. Property (P2) follows immediately. In order to prove (P3), let us fix q>max{0,βλ}, implying a1(q)=ξλ(q)(0)=q−βλ>0; notice that in this setup, the special choice q=1 implies min{1,eβλ−1}=eβλ−1<q. By induction, an(q)n∈N is strictly positive and strictly increasing. Since limx→∞ξλ(q)(x)=∞, the function ξλ(q) does not necessarily hit the straight line id(x)=x on the positive real line. In fact, due to strict convexity (cf. (P9)), this is excluded if ξλ(q)′(0)=q≥1. Suppose that q<1. To prove that there exists a positive solution of the equation ξλ(q)(x)=x it is sufficient to show that the unique global minimum of the strict convex function hλ(q)(x):=ξλ(q)(x)−x is taken at some point x0∈]0,∞[ and that hλ(q)(x0)≤0. It holds hλ(q)′(x)=q·ex−1, and therefore hλ(q)′(x)=0 iff x=x0=−logq. We have hλ(q)(−logq)=1−βλ+logq, which is less or equal to zero iff q≤eβλ−1. It remains to show that for q>βλ and q>min1,eβλ−1 the sequence an(q)n∈N grows faster than exponentially, i.e., there do not exist constants c1,c2∈R such that an(q)≤ec1+c2n for all n∈N. We already know that (in the current case) an(q)⟶n→∞∞. Notice that it is sufficient to verify lim supn→∞log(an+1(q))−log(an(q))=∞. For the case βλ≥0 the latter is obtained by

logan+1(q)−logan(q)=log(q−βλ)ean(q)+βλ(ean(q)−1)−logqean−1(q)−βλ≥log(q−βλ)−log(q)+qean−1(q)−βλ−an−1(q)⟶an−1(q)→∞∞.

An analogous consideration works out for the case βλ<0. Property (P4) is trivial, and (P5) to (P8) are direct implications of the already proven properties (P1) to (P4). □

Proof of Lemma 1.

(a) Let βA>0, βH>0 with βA≠βH, λ∈R\]0,1[, βλ:=λβA+(1−λ)βH and qλ:=βAλβH1−λ>max{0,βλ} (cf. Lemma A1). Below, we follow the lines of Linkov & Lunyova [53], appropriately adapted to our context. We have to find those λ∈R\]0,1[ for which the following two conditions hold:

  • (i)

    qλ≤1, i.e., ξλ(qλ)′(0)≤1,

  • (ii)

    qλ≤eβλ−1 (cf.(P3a)), which is equivalent with the existence of a–positive, if (i) is satisfied,–solution of the equation ξλ(qλ)(x)=x.

Notice that the case qλ=1, λ∈R\[0,1], cannot appear in (i), provided that (ii) holds (since due to Lemma A1eβλ−1<eqλ−1=1). For (i), it is easy to check that we have to require

λ<log(βH)log(βH/βA),ifβA>βH,>log(βH)log(βH/βA),ifβA<βH. (A1)

To proceed, straightforward analysis leads to −log(qλ)=argminx∈Rξλ(qλ)(x)−x. To check (ii), we first notice that qλ≤eβλ−1 iff ξλ(qλ)(x)−x≤0 for some x∈R. Hence, we calculate

ξλ(qλ)−log(qλ)+log(qλ)≤0⟺1−λ(βA−βH)−βH+λlogβAβH+log(βH)≤0⟺λ·βH1−βAβH+logβAβH≤βH−1−logβH. (A2)

In order to isolate λ in (A2), one has to find out for which (βA,βH) the term in the square bracket is positive resp. zero resp. negative. To achieve this, we aim for the substitutions x:=βA/βH, β=βH and thus study first the auxiliary function hβ(x):=log(x)−β(x−1), x>0, with fixed parameters β>0. Straightforwardly, we obtain hβ′(x)=x−1−β and hβ′′(x)=−x−2. Thus, the function hβ(·) is strictly concave and attains a maximum at x=β−1. Since additionally hβ(1)=0 and hβ′(1)=1−β, there exists a second solution z(β)≠1 of the equation hβ(x)=0 iff β≠1. Thus, one gets

  • for β=1: for all x>0 there holds hβ(x)≤0, with equality iff x=β−1,

  • for β<1: hβ(x)≥0 iff x∈[1,z(β)], with equality iff x∈{1,z(β)} (notice that z(β)>1),

  • for β>1: hβ(x)≥0 iff x∈[z(β),1], with equality iff x∈{z(β),1} (notice that z(β)<1).

Suppose that λ<0.

Case 1: If βH=1, then condition (ii) is not satisfied whenever βA≠βH, since the right side of (A2) is equal to zero and the left side is strictly greater than zero. Hence, λ−=0.

Case 2: Let βH>1. If βA<βH, then condition (i) is not satisfied and hence λ−=0. If βA>βH, then condition (i) is satisfied iff λ<λ˘˘:=λ˘˘(βA,βH):=log(βH)log(βH/βA)<0. On the other hand, incorporating the discussion of the function hβ(·), we see that hβHβAβH<0. Thus, (A2) implies that condition (ii) is satisfied when λ≥λ˘:=λ˘(βA,βH):=βH−1−logβHβH−βA+logβAβH. We claim that λ˘˘<λ˘ and conclude that the conditions (i) and (ii) are not fulfilled jointly, which leads to λ−=0. To see this, we notice that due to 1<βH<βA we get log(βA)/(βA−1)<log(βH)/(βH−1) and thus

log(βA)(βH−1)<log(βH)(βA−1)⟺βHlog(βH)−βAlog(βH)<βHlog(βH)−βHlog(βA)−log(βH)+log(βA)⟺log(βH)(βH−βA)+log(βH)logβAβH<logβHβA(βH−1)+log(βH)logβAβH⟺log(βH)logβHβA<βH−1−log(βH)βH−βA+logβAβH⟺λ˘˘<λ˘. (A3)

Case 3: Let βH<1. For this, one gets hβHβAβH≥0 for βA∈]βH,βHz(βH)]. Hence, condition (ii) is satisfied if either βA∈]βH,βHz(βH)], or βA∉]βH,βHz(βH)] and λ≥λ˘. If βA>βHz(βH), then condition (i) is trivially satisfied for all λ<0. In the case βA<βH, condition (i) is satisfied whenever λ>λ˘˘. Notice that since 0<βA<βH<1, an analogous consideration as in (A3) leads to λ˘˘<λ˘. This implies that λ−=λ˘. The last case βA∈]βH,βHz(βH)] is easy to handle: since log(βH)log(βH/βA)>0 as well as zβHβAβH>0, both conditions (i) and (ii) hold trivially.

The representation of λ+ follows straightforwardly from the λ−-result and the skew symmetry (8), by employing 1−λ˘(βH,βA)=λ˘(βA,βH). Alternatively, one can proceed analogously to the λ−-case.

Part (b) is much easier to prove: if β•:=βA=βH>0, then for all λ∈R\[0,1] one gets qλ=βAλβH1−λ=β• as well as βλ=β•. Hence, Properties 1 (P2) implies that an(qλ)≡0 and thus it is convergent, independently of the choice λ∈R\[0,1]. □

Proof of Formula (51).

For the parameter constellation in Section 3.10, we employ as upper bound for ϕλ(x) (x∈N0) the function

ϕλ¯(x):=ϕλ(0),ifx=0,0,ifx>0.

Notice that this method is rather crude, and gives in the other cases treated in the Section 3.7, Section 3.8 and Section 3.9 worse bounds than those derived there. Since λ∈]0,1[ and αA≠αH, one has ϕλ(0)<0. In order to derive an upper bound of the Hellinger integral, we first set ϵ¯:=1−eϕλ(0)∈]0,1[. Hence, for all n∈N\{1} we obtain the auxiliary expression

∑xn−1=0∞φλ(xn−2)xn−1xn−1!·expϕλ(xn−1)≤∑xn−1=0∞φλ(xn−2)xn−1xn−1!·expϕλ¯(xn−1)=expφλ(xn−2)−ϵ¯=expφλ(xn−2)·1−ϵ¯·exp−φλ(xn−2).

Moreover, since βA≠βH, one gets limx→∞ϕλ(x)=−∞ (cf. Properties 3 (P20) and Lemma A1). This–together with the nonnegativity of φλ(·)–implies

supx∈N0expϕλ(x)·1−ϵ¯·exp−φλ(x)=:δ¯∈]0,1[.

Incorporating these considerations as well as the formulas (27) to (32), we get for n=1 the relation HλPA,n∥PH,n=exp{ϕλ(x0)}≤1(with equality iff x0=x*=αA−αHβH−βA), and–as a continuation of formula (29)– for all n∈N\{1}(recall that x→:=(x0,x1,…)∈Ω)

HλPA,n∥PH,n=∑x1=0∞⋯∑xn=0∞∏k=1nZn,k(λ)(x→)=∑x1=0∞⋯∑xn−1=0∞∏k=1n−1Zn,k(λ)(x→)·expfA(xn−1)λfH(xn−1)(1−λ)−(λfA(xn−1)+(1−λ)fH(xn−1))=∑x1=0∞⋯∑xn−2=0∞∏k=1n−2Zn,k(λ)(x→)·exp−fλ(xn−2)∑xn−1=0∞φλ(xn−2)xn−1xn−1!·exp{ϕλ(xn−1)}≤∑x1=0∞⋯∑xn−2=0∞∏k=1n−2Zn,k(λ)(x→)·expϕλ(xn−2)·1−ϵ¯·exp−φλ(xn−2)≤δ¯·∑x1=0∞⋯∑xn−2=0∞∏k=1n−2Zn,k(λ)(x→)≤⋯≤δ¯n/2. (A4)

Hence, HλPA,n∥PH,n<1 for (at least) all n∈N\{1}, and limn→∞HλPA,n∥PH,n=0. □

Notice that the above proof method of formula (51) does not work for the parameter setup in Section 3.11, because there one gets δ¯=supx∈N0expϕλ(x)·1−ϵ¯·exp−φλ(x)=1.

Proof of Proposition 9.

In the setup βA,βH,αA,αH,λ∈PSP,4a×]0,1[ we require β•:=βA=βH<1. As a linear upper bound for ϕλ(·), we employ the tangent line at y≥0 (cf. (52))

ϕλ,ytan(x):=(py−αλ)+qy−β•·x:=(pλ,ytan−αλ)+(qλ,ytan−βλ)·x:=ϕλ(y)−y·ϕλ′(y)+ϕλ′(y)·x. (A5)

Since in the current setup PSP,4a the function ϕλ(·) is strictly increasing, the slope ϕλ′(y) of the tangent line at y is positive. Thus we have qy>βλ and Properties 1 (P3) implies that the sequence an(qy)n∈N is strictly increasing and converges to x0(qy)∈]0,−log(qy)] iff qy≤min{1,eβ•−1}=eβ•−1<1 (cf. (P3a)), where x0(qy) is the smallest solution of the equation ξλ(qy)(x)=qy·ex−β•=x. Since qy↘β• for y→∞ (cf. Properties 3 (P18)) and additionally eβ•−1>β•, there exists a large enough y≥0 such that the sequence an(qy)n∈N converges. If this y is also large enough to additionally guarantee h(y)<0 for

h(y):=limn→∞1nlogB˜λ,X0,n(py,qy)=py·ex0(qy)−αλ,

then one can conclude that limn→∞Hλ(PA,n∥PH,n)=0. As a first step, for verifying h(y)<0 we look for an upper bound x¯0(qy) for the fixed point x0(qy) where the latter exists for y≥y1 (say). Notice that

Q¯λ(qy)(x):=12x2+qyx+qy−β•≥qy·ex−β•=ξλ(qy)(x), (A6)

since Q¯λ(qy)(0)=ξλ(qy)(0), Q¯λ(qy)′(0)=ξλ(qy)′(0) and Q¯λ(qy)′′(x)≥ξλ(qy)′′(x) for x∈[0,−log(qy)]. For sufficiently large y≥y2≥y1 (say), we easily obtain the smaller solution of Q¯λ(qy)(x)=x as

x¯0(qy)=(1−qy)−(1−qy)2−2(qy−β•)=(1−ϕλ′(y)−β•)−(1−ϕλ′(y)−β•)2−2ϕλ′(y)≥x0(qy) (A7)

where the expression in the root is positive since qy↘β• for y→∞. We now have

h(y)=py·ex0(qy)−αλ≤py·ex¯0(qy)−αλ=:h¯(y),∀y≥y2. (A8)

Hence, it suffices to show that h¯(y)<0 for some y≥y2. We recall from Properties 3 (P15), (P17) and (P19) that

ϕλ(y)=αA+β•·yλαH+β•·y1−λ−λαA+β•·y−(1−λ)αH+β•·y<0,ϕλ′(y)=λ·β•·αA+β•·yαH+β•·yλ−1+(1−λ)·β•·αA+β•·yαH+β•·yλ−β•>0andthatϕλ′′(y)=−αA+β•·yαH+β•·yλ·λ(1−λ)·β•2·(αA−αH)2(αA+β•·y)2(αH+β•·y)<0, (A9)

which immediately implies limy→∞ϕλ(y)=limy→∞ϕλ′(y)=limy→∞ϕλ′′(y)=0 and with l’Hospital’s rule

limy→∞y·ϕλ(y)=limy→∞−y2·ϕλ′(y)=limy→∞y32·ϕλ′′(y)=−12limy→∞αA+β•·yαH+β•·yλ·λ(1−λ)·β•2·(αA−αH)2(αA/y+β•)2(αH/y+β•)=−12λ(1−λ)·(αA−αH)2β•. (A10)

The formulas (A5), (A7) and (A9) imply the limits limy→∞py=αλ, limy→∞qy=β•, limy→∞x¯0(qy)=0. Notice that py<αλ holds trivially for all y≥0 since the intercept (py−αλ) of the tangent line ϕλ,ytan(·) is negative. Incorporating (A8) we therefore obtain limy→∞h(y)≤limy→∞h¯(y)=0. As mentioned before, for the proof it is sufficient to show that h¯(y)<0 for some y≥y2. This holds true if limy→∞y·h¯(y)<0. To verify this, notice first that from (A5), (A7) and (A8) we get

h¯′(y)=−py·ex¯0(qy)·ϕλ′′(y)·1−2−ϕλ′(y)−β•(1−qy)2−2(qy−β•)−y·ϕλ′′(y)·ex¯0(qy)⟶y→∞0. (A11)

Finally we obtain with (A10)

limy→∞y·h¯(y)=−limy→∞y2·h¯′(y)=limy→∞py·ex¯0(qy)·y2·ϕλ′′(y)·1−2−ϕλ′(y)−β•(1−qy)2−2(qy−β•)+y3·ϕλ′′(y)·ex¯0(qy)=0−λ(1−λ)·(αA−αH)2β•<0.□

Proof of Corollary 1.

Part (a) follows directly from Proposition 1 (a),(b) and the limit limn→∞Hλ(PA,n∥PH,n)=0 in the respective part (c) of the Propositions 7, 8, 9 as well as from (51). To prove part (b), according to (26) we have to verify lim infλ↗1lim infn→∞HλPA,n∥PH,n=1. From part (c) of Proposition 2 we see that this is satisfied iff limλ↑1x0(qλE)=0. Recall that for fixed λ∈]0,1[ we have βλ=λβA+(1−λ)βH>0, qλE=βAλβH1−λ<βλ (cf. Lemma A1) and from Properties 1 (P1) the unique negative solution x0(qλE)∈]−βλ,qλE−βλ[ of ξλ(qλE)(x)=qλEex−βλ=x (cf. (44)). Due to the continuity and boundedness of the map λ↦x0(qλE) (for λ∈[0,1]) one gets that limλ↗1x0(qλE) exists and is the smallest nonpositive solution of βAex−βA=x. From this, the part (b) as well as the non-contiguity in part (c) follow immediately. The other part of (c) is a direct consequence of Proposition 1 (a),(b) and Proposition 2 (c). □

Proof of Formula (59).

One can proceed similarly to the proof of formula (51) above. Recall Hλ(PA,1∥PH,1)=exp{ϕλ(X0)}>1 for X0∈N(cf. (28), Lemma A1 and fA(X0)≠fH(X0) for all X0∈N). For βA,βH,αA,αH,λ∈PSP,2×(R\[0,1]) one gets ϕλ(0)=0,ϕλ(1)>0, and we define for x≥0

ϕλ_(x):=ϕλ(1),ifx=1,0,ifx≠1.

By means of the choice ϵ_:=φλ(1)·eϕλ(1)−1>0, we obtain for all n∈N\{1}

∑xn−1=0∞φλ(xn−2)xn−1xn−1!·expϕλ(xn−1)≥∑xn−1=0∞φλ(xn−2)xn−1xn−1!·expϕλ_(xn−1)=expφλ(xn−2)+ϵ_=expφλ(xn−2)·1+ϵ_·exp−φλ(xn−2).

Incorporating

infx∈N0expϕλ(x)·1+ϵ_·exp−φλ(x)=:δ_>1,

one can show analogously to (A4) that

HλPA,n∥PH,n≥⋯≥δ_n/2⟶n→∞∞.□

Proof of the Formulas (61), (63) and (64).

In the following, we slightly adapt the above-mentioned proof of formula (59). Let us define

ϕλ_(x):=ϕλ(0),ifx=0,0,ifx>0.

In all respective subcases one clearly has ϕλ_(0)=ϕλ(0)>0. With ϵ_:=eϕλ(0)−1>0 we obtain for all n∈N\{1}

∑xn−1=0∞φλ(xn−2)xn−1xn−1!·expϕλ(xn−1)≥∑xn−1=0∞φλ(xn−2)xn−1xn−1!·expϕλ_(xn−1)=expφλ(xn−2)+ϵ_=expφλ(xn−2)·1+ϵ_·exp−φλ(xn−2).

By employing

infx∈N0expϕλ(x)·1+ϵ_·exp−φλ(x)=:δ_>1, (A12)

one can show analogously to (A4) that

HλPA,n∥PH,n≥⋯≥δ_n/2⟶n→∞∞.

Notice that this method does not work for the parameter cases PSP,4a∪PSP,4b, since there the infimum in (A12) is equal to one. □

Proof of Proposition 13.

In the setup βA,βH,αA,αH,λ∈PSP,4a×(R\[0,1]) we require β•:=βA=βH<1. As in the proof of Proposition 9, we stick to the tangent line ϕλ,ytan(·) at y≥0 (cf. (52)) as a linear lower bound for ϕλ(·), i.e., we use the function

ϕλ,ytan(x):=py−αλ+qy−β•·x:=pλ,ytan−αλ+qλ,ytan−βλ·x:=ϕλ(y)−y·ϕλ′(y)+ϕλ′(y)·x. (A13)

As already mentioned in Section 3.21, on PSP,4a the function ϕλ(·) is strictly decreasing and converges to 0. Thus, for all y≥0 the slope ϕλ′(y) of the tangent line at y is negative, which implies that qy<βλ=β•. For λ∈R\[0,1] there clearly may hold qy<0 for some y∈R. However, there exists a sufficiently large y1>0 such that qy>0 for all y>y1, since limy→∞ϕλ′(y)=0 and hence qy↗β•>0 for y→∞. Thus, let us suppose that y>y1. Then, the sequence an(qy)n∈N is strictly negative, strictly decreasing and converges to x0(qy)∈]−β•,qy−β•[ (cf. Properties 1 (P1)). If there is some y≥y1 such that h(y)>0 with

h(y):=limn→∞1nlogB˜λ,X0,n(py,qy)=py·ex0(qy)−αλ,

then one can conclude that limn→∞Hλ(PA,n∥PH,n)=∞. Let us at first consider the case αλ≥0. By employing py↘αλ for y→∞, one gets py>0 for all y≥0. Analogously to the proof of Proposition 9, we now look for a lower bound x_0(qy) of the fixed point x0(qy). Notice that x0(qy)>−β• implies

Q_λ(qy)(x):=e−β•2·qy·x2+qy·x+qy−β•≤qy·ex−β•=ξλ(qy)(x), (A14)

since Q_λ(qy)(0)=ξλ(qy)(0)<0, Q_λ(qy)′(0)=ξλ(qy)′(0)>0 and 0<Q_λ(qy)′′(x)<ξλ(qy)′′(x) for x∈]−β•,0]. Thus, the negative solution x_0(qy) of the equation Q_λ(qy)(x)=x (which definitely exists) implies that there holds x_0(qy)≤x0(qy). We easily obtain

x_0(qy)=eβ•qy(1−qy)−(1−qy)2−2e−β•qy(qy−β•)=eβ•ϕλ′(y)+β•(1−ϕλ′(y)−β•)−(1−ϕλ′(y)−β•)2−2·e−β•qy·ϕλ′(y)<0. (A15)

Since

h(y)=py·ex0(qy)−αλ≥py·ex_0(qy)−αλ=:h_(y), (A16)

it is sufficient to show h_(y)>0 for some y>y1. We recall from Properties 3 (P15), (P17) and (P19) that

ϕλ(y)=αA+β•·yλαH+β•·y1−λ−λαA+β•·y−(1−λ)αH+β•·y>0,ϕλ′(y)=λ·β•·αA+β•·yαH+β•·yλ−1+(1−λ)·β•·αA+β•·yαH+β•·yλ−β•<0andϕλ′′(y)=−αA+β•·yαH+β•·yλ·λ(1−λ)·β•2·(αA−αH)2(αA+β•·y)2(αH+β•·y)>0, (A17)

which immediately implies limy→∞ϕλ(y)=limy→∞ϕλ′(y)=limy→∞ϕλ′′(y)=0, and by means of l’Hospital’s rule

limy→∞y·ϕλ(y)=limy→∞−y2·ϕλ′(y)=limy→∞y32·ϕλ′′(y)=−12limy→∞αA+β•·yαH+β•·yλ·λ(1−λ)·β•2·(αA−αH)2(αA/y+β•)2(αH/y+β•)=−12λ(1−λ)·(αA−αH)2β•. (A18)

The Formulas (A13), (A15), (A17) imply the limits limy→∞py=αλ, limy→∞qy=β• and limy→∞x_0(qy)=0 iff β•≤1. The latter is due to the fact that for β•>1 one gets with (A15) limy→∞x_0(qy)=eβ•β•(1−β•)−(1−β•)2=eβ•β•2−2β•≠0. In the following, let us assume β•<1 (the reason why we exclude the case β•=1 is explained below). One gets limy→∞h(y)≥limy→∞h_(y)=0. Since we have to prove that h_(y)>0 for some y>y1, it is sufficient to show that limy→∞y·h_(y)>0. To verify the latter, we first derive with l’Hospital’s rule and with (A17), (A18)

limy→∞y·1−ex_0(qy)=limy→∞y2·ex_0(qy)·∂∂yx_0(qy)=limy→∞{y2·−eβ•·ϕλ′′(y)ϕλ′(y)+β•2·(1−qy)−(1−qy)2−2e−β•qy(qy−β•)+eβ•qy·−y2·ϕλ′′(y)−−2y2ϕλ′′(y)(1−qy)−2y2ϕλ′′(y)e−β•qy−2y2ϕλ′′(y)e−β•ϕλ′(y)2·(1−qy)2−2e−β•qy(qy−β•)}=0. (A19)

Notice that without further examination this limit would not necessarily hold for β•=1, since then the denominator in (A19) converges to zero. With (A13), (A16), (A18) and (A19) we finally obtain

limy→∞y·h_(y)=limy→∞y·ϕλ(y)−y2·ϕλ′(y)·ex_0(qy)−y·1−ex_0(qy)αλ=−λ(1−λ)(αA−αH)2β•>0. (A20)

Let us now consider the case αλ<0. The proof works out almost completely analogous to the case αλ≥0. We indicate the main differences. Since py↘αλ<0 and qy↗β•∈]0,1[ for y→∞, there is a sufficiently large y2>y1, such that py<0 and qy>0. Thus,

Q¯λ(qy)(x):=qy2·x2+qy·x+qy−β•≥ξλ(qy)(x)=qyex−β•forx∈]−∞,0].

The corresponding (existing) smaller solution of Q¯λ(qy)(x)=x is

x¯0(qy)=1qy(1−qy)−(1−qy)2−2qy(qy−β•),

having the same form as the solution (A15) with e−β• substituted by 1. Notice that there clearly holds x0(qy)<x¯0(qy)<0. However, since py<0, we now get h(y)=py·ex0(qy)−αλ≥py·ex¯0(qy)−αλ=:h_(y), as in (A16). Since all calculations (A17) to (A20) remain valid (with e−β• substituted by 1), this proof is finished. □

Appendix A.2. Proofs and Auxiliary Lemmas for Section 5

We start with two lemmas which will be useful for the proof of Theorem 3. They deal with the sequence an(qλ)n∈N from (36).

Lemma A2.

For arbitrarily fixed parameter constellation βA,βH,αA,αH,λ∈P×]0,1[, suppose that qλ>0 and limλ↗1qλ=βA holds. Then one gets the limit

∀n∈N:limλ↗1an(qλ)=0. (A21)

Proof. 

This can be easily seen by induction: for n=1 there clearly holds

limλ↗1a1(qλ)=limλ↗1(qλ−βλ)=βA−βA=0.

Assume now that limλ↗1ak(qλ)=0 holds for all k∈N, k≤n−1, then

limλ↗1an(qλ)=limλ↗1(qλ·ean−1(qλ)−βλ)=βA·1−βA=0.□

Lemma A3.

In addition to the assumptions of Lemma A2, suppose that λ↦qλ is continuously differentiable on ]0,1[ and that the limit l:=limλ↗1∂qλ∂λ is finite. Then, for all n∈N one obtains

limλ↗1∂an(qλ)∂λ=un:=l+βH−βA1−βA·1−βAn,ifβA≠1,n·l+βH−1,ifβA=1, (A22)

which is the unique solution of the linear recursion equation

un=l+βH−βA+βA·un−1,u0=0. (A23)

Furthermore, for all n∈N there holds

∑k=1nlimλ↗1∂ak(qλ)∂λ=∑k=1nuk=l+βH−βA1−βA·n−βA1−βA1−βAn,ifβA≠1,n·(n+1)2·l+βH−1,ifβA=1.

Proof. 

Clearly, un defined by (A22) is the unique solution of (A23). We prove by induction that limλ↗1∂an(qλ)∂λ=un holds. For n=1 one gets

limλ↗1∂a1(qλ)∂λ=limλ↗1∂(qλ−βλ)∂λ=l−(βA−βH)=u1.

Suppose now that (A22) holds for all k∈N, k≤n−1. Then, by incorporating (A21) we obtain

limλ↗1∂an(qλ)∂λ=limλ↗1∂∂λqλ·ean−1(qλ)−βλ=limλ↗1ean−1(qλ)·∂qλ∂λ+qλ∂an−1(qλ)∂λ−(βA−βH)=l−(βA−βH)+βA·un−1=un.

The remaining assertions follow immediately. □

We are now ready to give the

Proof of Theorem 3.

(a) Recall that for the setup βA,βH,αA,αH∈(PNI∪PSP,1) we chose the intercept as pλ:=pλE:=αAλαH1−λ and the slope as qλ:=qλE:=βAλβH1−λ, which in (39) lead to the exact value Vλ,X0,n of the Hellinger integral. Because of pλqλβλ−αλ=0 as well as limλ↗1qλ=βA, we obtain by using (38) and Lemma A2 for all X0∈N and for all n∈N

limλ↗1Vλ,X0,n:=limλ↗1expan(qλ)·X0+∑k=1nbk(pλ,qλ)=limλ↗1expan(qλ)·X0+αAβA∑k=1nak(qλ)=1,

which leads by (68) to

I(PA,n∥PH,n)=limλ↗11−Hλ(PA,n∥PH,n)λ·(1−λ)=limλ↗11−Vλ,X0,nλ·(1−λ)=limλ↗1−Vλ,X0,n1−2λ·∂∂λan(qλ)·X0+pλqλ∑k=1nak(qλ)=limλ↗1∂an(qλ)∂λ·X0+∂∂λpλqλ·∑k=1nak(qλ)+pλqλ·∑k=1n∂ak(qλ)∂λ. (A24)

For further analysis, we use the obvious derivatives

∂pλ∂λ=pλlogαAαH,∂∂λpλqλ=pλqλlogαAβHαHβA,∂qλ∂λ=qλlogβAβH, (A25)

where the subcase βA,βH,αA,αH∈PNI (with pλ≡0) is consistently covered. From (A25) and Lemma A3 we deduce

limλ↗1∂an(qλ)∂λ·X0=βAlogβAβH−(βA−βH)·1−βAn1−βA·X0,ifβA≠1,n·βAlogβAβH−(βA−βH)·X0,ifβA=1,

and by means of (A21)

∀n∈N:limλ↗1∂∂λpλqλ·∑k=1nak(qλ)=0.

For the last expression in (A24) we again apply Lemma A3 to end up with

limλ↗1pλqλ·∑k=1n∂∂λak(qλ)=αA·βAlogβAβH−(βA−βH)βA(1−βA)·n−βA1−βA1−βAn,ifβA≠1,n·(n+1)αA2βA·βAlogβAβH−(βA−βH),ifβA=1, (A26)

which finishes the proof of part (a). To show part (b), for the corresponding setup βA,βH,αA,αH∈PSP\PSP,1 let us first choose – according to (45) in Section 3.4—the intercept as pλ:=pλL:=αAλαH1−λ and the slope as qλ:=qλL:=βAλβH1−λ, which in part (b) of Proposition 6 lead to the lower bounds Bλ,X0,nL of the Hellinger integral. This is formally the same choice as in part (a) satisfying limλ↗1pλ=αA, limλ↗1qλ=βA but in contrast to (a) we now have pλqλβλ−αλ≠0 but nevertheless

limλ↗1pλqλβλ−αλ=0.

From this, (38), part (b) of Proposition 6 and Lemma A2 we obtain

limλ↗1Bλ,X0,nL=limλ↗1expan(qλ)·X0+pλqλ∑k=1nak(qλ)+n·pλqλβλ−αλ=1 (A27)

and hence

I(PA,n∥PH,n)≤limλ↗11−Bλ,X0,nLλ·(1−λ)=limλ↗1−Bλ,X0,nL1−2λ·∂∂λan(qλ)X0+pλqλ∑k=1nak(qλ)+npλqλβλ−αλ=limλ↗1∂an(qλ)∂λX0+∂∂λpλqλ∑k=1nak(qλ)+pλqλ∑k=1n∂ak(qλ)∂λ+n∂∂λpλqλβλ−αλ. (A28)

In the current setup, the first three expressions in (A28) can be evaluated in exactly the same way as in (A25) to (A26), and for the last expression one has the limit

∂∂λpλqλβλ−αλ=pλqλlogαAβHαHβA·βλ+pλqλ·βA−βH−αA−αH⟶λ↗1αAlogαAβHαHβA−βHβA+αH,

which finishes the proof of part (b). □

Proof of Theorem 4.

Let us fix βA,βH,αA,αH∈PSP\PSP,1, X0∈N, n∈N and y∈[0,∞[. The lower bound Ey,X0,nL,tan of the Kullback-Leibler information divergence (relative entropy) is derived by using ϕλU≡ϕλ,ytan (cf. (52)), which corresponds to the tangent line of ϕλ at y, as a linear upper bound for ϕλ (λ∈]0,1[). More precisely, one gets ϕλU(x):=(pλU−αλ)+(qλU−βλ)x (x∈[0,∞[) with pλ:=pλ(y):=ϕλ(y)−yϕλ′(y)+αλ and qλ:=qλ(y):=ϕλ′(y)+βλ, implying qλ>0 because of Properties 3 (P17). Analogously to (A27) and (A28), we obtain from (38) and (40) the convergence limλ↗1Bλ,X0,nU=1 and thus

I(PA,n∥PH,n)≥limλ↗1∂an(qλ)∂λX0+∂∂λpλqλ∑k=1nak(qλ)+pλqλ∑k=1n∂ak(qλ)∂λ+n∂∂λpλqλβλ−αλ. (A29)

As before, we compute the involved derivatives. From (30) to (32) as well as (P17) we get

∂pλ∂λ=fA(y)fH(y)λfH(y)logfA(y)fH(y)−βAyfA(y)fH(y)λ−1−λβAyfA(y)fH(y)λ−1logfA(y)fH(y)+βHyfA(y)fH(y)λ−(1−λ)βHyfA(y)fH(y)λlogfA(y)fH(y)⟶λ↗1αAlogfA(y)fH(y)+y·(αAβH−αHβA)fH(y), (A30)

and

∂qλ∂λ=βAfA(y)fH(y)λ−1+λβAfA(y)fH(y)λ−1logfA(y)fH(y)−βHfA(y)fH(y)λ+(1−λ)βHfA(y)fH(y)λlogfA(y)fH(y)⟶λ↗1βA1+logfA(y)fH(y)−βHfA(y)fH(y)=:l. (A31)

Combining these two limits we get

∂∂λpλqλβλ−αλ=qλ∂pλ∂λ−pλ∂qλ∂λ(qλ)2·βλ+pλqλ·βA−βH−αA−αH⟶λ↗1y·(αAβH−αHβA)fH(y)−αA1−βHfA(y)βAfH(y)+αH−αAβHβA.=αH−αAβHβA1−fA(y)fH(y). (A32)

The above calculation also implies that limλ↗1∂∂λpλqλ is finite and thus limλ↗1∂∂λpλqλ∑k=1nak(qλ)=0 by means of Lemma A2. The proof of I(PA,n∥PH,n)≥Ey,X0,nL,tan is finished by using Lemma A3 with l defined in (A31) and by plugging the limits (A30) to (A32) in (A29).

To derive the lower bound Ek,X0,nL,sec (cf. (73)) for fixed k∈N0, we use as a linear upper bound ϕλU for ϕλ(·) (λ∈]0,1[) the secant line ϕλ,ksec (cf. (53)) of ϕλ across its arguments k and k+1, corresponding to the choices pλ:=pλ,ksec=(k+1)·ϕλ(k)−k·ϕλ(k+1)+αλ and qλ:=qλ,ksec:=ϕλ(k+1)−ϕλ(k)+βλ, implying qλ>0 because of Properties 3 (P18). As a side remark, notice that this ϕλU(x) may become positive for some x∈[0,∞[ (which is not always consistent with Goal (G1) for fixed λ, but leads to a tractable limit bound as λ tends to 1). Analogously to (A27) and (A28) we get again limλ↗1Bλ,X0,nU=1, which leads to the lower bound given in (A29) with appropriately plugged-in quantities. As in the above proof of the lower bound Ey,X0,nL,tan, the inequality I(PA,n∥PH,n)≥Ek,X0,nL,sec follows straightforwardly from Lemma A2, Lemma A3 and the three limits

∂pλ∂λ=fA(k)fH(k)λfH(k)·(k+1)logfA(k)fH(k)−fA(k+1)fH(k+1)λfH(k+1)·klogfA(k+1)fH(k+1)⟶λ↗1fA(k)(k+1)logfA(k)fH(k)−fA(k+1)klogfA(k+1)fH(k+1),∂qλ∂λ=fA(k+1)fH(k+1)λfH(k+1)logfA(k+1)fH(k+1)−fA(k)fH(k)λfH(k)logfA(k)fH(k)⟶λ↗1fA(k+1)logfA(k+1)fH(k+1)−fA(k)logfA(k)fH(k)=:l,and∂∂λpλqλβλ−αλ=qλ∂pλ∂λ−pλ∂qλ∂λ(qλ)2·βλ+pλqλ·βA−βH−αA−αH⟶λ↗1fA(k)logfA(k)fH(k)k+1+αAβA−fA(k+1)logfA(k+1)fH(k+1)k+αAβA−αAβHβA+αH.

To construct the third lower bound EX0,nL,hor (cf. (74)), we start by using the horizontal line ϕλhor(·) (cf. (54)) as an upper bound of ϕλ. For each fixed λ∈]0,1[, it is defined by the intercept supx∈N0ϕλ(x). On PSP,3a∪PSP,3b, this supremum is achieved at the finite integer point zλ*:=argmaxx∈N0ϕλ(x) (since limx→∞ϕλ(x)=−∞) and there holds ϕλ(zλ*)<0 which leads with the parameters qλ=βλ, pλ=ϕλ(zλ*)+αλ to the Hellinger integral upper bound Bλ,X0,nU=expϕλ(zλ*)·n<1 (cf. Remark 1 (b)). We strive for computing the limit limλ↗11−Bλ,X0,nUλ(1−λ), which is not straightforward to solve since in general it seems to be intractable to express zλ* explicitly in terms of λ. To circumvent this problem, we notice that it is sufficient to determine zλ* in a small ϵ–environment ]1−ϵ,1[. To accomplish this, we incorporate limλ↗1ϕλ(x)=0 for all x∈[0,∞[ and calculate by using l’Hospital’s rule

limλ↗1ϕλ(x)1−λ=(αA+βAx)−logαA+βAxαH+βHx+1−(αH+βHx).

Accordingly, let us define z*:=argmaxx∈N0(αA+βAx)−logαA+βAxαH+βHx+1−(αH+βHx) (note that the maximum exists since limx→∞(αA+βAx)−logαA+βAxαH+βHx+1−(αH+βHx)=−∞). Due to continuity of the function (λ,x)↦ϕλ(x)1−λ, there exists an ϵ>0 such that for all λ∈]1−ϵ,1[ there holds zλ*=z*. Applying these considerations, we get with l’Hospital’s rule

I(PA,n∥PH,n)≥limλ↗11−expϕλ(z*)·nλ(1−λ)=fA(z*)·logfA(z*)fH(z*)−1+fH(z*)·n≥0. (A33)

In fact, for the current parameter constellation PSP,3a∪PSP,3b we have ϕλ(x)<0 for all λ∈]0,1[ and all x∈N0 which implies fA(z*)≠fH(z*) by Lemma A1; thus, we even get EX0,nL,hor>0 for all n∈N by virtue of the inequality −logfH(z*)fA(z*)>−fH(z*)fA(z*)+1.

For the case PSP,2, the above-mentioned procedure leads to zλ*=0=z* (λ∈]0,1[) which implies ϕλ(zλ*)=0, Bλ,X0,nU≡1 and thus the trivial lower bound EX0,nL,hor=limλ↗11−Bλ,X0,nUλ(1−λ)=0 follows for all n∈N. In contrast, for the case PSP,3c one gets zλ*=αA−αHβH−βA=z* (λ∈]0,1[) which nevertheless also implies ϕλ(zλ*)=0 and hence EX0,nL,hor≡0. On PSP,4, we have supx∈N0ϕλ(x)=limx→∞ϕλ(x)=0 and hence we set EX0,nL,hor≡0.

To show the strict positivity EX0,nL>0 in the parameter case PSP,2, we inspect the bound E0,X0,nL,sec. With α:=α•:=αA=αH (the bullet will be omitted in this proof) and the auxiliary variable x:=βHβA>0, the definition (73) respectively its special case (76) rewrites for all n∈N as

E0,X0,nL,sec:=E0,X0,nL,sec(x):=−(α+βA)·logα+βAxα+βA+βA(x−1)·1−(βA)n1−βA·X0−α1−βA+[αβA(1−βA)−(α+βA)·logα+βAxα+βA+βA(x−1)+αβAα+βA·logα+βAxα+βA−α(x−1)]·n,ifβA≠1,−(α+1)·logα+xα+1+x−1·α2·n2+X0+α2·n+(α+1)·logα+xα+1−x+1·α·n,ifβA=1. (A34)

To prove that E0,X0,nL,sec>0 for all X0∈N and all n∈N it suffices to show that E0,X0,nL,sec(1)=∂∂xE0,X0,nL,sec(1)=0 and ∂2∂x2E0,X0,nL,sec(x)>0 for all x∈]0,∞[\{1}. The assertion E0,X0,nL,sec(1)=0 is trivial from (A34). Moreover, we obtain

∂∂xE0,X0,nL,sec(x)=βA·1−α+βAα+βAx·1−(βA)n1−βA·X0−α1−βA+α·1−α+βAα+βAx·βA1−βA·n,ifβA≠1,1−α+1α+x·α2·n2+X0−α2·n,ifβA=1,

which immediately yields ∂∂xE0,X0,nL,sec(1)=0. For the second derivative we get

∂2∂x2E0,X0,nL,sec(x)=(α+βA)·βA2(α+βAx)2·1−(βA)n1−βA·X0−α1−βA+αα+βA(α+βAx)2·βA21−βA·n>0,ifβA≠1,α+1(α+x)2·α2·n2+X0−α2·n>0,ifβA=1, (A35)

where the strict positivity of E0,X0,nL,sec in the case βA≠1 follows immediately by replacing X0 with 0 and by using the obvious relation 11−βA·n−1−βAn1−βA=11−βA∑k=0n−11−βAk>0. The strict positivity in the case βA=1 is trivial by inspection.

For the constellation PSP,4 with parameters β:=β•:=βA=βH, αA≠αH, the strict positivity of EX0,nL>0 follows by showing that Ey,X0,nL,tan converges from above to zero as y tends to infinity. This is done by proving limy→∞y·Ey,X0,nL,tan∈]0,∞[. To see this, let us first observe that by l’Hospital’s rule we get

limy→∞y·logαA+βyαH+βy=αA−αHβaswellaslimy→∞y·1−αA+βyαH+βy=−αA−αHβ.

From this and (72), we obtain limy→∞y·Ey,X0,nL,tan=(αA−αH)2β·n>0 in both cases β≠1 and β=1.

Finally, for the parameter case PSP,3c we consider the bound Ey*,X0,nL,tan, with y*=αA−αHβH−βA. Since αA+βAy*=αH+βHy*, it is easy to see that Ey*,X0,nL,tan=0 for all n∈N. However, the condition ∂∂yEy,X0,nL,tan(y*)≠0 implies that supy≥0Ey,X0,nL,tan>0. The explicit form (75) of this condition follows from

∂∂yEy,X0,nL,tan(y)=(αAβH−αHβA)2fA(y)fH(y)2·1−βAn1−βA·X0−αA1−βA+αAβH−αHβAfH(y)2·αAβA(1−βA)fA(y)−αAβH−αHβAβA·n,ifβA≠1,(αAβH−αH)2fA(y)fH(y)2·αA2·n2+X0+αA2·n−(αAβH−αH)2fH(y)2·n,ifβA=1,

y≥0, by using the particular choice y=y* together with fA(y*)=fH(y*)=−αAβH−αHβAβA−βH. □

Appendix A.3. Proofs and Auxiliary Lemmas for Section 6

Proof of Lemma 2.

A closed-form representation of a sequence a˜nn∈N0 defined in (83) to (85) is given by the formula

a˜n=∑k=0n−1c+ρkdn−1−k. (A36)

This can be seen by induction: from (83) we obtain with a˜0=0 for the first element a˜1=c+ρ0=∑k=00(c+ρk)d−k. Supposing that (A36) holds for the n-th element, the induction step is

a˜n+1=c+d·a˜n+ρn=c+d·∑k=0n−1c+ρkdn−1−k+ρn=∑k=0nc+ρkdn−k.

In order to obtain the explicit representation of a˜n, we consider first the case 0≤ν<ϰ<d and ρn=K1·ϰn+K2·νn, which leads to

a˜n=dn−1∑k=0n−1c·d−k+K1·ϰdk+K2·νdk=dn−1·c·1−d−n1−d−1+K1·1−ϰdn1−ϰd+K2·1−νdn1−νd=c1−d(1−dn)+K1·dn−ϰnd−ϰ+K2·dn−νnd−ν. (A37)

Hence, for the corresponding sum we get

∑k=1na˜k=∑k=1nc1−d+K1d−ϰ+K2d−ν−c1−d·dk−K1d−ϰ·ϰk−K2d−ν·νk=c1−d·n+K1d−ϰ+K2d−ν−c1−d·d·(1−dn)1−d−K1·ϰ·(1−ϰn)(d−ϰ)(1−ϰ)−K2·ν·(1−νn)(d−ν)(1−ν). (A38)

Consider now the case 0≤ν<ϰ=d. Then some expressions in (A37) and (A38) have a zero denominator. In this case, the evaluation of (A36) becomes

a˜n=dn−1∑k=0n−1c·d−k+K1+K2·νdk=dn−1·c·1−d−n1−d−1+K1·n+K2·1−νdn1−νd=c1−d(1−dn)+K1·n·dn−1+K2·dn−νnd−ν. (A39)

Before we calculate the corresponding sum ∑k=1na˜k, we notice that

∑k=1nk·dk−1=∑k=1n∂∂ddk=∂∂d∑k=1ndk=∂∂dd·(1−dn)1−d=1−n·dn(1−d)−dn(1−d)2.

Using this fact, we obtain

∑k=1na˜k=∑k=1nc1−d(1−dk)+K1·k·dk−1+K2·dk−νkd−ν=c1−d·n+∑k=1nK2d−ν−c1−ddk+K1∑k=1nk·dk−1−K2d−ν∑k=1nνk=K2d−ν−c1−dd·(1−dn)1−d+K1·1−n·dn(1−d)−dn(1−d)2−K2·ν(1−νn)(d−ν)(1−ν)+c1−d·n=K1d(1−d)+K2d−ν−c1−dd·(1−dn)1−d−K2·ν(1−νn)(d−ν)(1−ν)+c1−d−K1·dn1−d·n.□

Proof of Lemma 3.

(a) In this case we have 0<q<βλ. To prove part (i), we consider the function ξλ(q)(·) on [x0(q),0], the range of the sequence an(q)n∈N (recall Properties 1 (P1)). For tackling the left-hand inequality in (i), we compare ξλ(q)(x)=q·ex−βλ with the quadratic function

Υ_λ(q)(x):=q2ex0(q)·x2+qex0(q)1−x0(q)·x+x0(q)1−qex0(q)+q2ex0(q)x0(q). (A40)

Clearly, one has the relations Υ_λ(q)(x0(q))=x0(q)=ξλ(q)(x0(q)), Υ_λ(q)′(x0(q))=q·ex0(q)=ξλ(q)′(x0(q)), and Υ_λ(q)′′(x)<ξλ(q)′′(x) for all x∈]x0(q),0]. Hence, Υ_λ(q)(·) is on ]x0(q),0] a strict lower functional bound of ξλ(q)(·). We are now ready to prove the left-hand inequality in (i) by induction. For n=1, we easily see that a_1(q)<a1(q) iff x0(q)1−qex0(q)+q2ex0(q)x0(q)<q−βλ iff Υ_λ(q)(0)<ξλ(q)(0), and the latter is obviously true. Let us assume that a_n(q)≤an(q) holds. From this, (93), (78) and (80) we obtain

0<ρ_n(q)=q2ex0(q)x0(q)·q·ex0(q)n2=q2ex0(q)an(q),T−x0(q)2<q2ex0(q)an(q)−x0(q)2=Υ_λ(q)an(q)−d(q),T·an(q)−x0(q)·1−d(q),T<ξλ(q)an(q)−d(q),T·an(q)−x0(q)·1−d(q),T<an+1(q)−d(q),T·a_n(q)−x0(q)·1−d(q),T=an+1(q)−ξλ(q),T(a_n(q)).

Thus, there holds a_n+1(q)<an+1(q). For the right-hand inequality in (i), we proceed analogously:

Υ¯λ(q)(x):=q2ex0(q)·x2+1−q2ex0(q)x0(q)−q−βλx0(q)·x+q−βλ (A41)

satisfies Υ¯λ(q)(x0(q))=x0(q)=ξλ(q)(x0(q)), Υ¯λ(q)(0)=q−βλ=ξλ(q)(0) as well as Υ¯λ(q)′′(x)<ξλ(q)′′(x) for all x∈]x0(q),0]. Hence, Υ¯λ(q)(·) is on ]x0(q),0] a strict upper functional bound of ξλ(q)(·). Let us first observe the obvious relation a¯1(q)=q−βλ=a1(q)<0, and assume that a¯n(q)≥an(q) (n∈N) holds. From this, (95), (79), and (80) we obtain the desired inequality a¯n+1(q)>an+1(q) by

0>ρ¯n(q)=−Γ<(q)d(q),Tn·an(q),Sx0(q)=q2ex0(q)an(q),T−x0(q)·an(q),S≥q2ex0(q)an(q)−x0(q)·an(q)=Υ¯λ(q)an(q)−d(q),S·an(q)−(q−βλ)>ξλ(q)an(q)−d(q),S·an(q)−(q−βλ)≥an+1(q)−d(q),S·a¯n(q)−(q−βλ)=an+1(q)−ξλ(q),S(a¯n(q)).

The explicit representations of the sequences an(q)n∈N, a_n(q)n∈N and a¯n(q)n∈N follow from (86) by incorporating the appropriate constants mentioned in the prelude of Lemma 3. With (83) to (85) and (86) we immediately achieve a_n(q)>an(q),T for all n∈N. Analogously, for all n≥2, we get ρ¯n−1<0, which implies that a¯n(q)<an(q),S for all n≥2. For n=1 one obtains ρ¯0=0 as well as a¯1(q)=a1(q),S=a1(q)=q−βλ.

For the second part (ii), we employ the representation (A36) which leads to

a_n(q)=∑k=0n−1d(q),Tn−1−k·ρ_k(q)+x0(q)·(1−d(q),T)aswellasa¯n(q)=∑k=0n−1d(q),Sn−1−k·ρ¯k(q)+(q−βλ).

The strict decreasingness of both sequences follows from

ρ_k(q)+x0(q)(1−d(q),T)=qex0(q)2x0(q)2d(q),T2n+x0(q)1−d(q),T≤Υ_λ(q)(0)<ξλ(q)(0)=q−βλ<0

and from the fact that ρ¯k(q)≤0 for all k∈N0 and q<βλ. Part (iii) follows directly from (i), since d(q),T,d(q),S∈]0,1[.

Let us now prove part (b), where max{0,βλ}<q<min1,eβλ−1 is assumed. To tackle part (i), we compare ξλ(q)(x)=q·ex−βλ with the quadratic function

υ__λ(q)(x):=q2·x2+q·ex0(q)−x0(q)·x+x0(q)1−qex0(q)+q2x0(q)>0 (A42)

on the interval [0,x0(q)]. Clearly, we have υ__λ(q)x0(q)=ξλ(q)(x0(q))=x0(q), υ__λ(q)′(x0(q))=ξλ(q)′(x0(q))=qex0(q) and 0<υ__λ(q)′′(x)<ξλ(q)′′(x) for all x∈]0,x0(q)]. Thus, υ__λ(q)(·) constitutes a positive functional lower bound for ξλ(q)(·) on [0,x0(q)]. Let us now prove the left-hand inequality of (i) by induction: for n=1 we get a_1(q)=υ__λ(q)(0)<ξλ(q)(0)=a1(q). Moreover, by assuming a_n(q)≤an(q) for n∈N, we obtain with the above-mentioned considerations and (93), (80) and (82)

0<ρ_n(q)=Γ>(q)d(q),S2n=q2·an(q),S−x0(q)2<q2·an(q)−x0(q)2=q2an(q)2+q·ex0(q)−x0(q)·an(q)+x0(q)·1−qex0(q)+q2x0(q)−d(q),Tan(q)−c(q),T=υ__λ(q)(an(q))−d(q),Tan(q)−c(q),T<ξλ(q)(an(q))−d(q),Tan(q)−c(q),T<an+1(q)−d(q),Ta_n(q)−c(q),T=an+1(q)−ξλ(q),T(a_n(q)).

Hence, a_n+1(q)<an+1(q). For the right-hand inequality in part (i), we define the quadratic function

υ¯¯λ(q)(x):=q2·x2+1−q2x0(q)−q−βλx0(q)·x+q−βλ, (A43)

which is a functional upper bound for ξλ(q)(·) on the interval [0,x0(q)] since there holds υ¯¯λ(q)(0)=ξλ(q)(0)=q−βλ, υ¯¯λ(q)(x0(q))=ξλ(q)(x0(q))=x0(q) and additionally υ¯¯λ(q)′′(x)=q<qex=ξλ(q)′′(x) on ]0,x0(q)[. Obviously, a¯1(q)=q−βλ=a1(q). By assuming a¯n(q)≥an(q) for n∈N, we obtain with (80), (82) and (95)

0>ρ¯n(q)=−Γ>(q)·d(q),Sn·1−d(q),Tn=−q2·x0−an(q),S·an(q),T>−q2·x0−an(q)·an(q)=υ¯¯λ(q)(an(q))−x0(q)−(q−βλ)x0(q)·an(q)−(q−βλ)>ξλ(q)(an(q))−d(q),San(q)−c(q),S>ξλ(q)(an(q))−d(q),Sa¯n(q),S−c(q),S=an+1(q)−ξλ(q),S(a¯n(q)), (A44)

which implies a¯n+1(q)>an+1(q). The explicit representations of the sequences a_n(q)n∈N and a¯n(q)n∈N follow from (86) by employing the appropriate constants mentioned in the prelude of Lemma 3. By means of (83) to (85) and (86), we directly get a_n(q)>an(q),T for all n∈N, whereas a¯n(q)<an(q),S holds only for all n≥2, since ρ¯0=0 implies that a¯1(q)=a1(q),S=a1(q)=q−βλ.

The second part (ii) can be proved in the same way as part (ii) of (a), by employing the representation (A36). For the lower bound one has

a_n(q)=∑k=0n−1d(q),Tn−1−k·c(q),T+ρ_k(q),withc(q),T>0andρ_k(q)>0.

For the upper bound we get

a¯n(q)=∑k=0n−1d(q),Sn−1−k·c(q),S+ρ¯k(q),

hence it is enough to show c(q),S+ρ¯n(q)>0 for all n∈N0. Considering the first two lines of calculation (A44) and incorporating c(q),S=q−βλ, this can be seen from

c(q),S+ρ¯n(q)>υ¯¯λ(q)(an(q))−x0(q)−(q−βλ)x0(q)·an(q)=υ¯¯λ(q)(an(q))−d(q),S·an(q)>0,

because on [0,x0(q)] there holds d(q),S·x<x<υ¯¯λ(q)(x). The last part (iii) can be easily deduced from (i) together with limn→∞n·d(q),Sn−1=0. □

The proofs of all Theorems 5–9 are mainly based on the following

Lemma A4.

Recall the quantity B˜λ,X0,n(p,q) from (42) for general p≥0,q>0 (notice that we do not consider parameters p<0, q≤0 in Section 6) as well as the constants d(q),T,d(q),S and Γ<(q),Γ>(q) defined in (76), (77) and (91). For all βA,βH,αA,αH,λ∈P×R\{0,1}, all initial population sizes X0∈N and all observation horizons n∈N there holds

  • (a) 
    in the case p≥0 and 0<q<βλ
    B˜λ,X0,n(p,q)≥exp{x0(q)·X0−pq·d(q),T1−d(q),T·1−d(q),Tn+pq·βλ+x0(q)−αλ·n+ζ_n(q)·X0+pq·ϑ_n(q)}=:Cλ,X0,n(p,q),L, (A45)
    B˜λ,X0,n(p,q)≤exp{x0(q)·X0−pq·d(q),S1−d(q),S·1−d(q),Sn+pq·βλ+x0(q)−αλ·n−ζ¯n(q)·X0−pq·ϑ¯n(q)}=:Cλ,X0,n(p,q),U, (A46)
    whereζ_n(q):=Γ<(q)·d(q),Tn−11−d(q),T·1−d(q),Tn>0, (A47)
    ϑ_n(q):=Γ<(q)·1−d(q),Tn1−d(q),T2·1−d(q),T1+d(q),Tn1+d(q),T>0, (A48)
    ζ¯n(q):=Γ<(q)·d(q),Sn−d(q),Tnd(q),S−d(q),T−d(q),Sn−1·1−d(q),Tn1−d(q),T>0, (A49)
    ϑ¯n(q):=Γ<(q)·d(q),T1−d(q),T·1−d(q),Sd(q),Tn1−d(q),Sd(q),T−d(q),Sn−d(q),Tnd(q),S−d(q),T>0. (A50)
  • (b) 
    in the case p≥0 and 0<q=βλ
    B˜λ,X0,n(p,q)=exppq·βλ+x0(q)−αλ·n=expp−αλ·n.
  • (c) 
    in the case p≥0 and max{0,βλ}<q<min1,eβλ−1 the bounds Cλ,X0,n(p,q),L and Cλ,X0,n(p,q),U from (96) and (97) remain valid, but with
    ζ_n(q):=Γ>(q)·d(q),Tn−d(q),S2nd(q),T−d(q),S2>0, (A51)
    ϑ_n(q):=Γ>(q)d(q),T−d(q),S2·d(q),T·1−d(q),Tn1−d(q),T−d(q),S2·1−d(q),S2n1−d(q),S2>0, (A52)
    ζ¯n(q):=Γ>(q)·d(q),Sn−1·n−1−d(q),Tn1−d(q),T>0, (A53)
    ϑ¯n(q):=Γ>(q)·[d(q),S−d(q),T1−d(q),S21−d(q),T·1−d(q),Sn+d(q),T1−d(q),Sd(q),Tn1−d(q),T1−d(q),Sd(q),T−d(q),Sn1−d(q),S·n]. (A54)
  • (d) 
    for the special choices p:=pλE:=αAλαH1−λ>0,q:=qλE:=βAλβH1−λ>0 in the parameter setup βA,βH,αA,αH,λ∈(PNI∪PSP,1)×]λ−,λ+[\{0,1} we obtain
    limn→∞1nlogVλ,X0,n=limn→∞1nlogCλ,X0,n(pλE,qλE),L=limn→∞1nlogCλ,X0,n(pλE,qλE),U=αAβA·x0(qλE).
  • (e) 
    for all general p≥0 with either 0<q<βλ or max{0,βλ}<q<min1,eβλ−1 we get
    limn→∞1nlogB˜λ,X0,n(p,q)=limn→∞1nlogCλ,X0,n(p,q),L=limn→∞1nlogCλ,X0,n(p,q),U=pq·βλ+x0(q)−αλ.

Proof of Lemma A4.

The closed-form bounds Cλ,X0,n(p,q),L and Cλ,X0,n(p,q),U are obtained by substituting in the representation (42) (for B˜λ,X0,n(p,q), cf. Theorem 1) the recursive sequence member an(q) by the explicit sequence member a_n(q) respectively a¯n(q). From the definitions of these sequences (92) to (95) and from (83) to (85) one can see that we basically have to evaluate the term

expa˜nhom+c˜n·X0+pq·∑k=1na˜khom+c˜k+pq·βλ−αλ·n, (A55)

where a˜nhom+c˜n=a˜n is either interpreted as the lower approximate a_n(q) or as the upper approximate a¯n(q). After rearranging and incorporating that c(q),S1−d(q),S=c(q),T1−d(q),T=x0(q) in both approximate cases, we obtain with the help of (86), (87) for the expression (A55) in the case 0≤ν<ϰ<d

exp{x0(q)·1−dn·X0−pq·d1−d+pq·βλ+x0(q)−αλ·n+K1·dn−ϰnd−ϰ+K2·dn−νnd−ν·X0+pq·K1d−ϰ+K2d−ν·d·1−dn1−d−K1·ϰ·1−ϰn(d−ϰ)(1−ϰ)−K2·ν·1−νn(d−ν)(1−ν)}. (A56)

In the other case 0≤ν<ϰ=d, the application of (88), (89) turns (A55) into

exp{x0(q)·1−dn·X0−pq·d1−d+pq·βλ+x0(q)−αλ·n+K1·n·dn−1+K2·dn−νnd−ν·X0+pq·K1d(1−d)+K2d−ν·d·1−dn1−d−K2·ν·1−νn(d−ν)(1−ν)−K1·dn1−d·n}. (A57)

After these preparatory considerations let us now begin with elaboration of the details.

(a) Let 0<q<βλ. We obtain a closed-form lower bound for B˜λ,X0,n(p,q) by employing the parameters c=^c(q),T, d=^d(q),T, K2=ν=0, K1=Γ<(q), and ϰ=d(q),T2, cf. (93) in combination with (85). Since ϰ<d(q),T, we have to plug in these parameters into (A56). The representations of ζ_n(q) and ϑ_n(q) in (A47) and (A48) follow immediately. For a closed-form upper bound, we employ the parameters c=^c(q),S, d=^d(q),S, −K1=K2=Γ<(q), ϰ=d(q),T and ν=d(q),Sd(q),T (in particular, ϰ<d(q),S implying that we have to use (A56)). From this, (A49) can be deduced directly; the representation (A50) comes from the expressions in the squared brackets in the last line of (A56) and from

−Γ<(q)d(q),S−d(q),T−Γ<(q)d(q),S−d(q),Sd(q),T·d(q),S·1−d(q),Sn1−d(q),S+Γ<(q)·d(q),T·1−d(q),Tnd(q),S−d(q),T1−d(q),T−Γ<(q)·d(q),Sd(q),T·1−d(q),Sd(q),Tnd(q),S−d(q),Sd(q),T1−d(q),Sd(q),T=−Γ<(q)·d(q),T1−d(q),Sd(q),Sd(q),S−d(q),T1−d(q),T·d(q),S·1−d(q),Sn1−d(q),S+Γ<(q)·d(q),T·1−d(q),Tnd(q),S−d(q),T1−d(q),T−Γ<(q)·d(q),T·1−d(q),Sd(q),Tn1−d(q),T1−d(q),Sd(q),T=−Γ<(q)·d(q),T1−d(q),T·1−d(q),Sd(q),Tn1−d(q),Sd(q),T+1−d(q),Snd(q),S−d(q),T−1−d(q),Tnd(q),S−d(q),T=−Γ<(q)·d(q),T1−d(q),T·1−d(q),Sd(q),Tn1−d(q),Sd(q),T−d(q),Sn−d(q),Tnd(q),S−d(q),T=−ϑ¯n(q).

Part (b) has already been mentioned in Remark 1 (b) and is due to the fact that for 0<q=βλ, the sequence an(q)n∈N is itself explicitly representable by an(q)=0 for all n∈N (cf. Properties 1 (P2)). Plugging this into (42) gives the desired result.

(c) Let us now consider max{0,βλ}<q<min{1,eβλ−1}. For a closed-form lower bound for B˜λ,X0,n(p,q) we have to employ the parameters c=^c(q),T, d=^d(q),T, K2=ν=0, K1=Γ>(q) and ϰ=d(q),S2, cf. (93) in combination with (85). The representations of ζ_n(q) and ϑ_n(q) in (A51) and (A52) follow immediately from (A56). For a closed-form upper bound, we use the parameters c=^c(q),S, d=^d(q),S, −K1=K2=Γ>(q), ϰ=d(q),S and ν=d(q),Sd(q),T. Notice that in this case we stick to the representation (A57). The formula (104) is obviously valid, and (105) is implied by

−Γ>(q)d(q),S1−d(q),S+Γ>(q)d(q),S−d(q),Sd(q),T·d(q),S·1−d(q),Sn1−d(q),S=−Γ>(q)·d(q),S−d(q),T1−d(q),S21−d(q),T·1−d(q),Sn.

The parts (d) and (e) are trivial by incorporating that in all respective cases one has d(q),S∈]0,1[, d(q),T∈]0,1[ and limn→∞n·d(q),S=0. □

Proof of Theorem 5.

(a) For λ∈]0,1[, we get 0<qλE<βλ and the assertion follows by applying part (a) of Lemma A4. Notice that in the current subcase PNI∪PSP,1 there holds pλEqλEβλ−αλ=0 as well as pλEqλE=αAβA=αHβH. For the case λ∈R\[0,1], one gets from Lemma A1 that max{0,βλ}<qλE, and there holds qλE<min{1,eβλ−1} iff λ∈]λ−,λ+[\[0,1], cf. Lemma 1. Thus, an application of part (c) of Lemma A4 proves the desired result. The assertion (b) is equivalent to part (d) of Lemma A4. □

Proof of Theorem 6.

The assertions follow immediately from (A45), Lemma A4(b),(e), Proposition 6(d) as well as the incorporation of the fact that for λ∈]0,1[ there holds qλL=βAλβH1−λ<βλ in the case βA,βH,αA,αH∈(PSP\(PSP,1∪PSP,4)) (i.e., βA≠βH) respectively qλL=βλ in the case βA,βH,αA,αH∈PSP,4 (i.e., βA=βH). □

Proof of Theorem 7.

This can be deduced from (A46), from the parts (b), (c) and (e) of Lemma A4 as well as the incorporation of pλU≥αAλαH1−λ>0 for λ∈]0,1[. Notice that an inadequate choice of pλU,qλU may lead to pλUqλU(βλ+x0(qλU))−αλ>0. □

Proof of Theorem 8.

The assertions follow immediately from (A45) and from the parts (b), (c) and (e) of Lemma A4. Notice that an inadequate choice of pλL,qλL may lead to pλLqλL(βλ+x0(qλU))−αλ<0. □

Proof of Theorem 9.

Let pλU=αAλαH1−λ>max{0,αλ} and qλU=βAλβH1−λ>max{0,βλ}. Since qλU<min{1,eβλ−1} iff λ∈]λ−,λ+[\[0,1] (cf. Lemma 1 for qλ:=qλU)), this theorem follows from (A46) of Lemma A4, from the parts (b), (e) of Lemma A4 and from part (d) of Proposition 14. □

Appendix A.4. Proofs and Auxiliary Lemmas for Section 7

Proof of Theorem 10.

As already mentioned above, one can adapt the proof of Theorem 9.1.3 in Ethier & Kurtz [138] who deal with drift-parameters η=0, κ•=0, and the different setup of σ–independent time-scale and a sequence of critical Galton-Watson processes without immigration with general offspring distribution. For the sake of brevity, we basically outline here only the main differences to their proof; for similar limit investigations involving offspring/immigration distributions and parametrizations which are incompatble to ours, see e.g., Sriram [142].

As a first step, let us define the generator

A•f(x):=η−κ•·x·f′(x)+σ22·x·f′′(x),f∈Cc∞[0,∞),

which corresponds to the diffusion process X˜ governed by (133). In connection with (130), we study

T•(m)f(x):=EP•f1m∑k=1mxY0,k(m)+Y˜0(m),x∈E(m):=1mN0,f∈Cc∞([0,∞),

where the Y0,k(m), Y˜0(m) are independent and (Poisson-β•(m) respectively Poisson-α•(m)) distributed as the members of the collection Y(m) respectively Y˜(m). By the Theorems 8.2.1 and 1.6.5 as well as Corollary 4.8.9 of [138] it is sufficient to show

limm→∞supx∈E(m)σ2mT•(m)f(x)−f(x)−A•f(x)=0,f∈Cc∞[0,∞). (A58)

But (A58) follows mainly from the next

Lemma A5.

Let

Sn(m):=1n∑k=1nY0,k(m)−β•(m)+Y˜0(m)−α•(m),n∈N,m∈N¯,

with the usual convention S0(m):=0. Then for all m∈N¯, x∈E(m) and all f∈Cc∞[0,∞)

ϵ(m)(x):=EP•∫01Smx(m)2x(1−v)f′′β•(m)x+α•(m)m+vxmSmx(m)−f′′(x)dv=1σ2·σ2m·T•(m)f(x)−f(x)−A•f(x)+R(m),wherelimm→∞R(m)=0. (A59)

Proof of Lemma A5.

Let us fix f∈Cc∞[0,∞). From the involved Poissonian expectations it is easy to see that

limm→∞σ2mT•(m)f(0)−f(0)−A•f(0)=0,

and thus (A49) holds for x=0. Accordingly, we next consider the case x∈E(m)\{0}, with fixed m∈N¯. From EP•Smx(m)2=β•(m)+α•(m)mx we obtain

EP•Smx(m)2xf′′(x)∫01(1−v)dv=12β•(m)·x+α•(m)mf′′(x)=:amxf′′(x)2=:af′′(x)2. (A60)

Furthermore, with bmx:=b:=a+x/m·Smx(m)=1m∑k=1mxY0,k(m)+Y˜0(m) we get on {Smx(m)≠0}

∫01f′′β•(m)x+α•(m)m+vxmSmx(m)dv=mx·1Smx(m)∫abf′′(y)dy=mx·f′(b)−f′(a)Smx(m) (A61)

as well as

∫01vf′′β•(m)x+α•(m)m+vxmSmx(m)dv=mxSmx(m)2∫abyf′′(y)dy−a∫abf′′(y)dy=mx·f′(b)Smx(m)+mx·f(a)−f(b)Smx(m)2. (A62)

With our choice β•(m)=1−κ•σ2m and α•(m)=β•(m)·ησ2, a Taylor expansion of f at x gives

f(a)=f(x)+1σ2m·f′(x)β•(m)·η−κ•·x+o1m, (A63)

where for the case η=κ=0 we use the convention o1m≡0. Combining (A60) to (A63) and the centering EP•Smx(m)=0, the left hand side of Equation (A59) becomes

EP•∫01Smx(m)2x(1−v)f′′β•(m)x+α•(m)m+vxmSmx(m)−f′′(x)dv=EP•mx·Smx(m)·f′(b)−f′(a)−EP•mx·Smx(m)·f′(b)+m·(f(a)−f(b))−12β•(m)·x+α•(m)m·f′′(x)=m·EP•f(b)−f(a)−12β•(m)·x+α•(m)m·f′′(x)=m·EP•f1m∑k=1mxY0,k(m)+Y˜0−f(x)−1σ2A•f(x)+1σ2η−κ•·x−β•(m)·η+κ•·x·f′(x)+x21−β•(m)−α•(m)m·f′′(x)−m·o1m

which immediately leads to the right hand side of (A59). □

To proceed with the proof of Theorem 10, we obtain for m≥2κ•/σ2 the inequality β•(m)≥1/2 and accordingly for all v∈]0,1[, x∈E(m)

β•(m)x+α•(m)m+vxmSmx(m)=(1−v)·x·β•(m)+(1−v)α•(m)m+v∑k=1mxY0,k(m)+Y˜0≥x·1−v2.

Suppose that the support of f is contained in the interval [0,c]. Correspondingly, for v≤1−2c/x the integrand in ϵ(m)(x) is zero and hence with (A64) we obtain the bounds

∫01Smx(m)2x(1−v)f′′β•(m)x+α•(m)m+vxmSmx(m)−f′′(x)dv≤∫0∨(1−2c/x)1Smx(m)2x(1−v)·2f′′∞dv≤x·Smx(m)21∧2cx2f′′∞.

From this, one can deduce limm→∞supx∈E(m)ϵ(m)(x)=0–and thus (A58) – in the same manner as at the end of the proof of Theorem 9.1.3 in [138] (by means of the dominated convergence theorem).

Proof of Proposition 15.

Let (κA,κH,η)∈P˜NI∪P˜SP,1 be fixed. We have to find those orders λ∈R\[0,1] which satisfy for all sufficiently large m∈N¯

qλ(m)=1−κAσ2mλ1−κHσ2m1−λ<min1,eβλ(m)−1. (A64)

In order to achieve this, we interpret qλ(m)=qλ1m in terms of the function

qλ(x):=1−κAσ2·xλ1−κHσ2·x1−λ,x∈]−ϵ,ϵ[, (A65)

for some small enough ϵ>0 such that (A65) is well-defined. Since βλ(m)−1=−κλσ2·m=−κλσ2·x=−λκA+(1−λ)κHσ2·x, for the verification of (A64) it suffices to show

limx↘01−qλ(x)x>0, (A66)
andlimx↘0e−κλσ2·x−qλ(x)x2>0. (A67)

By l’Hospital’s rule, one gets limx↘01−qλ(x)x=λκA+(1−λ)κHσ2=κλσ2 and hence

(A66)⟺λ<κHκH−κA,ifκA<κH,λ>−κHκA−κH,ifκA>κH. (A68)

To find a condition that guarantees (A67), we use l’Hospital’s rule twice to deduce

limx↘0e−κλσ2·x−qλ(x)x2=12σ4κλ2−λ(λ−1)(κA−κH)2=12σ4λκA2+(1−λ)κH2

and hence we obtain

(A67)⟺λ<κH2κH2−κA2,ifκA<κH,λ>−κH2κA2−κH2,ifκA>κH. (A69)

To compare both the lower and upper bounds in (A68) and (A69), let us calculate

κH2κH2−κA2−κHκH−κA=−κAκH(κH−κA)(κH+κA)<0,ifκA<κH,>0,ifκA>κH. (A70)

Incorporating this, we observe that both conditions (A66) and (A67) are satisfied simultaneously iff

λ<minκHκH−κA,κH2κH2−κA2=κH2κH2−κA2ifκA<κH,λ>max−κHκA−κH,−κH2κA2−κH2=−κH2κA2−κH2ifκA>κH,

which finishes the proof. □

The following lemma is the main tool for the proof of Theorem 11.

Lemma A6.

Let (κA,κH,η,λ)∈(P˜NI∪P˜SP,1)×λ˜−,λ˜+\{0,1}. By using the quantities κλ:=λκA+(1−λ)κH and Λλ:=λκA2+(1−λ)κH2 from (150) (which is well-defined, cf. (138)), one gets for all t>0

(a)limm→∞m·1−qλ(m)=limm→∞m·1−βλ(m)=κλσ2.(b)limm→∞m2·a1(m)=limm→∞m2·qλ(m)−βλ(m)=−λ(1−λ)κA−κH22σ4=−Λλ2−κλ22σ4.(c)limm→∞m·x0(m)=−Λλ−κλσ2<0,ifλ∈]0,1[,>0,ifλ∈]λ˜−,λ˜+[\[0,1].(d)limm→∞m2·Γ<(m)=limm→∞m2·Γ>(m)=(Λλ−κλ)22σ4>0.(e)limm→∞m·(1−d(m),S)=Λλ+κλ2σ2>0.(f)limm→∞m·(1−d(m),T)=Λλσ2>0.(g)limm→∞m·(1−d(m),Sd(m),T)=3Λλ+κλ2σ2>0.(h)limm→∞d(m),Sσ2mt=exp−Λλ+κλ2·t<1.(i)limm→∞d(m),Tσ2mt=exp−Λλ·t<1.(j)limm→∞d(m),Sd(m),Tσ2mt=exp−3Λλ+κλ2·t<1.(k)forλ∈]0,1[,thereholdsfortherespectivequantitiesdefinedin(142)to(145)limm→∞m·ζ_σ2mt(m)=Λλ−κλ22σ2·Λλ·e−Λλ·t·1−e−Λλ·t>0,limm→∞ϑ_σ2mt(m)=14·Λλ−κλΛλ2·1−e−Λλ·t2>0,limm→∞m·ζ¯σ2mt(m)=Λλ−κλ2σ2·e−12(Λλ+κλ)·t−e−Λλ·tΛλ−κλ−e−12(Λλ+κλ)·t1−e−Λλ·t2·Λλ>0,limm→∞ϑ¯σ2mt(m)=Λλ−κλ2Λλ·1−e−123Λλ+κλ·t3Λλ+κλ+e−Λλ·t−e−12(Λλ+κλ)·tΛλ−κλ>0.(l)forλ∈]λ˜−,λ˜+[\[0,1],thereholdsfortherespectivequantitiesdefinedin(146)to(149)limm→∞m·ζ_σ2mt(m)=Λλ−κλ22σ2·κλ·e−Λλ·t·1−e−κλ·t>0,limm→∞ϑ_σ2mt(m)=Λλ−κλ22·κλ·1−e−Λλ·tΛλ−1−e−(Λλ+κλ)·tΛλ+κλ>0,limm→∞m·ζ¯σ2mt(m)=Λλ−κλ22·σ2·e−12(Λλ+κλ)·t·t−1−e−Λλ·tΛλ>0,limm→∞ϑ¯σ2mt(m)=Λλ−κλ2·[Λλ−κλ1−e−12(Λλ+κλ)·tΛλ·Λλ+κλ2+1−e−12(3Λλ+κλ)·tΛλ·3Λλ+κλ−e−12(Λλ+κλ)·tΛλ+κλ·t]>0.

Proof of Lemma A6.

For each of the assertions (a) to (l), we will make use of l’Hospital’s rule. To begin with, we obtain for arbitrary μ,ν∈R

limm→∞m1−(βA(m))μ(βH(m))ν=limm→∞m2μ·(βA(m))μ−1(βH(m))νκAσ2m2+ν·(βA(m))μ(βH(m))ν−1κHσ2m2=μκAσ2+νκHσ2. (A71)

From this, the first part of (a) follows immediately and the second part is a direct consequence of the definition of βλ(m). Part (b) can be deduced from (A71):

limm→∞m2·a1(m)=limm→∞m2σ2·[λ·κA1−(βA(m))λ−1(βH(m))1−λ+(1−λ)·κH1−(βA(m))λ(βH(m))−λ]=−λ(1−λ)(κA−κH)22σ4=−Λλ2−κλ22σ4.

For the proof of (c), we rely on the inequalities x_0(m)≤x0(m)≤x¯0(m) (m∈N), where x_0(m) and x¯0(m) are the obvious notational adaptions of (124) and (126), respectively. Notice that x_0(m) and x¯0(m) are solutions of the (again adapted) quadratic equations Q_λ(m)(x)=x resp. Q¯λ(m)(x)=x (cf. (127) and (128)). These solutions clearly exist in the case λ∈]0,1[. For sufficiently large approximations steps m∈N, these solutions also exist in the case λ∈]λ˜−,λ˜+[\[0,1] since (138) together with parts (a) and (b) imply

limm→∞m·(1−qλ(m))2−2·qλ(m)·m2·a1(m)=σ−2·λκA2+(1−λ)κH2>0,forλ∈]λ˜−,λ˜+[\[0,1].

To prove part (c), we show that the limits of x_0(m) and x¯0(m) coincide. Assume first that λ∈]0,1[. Using (a) and (b), we obtain together with the obvious limit limm→∞qλ(m)=1

limm→∞m·x¯0(m)=limm→∞qλ(m)−1·m·(1−qλ(m))−m·(1−qλ(m))2−2·qλ(m)·m2·a1(m)=κλσ2−κλσ22+Λλ2−κλ2σ4=−Λλ−κλσ2. (A72)

Let x__0(m) be the adapted version of the auxiliary fixed-point lower bound defined in (125). By incorporating limm→∞βλ(m)=1 we obtain with (a) and (b)

limm→∞x__0(m)=limm→∞max−βλ(m),qλ(m)−βλ(m)1−qλ(m)=limm→∞1m·m2·a1(m)m·1−qλ(m)=0,

which implies

limm→∞m·x_0(m)=limm→∞e−x__0(m)qλ(m)·m·(1−qλ(m))−m·(1−qλ(m))2−2·ex__0(m)qλ(m)·m2·a1(m)=κλσ2−κλσ22+Λλ2−κλ2σ4=−Λλ−κλσ2. (A73)

Combining (A72) and (A73), the desired result (c) follows for λ∈]0,1[. Assume now that λ∈]λ˜−,λ˜+[\[0,1]. In this case the approximates x_0(m) and x¯0(m) have a different form, given in (124) and (126). However, the calculations work out in the same way: with parts (a) and (b) we get

limm→∞m·x_0(m)=limm→∞1qλ(m)·m·1−qλ(m)−m·(1−qλ(m))2−2·qλ(m)·m2·a1(m)=κλσ2−κλσ22+Λλ2−κλ2σ4=−Λλ−κλσ2,

as well as

limm→∞m·x¯0(m)=limm→∞m·1−qλ(m)−m·(1−qλ(m))2−2·m2·a1(m)=κλσ2−κλσ22+Λλ2−κλ2σ4=−Λλ−κλσ2,

which finally finishes the proof of part (c). Assertion (d) is a direct consequence of (c). Since the representations of the parameters c(m),S,d(m),S,c(m),T,d(m),T are the same in both cases λ∈]0,1[ and λ∈]λ˜−,λ˜+[\[0,1], the following considerations hold generally. Part (e) follows from (b) and (c) by

limm→∞m·(1−d(m),S)=limm→∞m2·a1(m)m·x0(m)=Λλ+κλ2σ2>0.

Notice that this term is positive since on ]λ˜−,λ˜+[\{0,1} there holds κλ>0 as well as Λλ>0, cf. (A70). To prove (f), we apply the general limit limx→0ex−1x=1 and get with (a), (c)

limm→∞m·(1−d(m),T)=limm→∞m·1−qλ(m)−qλ(m)·m·x0(m)·ex0(m)−1x0(m)=Λλσ2.

The limit (g) can be obtained from (e) and (f):

limm→∞m·(1−d(m),Sd(m),T)=limm→∞m·(1−d(m),S)+d(m),S·m·(1−d(m),T)=3Λλ+κλ2σ2.

The assertions (h) resp. (i) resp. (j) follow from (e) resp. (f) resp. (g) by using the general relation limm→∞1+xmmm=explimm→∞xm. To get the last two parts (k) and (l), we make repeatedly use of the results (a) to (j) and combine them with the formulas (142) to (149) of Corollary 14. More detailed, for λ∈]0,1[(and thus qλ(m)<βλ(m)) we obtain

m·ζ_σ2mt(m)=m2·Γ<(m)·d(m),Tσ2mt−1m·1−d(m),T·1−d(m),Tσ2mt⟶m→∞Λλ−κλ22σ2·Λλ·e−Λλ·t·1−e−Λλ·t>0,ϑ_σ2mt(m)=m2·Γ<(m)·1−d(m),Tσ2mtm·1−d(m),T2·1−d(m),T1+d(m),Tσ2mt1+d(m),T⟶m→∞14·Λλ−κλΛλ2·1−e−Λλ·t2>0,
m·ζ¯σ2mt(m)=m2·Γ<(m)·[d(m),Sσ2mt−d(m),Tσ2mtm·1−d(m),T−m·1−d(m),S−d(m),Sσ2mt−1·1−d(m),Tσ2mtm·1−d(m),T]⟶m→∞Λλ−κλ2σ2·e−12(Λλ+κλ)·t−e−Λλ·tΛλ−κλ−e−12(Λλ+κλ)·t1−e−Λλ·t2·Λλ>0,
ϑ¯σ2mt(m)=m2·Γ<(m)·d(m),Tm·1−d(m),T·1−d(m),Sd(m),Tσ2mtm·1−d(m),Sd(m),T−d(m),Sσ2mt−d(m),Tσ2mtm·1−d(m),T−m·1−d(m),S⟶m→∞Λλ−κλ2Λλ·1−e−123Λλ+κλ·t3Λλ+κλ+e−Λλ·t−e−12(Λλ+κλ)·tΛλ−κλ>0.

For λ∈]λ˜−,λ˜+[\[0,1](and thus qλ(m)>βλ(m)) we get

m·ζ_σ2mt(m)=m2·Γ>(m)·d(m),Tσ2mt−d(m),S2·σ2mtm·1−d(m),S1+d(m),S−m·1−d(m),T⟶m→∞Λλ−κλ22σ2·κλ·e−Λλ·t·1−e−κλ·t>0,ϑ_σ2mt(m)=m2·Γ>(m)m·1−d(m),S1+d(m),S−m·1−d(m),T·d(m),T·1−d(m),Tσ2mtm·1−d(m),T−d(m),S2·1−d(m),S2·σ2mtm·1−d(m),S1+d(m),S⟶m→∞Λλ−κλ22·κλ·1−e−Λλ·tΛλ−1−e−(Λλ+κλ)·tΛλ+κλ>0,m·ζ¯σ2mt(m)=m2·Γ>(m)·d(m),Sσ2mt−1·σ2mtm−1−d(m),Tσ2mtm·1−d(m),T⟶m→∞Λλ−κλ22·σ2·e−12(Λλ+κλ)·t·t−1−e−Λλ·tΛλ>0,
ϑ¯σ2mt(m)=m2·Γ>(m)·[m·1−d(m),T−m·1−d(m),Sm2·1−d(m),S2·m·1−d(m),T·1−d(m),Sσ2mt+d(m),T1−d(m),Sd(m),Tσ2mtm·1−d(m),T·m·1−d(m),Sd(m),T−d(m),Sσ2mtm·1−d(m),S·σ2mtm]⟶m→∞Λλ−κλ2·Λλ−κλ1−e−12(Λλ+κλ)·tΛλ·Λλ+κλ2+1−e−12(3Λλ+κλ)·tΛλ·3Λλ+κλ−e−12(Λλ+κλ)·tΛλ+κλ·t>0.□

Proof of Theorem 11.

It suffices to compute the limits of the bounds given in Corollary 14 as m tends to infinity. This is done by applying Lemma A6 which provides corresponding limits of all quantities of interest. Accordingly, for all t>0 the lower bound (153) in the case λ∈]0,1[ can be obtained from (140), (142) and (143) by

limm→∞exp{x0(m)·X0(m)−ησ2·d(m),T1−d(m),T1−d(m),Tσ2mt+x0(m)ησ2·σ2mt+ζ_σ2mt(m)·X0(m)+ϑ_σ2mt(m)}=limm→∞exp{m·x0(m)·X0(m)m−ησ2·d(m),Tm·1−d(m),T1−d(m),Tσ2mt+m·x0(m)ησ2·σ2mtm+m·ζ_σ2mt(m)·X0(m)m+ϑ_σ2mt(m)}=exp{−Λλ−κλσ2·X˜0−ησ2·σ2Λλ1−e−Λλt−Λλ−κλσ2·ησ2·σ2t+Λλ−κλ22σ2·Λλ·e−Λλ·t·1−e−Λλ·t·X˜0+η4σ2·Λλ−κλΛλ2·1−e−Λλ·t2}=exp−Λλ−κλσ2X˜0−ηΛλ1−e−Λλ·t−ησ2Λλ−κλ·t+Lλ(1)(t)·X˜0+ησ2·Lλ(2)(t).

For all t>0, the upper bound (154) in the case λ∈]0,1[ follows analogously from (141), (144), (145) by

limm→∞exp{x0(m)·X0(m)−ησ2·d(m),S1−d(m),S1−d(m),Sσ2mt+x0(m)ησ2·σ2mt−ζ¯σ2mt(m)·X0(m)−ϑ¯σ2mt(m)}=limm→∞exp{m·x0(m)·X0(m)m−ησ2·d(m),Sm·1−d(m),S1−d(m),Sσ2mt+m·x0(m)ησ2·σ2mtm−m·ζ¯σ2mt(m)·X0(m)m−ϑ¯σ2mt(m)}=exp{−Λλ−κλσ2X˜0−ησ2·2σ2Λλ+κλ1−e−12(Λλ+κλ)t−Λλ−κλσ2·ησ2·σ2t−Λλ−κλ2σ2·e−12(Λλ+κλ)·t−e−Λλ·tΛλ−κλ−e−12(Λλ+κλ)·t1−e−Λλ·t2·Λλ·X˜0−ησ2Λλ−κλ2Λλ·1−e−123Λλ+κλ·t3Λλ+κλ+e−Λλ·t−e−12(Λλ+κλ)·tΛλ−κλ}=exp{−Λλ−κλσ2X˜0−η12(Λλ+κλ)1−e−12(Λλ+κλ)·t−ησ2Λλ−κλ·t−Uλ(1)(t)·X˜0−ησ2·Uλ(2)(t)}.

In the case λ∈]λ˜−,λ˜+[\[0,1], the lower bound as well as the upper bound of the Hellinger integral limit is obtained analogously, by taking into account that the quantities ζ_n(m),ϑ_n(m),ζ¯n(m),ϑ¯n(m) now have the form (146) to (149) instead of (142) to (145). Thus, the functions Lλ(1)(t),Uλ(1)(t),Lλ(2)(t),Uλ(2)(t) are obtained by employing the limits of part (l) of Lemma A6 instead of part (k). □

The next Lemma (and parts of its proof) will be useful for the verification of Theorem 12:

Lemma A7.

Recall the bounds on the Hellinger integral m–limit given in (153) and (154) of Theorem 11, in terms of Lλ(i)(t) and Uλ(i)(t) (i=1,2) defined by (155) to (158). Correspondingly, one gets the following λ–limits for all t∈[0,∞[:

  • (a) 
    for all κA∈]0,∞[ and all κH∈[0,∞[ with κA≠κH
    limλ↗1∂Lλ(1)(t)∂λ=limλ↗1∂Lλ(2)(t)∂λ=limλ↗1∂Uλ(1)(t)∂λ=limλ↗1∂Uλ(2)(t)∂λ=0. (A74)
  • (b) 
    for κA=0 and all κH∈]0,∞[
    limλ↗1∂Lλ(1)(t)∂λ=−κH2·t2σ2, (A75)
    limλ↗1∂Lλ(2)(t)∂λ=−κH2·t24, (A76)
    limλ↗1∂Uλ(1)(t)∂λ=limλ↗1∂Uλ(2)(t)∂λ=0. (A77)

Proof of Lemma A7.

For all κA,κH∈[0,∞[ with κA≠κH one can deduce from (150) as well as (155) to (158) the following derivatives:

∂Lλ(1)(t)∂λ=12σ2{t2Λλ−κλΛλ2κA2−κH22e−2Λλt−e−Λλt+e−Λλt1−e−ΛλtΛλΛλ−κλΛλκA2−κH2−2Λλ(κA−κH)−Λλ−κλΛλ2κA2−κH22}, (A78)
∂Lλ(2)(t)∂λ=14{Λλ−κλΛλ·1−e−ΛλtΛλ2·κA2−κH2−2Λλ(κA−κH)−Λλ−κλΛλκA2−κH2+t·e−Λλt·Λλ−κλΛλ2·1−e−ΛλtΛλ·κA2−κH2}, (A79)
∂Uλ(1)(t)∂λ=1σ2{Λλ−κλ2Λλte−ΛλtκA2−κH2−t2e−12(Λλ+κλ)tκA2−κH2+2Λλ(κA−κH)−e−12(Λλ+κλ)t−e−Λλt2Λλ·κA2−κH2−2Λλ(κA−κH)+Λλ−κλ2Λλ2[t2e−12(Λλ+κλ)tκA2−κH2+2Λλ(κA−κH)−t2e−12(3Λλ+κλ)t3κA2−κH2+2Λλ(κA−κH)+e−12(Λλ+κλ)t·1−e−ΛλtΛλ·κA2−κH2]+Λλ−κλΛλκA2−κH2−2Λλ(κA−κH)e−12(Λλ+κλ)t−e−ΛλtΛλ−κλ−e−12(Λλ+κλ)t1−e−Λλt2Λλ}, (A80)
∂Uλ(2)(t)∂λ=Λλ−κλ2Λλ(3Λλ+κλ)[t2e−12(3Λλ+κλ)t3κA2−κH22Λλ+κA−κH−1−e−12(3Λλ+κλ)t3Λλ+κλ·3κA2−κH22Λλ+κA−κH]+Λλ−κλΛλt2e−12(Λλ+κλ)tκA2−κH22Λλ+κA−κH−te−ΛλtκA2−κH22Λλ+e−12(Λλ+κλ)t−e−ΛλtΛλκA2−κH22Λλ−κA+κH+2κA2−κH22Λλ−κA+κH−Λλ−κλΛλ2·κA2−κH22·1ΛλΛλ−κλ3Λλ+κλ1−e−12(3Λλ+κλ)t−e−12(Λλ+κλ)t+e−Λλt. (A81)

If κA∈]0,∞[ and κH∈[0,∞[ with κA≠κH, then one gets limλ↗1Λλ=limλ↗1κλ=κA>0 which implies (A74) from (A78) to (A81). For the proof of part (b), let us correspondingly assume κA=0 and κH∈]0,∞[, which by (150) leads to κλ=κH·(1−λ), Λλ=κH·1−λ and the convergences limλ↗1Λλ=limλ↗1κλ=0. From this, the assertions (A75), (A76), (A77) follow in a straightforward manner from (A78), (A79), (A80) – respectively – by using (parts of) the obvious relations

limλ↗1κλΛλ=0,limλ↗1Λλ±κλΛλ=limλ↗1Λλ−κλΛλ+κλ=1, (A82)
limλ↗11−e−cλ·tcλ=tforallcλ∈Λλ,Λλ+κλ2,3Λλ+κλ2. (A83)

In order to get the last assertion in (A77), we make use of the following limits

limλ↗11Λλ−κλ−33Λλ+κλ=limλ↗14κH(κH−κH·1−λ)·(3κH+κH·1−λ)=43κH (A84)

and

limλ↗11Λλ1−e−12(3Λλ+κλ)t3Λλ+κλ−1−e−ΛλtΛλ−κλ+1−e−12(Λλ+κλ)tΛλ−κλ=0. (A85)

To see (A85), let us first observe that the involved limit can be rewritten as

limλ↗1{1Λλ(Λλ−κλ)13−13e−12(3Λλ+κλ)t+e−Λλt−e−12(Λλ+κλ)t (A86)
+1−e−12(3Λλ+κλ)tΛλ13Λλ+κλ−13(Λλ−κλ)}. (A87)

Substituting x:=1−λ and applying l’Hospital’s rule twice, we get for the first limit (A86)

limx↘013−13e−κHt2(3x+x2)+e−κHtx−e−κHt2(x+x2)κH2·x2−x3=limx↘0κHt6(3+2x)e−κHt2(3x+x2)−κHte−κHtx+κHt2(1+2x)e−κHt2(x+x2)κH2·2x−3x2=limx↘0−κH2t212(3+2x)2+κHt3e−κHt2(3x+x2)+κH2t2e−κHtx−κH2t24(1+2x)2−κHte−κHt2(x+x2)κH2·2−6x=12κH2−3κH2t24+κHt3+κH2t2−κH2t24+κHt=2t3κH.

The second limit (A87) becomes

limλ↗11−e−12(3Λλ+κλ)t3Λλ+κλ·3Λλ+κλΛλ·−4κH(3κH+1−λκH)(3κH−31−λκH) (A88)

and consequently (A85) follows. To proceed with the proof of (A77), we rearrange

limλ↗1∂Uλ(2)(t)∂λ=limλ↗1{Λλ−κλΛλ2[Λλ3Λλ+κλt2e−12(3Λλ+κλ)t−3κH22Λλ−κH−Λλ3Λλ+κλ·1−e−12(3Λλ+κλ)t3Λλ+κλ−3κH22Λλ−κH+ΛλΛλ−κλe−12(Λλ+κλ)t−e−ΛλtΛλ−κλ−κH22Λλ+κH−ΛλΛλ−κλ−t2e−12(Λλ+κλ)t−κH22Λλ−κH−te−ΛλtκH22Λλ]+Λλ−κλΛλ−κH2+2ΛλκH+Λλ−κλΛλ2κH22·1−e−12(3Λλ+κλ)tΛλ(3Λλ+κλ)−e−12(Λλ+κλ)t−e−ΛλtΛλ(Λλ−κλ)}=limλ↗1{Λλ−κλΛλ2[κH2t4−3e−12(3Λλ+κλ)t3Λλ+κλ−e−12(Λλ+κλ)tΛλ−κλ+2e−ΛλtΛλ−κλ (A89)
+κH2231−e−12(3Λλ+κλ)t3Λλ+κλ2−1−e−ΛλtΛλ−κλ2+1−e−12(Λλ+κλ)tΛλ−κλ2 (A90)
+κH(−Λλ3Λλ+κλ·te−12(3Λλ+κλ)t2+Λλ3Λλ+κλ·1−e−12(3Λλ+κλ)t3Λλ+κλ−ΛλΛλ−κλ·te−12(Λλ+κλ)t2+ΛλΛλ−κλ·1−e−ΛλtΛλ−κλ−ΛλΛλ−κλ·1−e−12(Λλ+κλ)tΛλ−κλ)]+Λλ−κλΛλ−κH2+2ΛλκH+Λλ−κλΛλ2κH22·1−e−12(3Λλ+κλ)tΛλ(3Λλ+κλ)−e−12(Λλ+κλ)t−e−ΛλtΛλ(Λλ−κλ)}. (A91)

By means of (A82) to (A84), the limit of the expression after the squared brackets in (A89) becomes

limλ↗1{κH2t41−e−12(Λλ+κλ)tΛλ−κλ−21−e−ΛλtΛλ−κλ+31−e−12(3Λλ+κλ)t3Λλ+κλ+1Λλ−κλ−33Λλ+κλ=κHt3, (A92)

and the limit of the expression in (A90) becomes with (A85)

limλ↗1{ΛλΛλ−κλ·κH22Λλ·1−e−12(3Λλ+κλ)t3Λλ+κλ−1−e−ΛλtΛλ−κλ+1−e−12(Λλ+κλ)tΛλ−κλ−κH22·1−e−12(3Λλ+κλ)t3Λλ+κλ·1Λλ−κλ−33Λλ+κλ=−κHt3. (A93)

By putting (A91)–(A93) together with (A85) we finally end up with

limλ↗1∂Uλ(2)(t)∂λ=κHt3−κHt3+κH−t6+t6−t2+t−t2+−κH2+κH22·0=0,

which finishes the proof of Lemma A7. □

Proof of Theorem 12.

Recall from (131) the approximative Poisson offspring-distribution parameter β•(m):=1−κ•σ2m and Poisson immigration-distribution parameter α•(m):=β•(m)·ησ2, which is a special case of βA(m),βH(m),αA(m),αH(m)∈PNI∪PSP,1. Let us first calculate limm→∞IPA,σ2mt(m)∥PH,σ2mt(m) by starting from Theorem 3(a). Correspondingly, we evaluate for all κA≥0, κH≥0 with κA≠κH by a twofold application of l’Hospital’s rule

limm→∞m2·βA(m)·logβA(m)βH(m)−1+βH(m)=limm→∞−m2σ2κAlogβA(m)βH(m)+κH1−βA(m)βH(m)=12σ4·limm→∞βH(m)·κA−βA(m)·κHβH(m)2·κA·βH(m)βA(m)−κH=κA−κH22σ4. (A94)

Additionally there holds

limm→∞m·(1−βA(m))=κAσ2andlimm→∞βA(m)σ2mt=limm→∞1−κAσ2mmσ2mt/m=e−κA·t. (A95)

For κA>0, we apply the upper part of formula (69) as well as (A94) and (A95) to derive

limm→∞IλPA,σ2mt(m)∥PH,σ2mt(m)=limm→∞m2·βA(m)·logβA(m)βH(m)−1+βH(m)m·(1−βA(m))·X0(m)m−αA(m)m·(1−βA(m))·1−βA(m)σ2mt+αA(m)βA(m)·m·(1−βA(m))·m2·βA(m)·logβA(m)βH(m)−1+βH(m)·σ2mtm=κA−κH22σ2·κA·X˜0−ηκA·1−e−κA·t+η·t.

For κA=0 (and thus κH>0, βA(m)≡1, αA(m)≡η/σ2), we apply the lower part of formula (69) as well as (A94) and (A95) to obtain

limm→∞IλPA,σ2mt(m)∥PH,σ2mt(m)={limm→∞m2·βH(m)−logβH(m)−1·η2σ2·σ2mt2m2+X0(m)m+η2σ2·m·σ2mtm}=κH22σ2·η2·t2+X˜0·t.

Let us now calculate the “converse” double limit

limλ↗1limm→∞IλPA,σ2mt(m)∥PH,σ2mt(m)=limλ↗1limm→∞1−HλPA,σ2mt(m)∥PH,σ2mt(m)λ·(1−λ).

This will be achieved by evaluating for each t>0 the two limits

limλ↗11−dλ,X˜0,tLλ·(1−λ)andlimλ↗11−dλ,X˜0,tUλ·(1−λ) (A96)

which will turn out to coincide; the involved lower and upper bound dλ,X˜0,tL, dλ,X˜0,tU defined by (153) and (154) satisfy limλ↗1dλ,X˜0,tL=limλ↗1dλ,X˜0,tU=1 as an easy consequence of the limits (cf. 150)

limλ↗1Λλ=κA≥0andlimλ↗1κλ=κA≥0, (A97)

as well as the formulas (A82) and (A83) for the case κA=0. Accordingly, we compute

limλ↗11−dλ,X˜0,tLλ·(1−λ)=limλ↗1−dλ,X˜0,tL1−2λ∂∂λ[−Λλ−κλσ2·X˜0−ηΛλ·1−e−Λλ·t−ησ2·Λλ−κλ·t+Lλ(1)(t)·X˜0+ησ2·Lλ(2)(t)]=limλ↗1{−Λλ−κλσ2X˜0−ηΛλ·te−Λλ·t·∂Λλ∂λ+1−e−Λλ·t·ηΛλ2·∂Λλ∂λ−1σ2·∂∂λΛλ−κλ·X˜0−ηΛλ·1−e−Λλ·t−ηtσ2·∂∂λΛλ−κλ+X˜0∂Lλ(1)(t)∂λ+ησ2∂Lλ(2)(t)∂λ},with (A98)
∂Λλ∂λ=κA2−κH22Λλand∂κλ∂λ=κA−κH. (A99)

For the case κA>0, one can combine this with (A97) and (A74) to end up with

limλ↗11−dλ,X˜0,tLλ·(1−λ)=κA−κH22σ2·κA·X˜0−ηκA·1−e−κA·t+η·t. (A100)

For the case κA=0, we continue the calculation (A98) by rearranging terms and by employing the Formulas (A75), (A76), (A82) and (A83) as well as the obvious relation 1Λ−Λ−κλΛ2=1κH and obtain

limλ↗11−dλ,X˜0,tLλ·(1−λ)=limλ↗1{κH2·X˜02σ2Λλ−κλΛλ·t·e−Λλt+1−e−ΛλtΛλ+η·κH2·t2σ21Λλ−Λλ−κλΛλ2+Λλ−κλΛλ·1−e−ΛλtΛλ−η·κH22σ2·1−e−ΛλtΛλ1Λλ−Λλ−κλΛλ2−κH·X˜0σ21−e−Λλt+η·κHσ21−e−ΛλtΛλ−t+∂Lλ(1)(t)∂λ·X˜0+ησ2·∂Lλ(2)(t)∂λ}=κH2X˜0tσ2+ηκH2t2σ21κH+t−ηκHt2σ2−κH2X˜0t2σ2−ηκH2t24σ2=κH22σ2·η2·t2+X˜0·t. (A101)

Let us now turn to the second limit (A96) for which we compute analogously to (A98)

limλ↗11−dλ,X˜0,tUλ·(1−λ)=limλ↗1−dλ,X˜0,tU1−2λ∂∂λ[−Λλ−κλσ2·X˜0−η12(Λλ+κλ)·1−e−12(Λλ+κλ)·t−ησ2·Λλ−κλ·t−Uλ(1)(t)·X˜0−ησ2·Uλ(2)(t)]=limλ↗1{−Λλ−κλσ2[X˜0−η12(Λλ+κλ)·t2·e−12(Λλ+κλ)·t∂∂λΛλ+κλ+1−e−12(Λλ+κλ)·t·2·η(Λλ+κλ)2·∂∂λ(Λλ+κλ)]−1σ2·∂∂λΛλ−κλ·X˜0−η12(Λλ+κλ)·1−e−12(Λλ+κλ)·t−ηtσ2·∂∂λΛλ−κλ−∂Uλ(1)(t)∂λ·X˜0−ησ2∂Uλ(2)(t)∂λ}. (A102)

For the case κA>0, one can combine this with (A97), (A99) and (A74) to end up with

limλ↗11−dλ,X˜0,tUλ·(1−λ)=κA−κH22σ2·κA·X˜0−ηκA·1−e−κA·t+η·t. (A103)

For the case κA=0, we continue the calculation of (A102) by rearranging terms and by employing the formulas (A77), (A82) and (A83) as well as the obvious relation limλ↗11Λλ−Λλ−κλΛλ(Λλ+κλ)=2κH to obtain

limλ↗11−dλ,X˜0,tUλ·(1−λ)=limλ↗1{t·X˜04σ2·Λλ−κλΛλ·e−12Λλ+κλ·tκH2+2ΛλκH+X˜02σ2·1−e−12(Λλ+κλ)·tΛλκH2−2ΛλκH−η·tσ2[κH1+e−12Λλ+κλ·tΛλ−κλΛλ+κλ−κH22·1Λλ−Λλ−κλΛλ(Λλ+κλ)+Λλ−κλΛλ+κλ·1−e−12Λλ+κλ·tΛλ]+2ησ2·1−e−12Λλ+κλ·tΛλ+κλκH1+Λλ−κλΛλ+κλ−κH221Λλ−Λλ−κλΛλ(Λλ+κλ)−∂Uλ(1)(t)∂λ·X˜0−ησ2∂Uλ(2)(t)∂λ}=κH2tX˜04σ2+κH2tX˜04σ2−ηtσ22κH−κH−κH2t4+ηtσ22κH−κH=κH22σ2η2·t2+X˜0·t. (A104)

Since (A100) coincides with (A103) and (A101) coincides with (A104), we have finished the proof. □

Author Contributions

Conceptualization, N.B.K. and W.S.; Formal analysis, N.B.K. and W.S.; Methodology, N.B.K. and W.S.; Visualization, N.B.K.; Writing, N.B.K. and W.S. All authors have read and agreed to the published version of the manuscript.

Funding

Niels B. Kammerer received a scholarship of the “Studienstiftung des Deutschen Volkes” for his PhD Thesis.

Conflicts of Interest

The authors declare no conflict of interest.

References

  • 1.Liese F., Vajda I. Convex Statistical Distances. Teubner; Leipzig, Germany: 1987. [Google Scholar]
  • 2.Read T.R.C., Cressie N.A.C. Goodness-of-Fit Statistics for Discrete Multivariate Data. Springer; New York, NY, USA: 1988. [Google Scholar]
  • 3.Vajda I. Theory of Statistical Inference and Information. Kluwer; Dordrecht, The Netherlands: 1989. [Google Scholar]
  • 4.Csiszár I., Shields P.C. Information Theory and Statistics: A Tutorial. Now Publishers; Hanover, MA, USA: 2004. [Google Scholar]
  • 5.Stummer W. Exponentials, Diffusions, Finance, Entropy and Information. Shaker; Aachen, Germany: 2004. [Google Scholar]
  • 6.Pardo L. Statistical Inference Based on Divergence Measures. Chapman & Hall/CRC; Bocan Raton, FL, USA: 2006. [Google Scholar]
  • 7.Liese F., Miescke K.J. Statistical Decision Theory: Estimation, Testing, and Selection. Springer; New York, NY, USA: 2008. [Google Scholar]
  • 8.Basu A., Shioya H., Park C. Statistical Inference: The Minimum Distance Approach. CRC Press; Boca Raton, FL, USA: 2011. [Google Scholar]
  • 9.Voinov V., Nikulin M., Balakrishnan N. Chi-Squared Goodness of Fit Tests with Applications. Academic Press; Waltham, MA, USA: 2013. [Google Scholar]
  • 10.Liese F., Vajda I. On divergences and informations in statistics and information theory. IEEE Trans. Inform. Theory. 2006;52:4394–4412. [Google Scholar]
  • 11.Vajda I., van der Meulen E.C. Goodness-of-fit criteria based on observations quantized by hypothetical and empirical percentiles. In: Karian Z.A., Dudewicz E.J., editors. Handbook of Fitting Statistical Distributions with R. CRC; Heidelberg, Germany: 2010. pp. 917–994. [Google Scholar]
  • 12.Stummer W., Vajda I. On Bregman distances and divergences of probability measures. IEEE Trans. Inform. Theory. 2012;58:1277–1288. [Google Scholar]
  • 13.Kißlinger A.-L., Stummer W. Robust statistical engineering by means of scaled Bregman distances. In: Agostinelli C., Basu A., Filzmoser P., Mukherjee D., editors. Recent Advances in Robust Statistics–Theory and Applications. Springer; New Delhi, India: 2016. pp. 81–113. [Google Scholar]
  • 14.Broniatowski M., Stummer W. Some universal insights on divergences for statistics, machine learning and artificial intelligence. In: Nielsen F., editor. Geometric Structures of Information. Springer; Cham, Switzerland: 2019. pp. 149–211. [Google Scholar]
  • 15.Stummer W., Vajda I. Optimal statistical decisions about some alternative financial models. J. Econom. 2007;137:441–471. [Google Scholar]
  • 16.Stummer W., Lao W. Limits of Bayesian decision related quantities of binomial asset price models. Kybernetika. 2012;48:750–767. [Google Scholar]
  • 17.Csiszar I. Eine informationstheoretische Ungleichung und ihre Anwendung auf den Beweis der Ergodizität von Markoffschen Ketten. Publ. Math. Inst. Hungar. Acad. Sci. 1963;A-8:85–108. [Google Scholar]
  • 18.Ali M.S., Silvey D. A general class of coefficients of divergence of one distribution from another. J. Roy. Statist. Soc. B. 1966;28:131–140. [Google Scholar]
  • 19.Morimoto T. Markov processes and the H-theorem. J. Phys. Soc. Jpn. 1963;18:328–331. [Google Scholar]
  • 20.van Erven T., Harremoes P. Renyi divergence and Kullback-Leibler divergence. IEEE Trans. Inf. Theory. 2014;60:3797–3820. [Google Scholar]
  • 21.Newman C.M. Topics in Probability Theory. Courant Institute of Mathematical Sciences New York University; New York, NY, USA: 1973. On the orthogonality of independent increment processes; pp. 93–111. [Google Scholar]
  • 22.Liese F. Hellinger integrals of Gaussian processes with independent increments. Stochastics. 1982;6:81–96. [Google Scholar]
  • 23.Memin J., Shiryayev A.N. Distance de Hellinger-Kakutani des lois correspondant a deux processus a accroissements indépendants. Probab. Theory Relat. Fields. 1985;70:67–89. [Google Scholar]
  • 24.Jacod J., Shiryaev A.N. Limit Theorems for Stochastic Processes. Springer; Berlin, Germany: 1987. [Google Scholar]
  • 25.Linkov Y.N., Shevlyakov Y.A. Large deviation theorems in the hypotheses testing problems for processes with independent increments. Theory Stoch. Process. 1998;4:198–210. [Google Scholar]
  • 26.Liese F. Hellinger integrals, error probabilities and contiguity of Gaussian processes with independent increments and Poisson processes. J. Inf. Process. Cybern. 1985;21:297–313. [Google Scholar]
  • 27.Kabanov Y.M., Liptser R.S., Shiryaev A.N. On the variation distance for probability measures defined on a filtered space. Probab. Theory Relat. Fields. 1986;71:19–35. [Google Scholar]
  • 28.Liese F. Hellinger integrals of diffusion processes. Statistics. 1986;17:63–78. [Google Scholar]
  • 29.Vajda I. Distances and discrimination rates for stochastic processes. Stoch. Process. Appl. 1990;35:47–57. [Google Scholar]
  • 30.Stummer W. The Novikov and entropy conditions of multidimensional diffusion processes with singular drift. Probab. Theory Relat. Fields. 1993;97:515–542. [Google Scholar]
  • 31.Stummer W. On a statistical information measure of diffusion processes. Stat. Decis. 1999;17:359–376. [Google Scholar]
  • 32.Stummer W. On a statistical information measure for a generalized Samuelson-Black-Scholes model. Stat. Decis. 2001;19:289–314. [Google Scholar]
  • 33.Bartoszynski R. Branching processes and the theory of epidemics. In: Le Cam L.M., Neyman J., editors. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. IV. University of California Press; Berkeley, CA, USA: 1967. pp. 259–269. [Google Scholar]
  • 34.Ludwig D. Qualitative behaviour of stochastic epidemics. Math. Biosci. 1975;23:47–73. [Google Scholar]
  • 35.Becker N.G. Estimation for an epidemic model. Biometrics. 1976;32:769–777. [PubMed] [Google Scholar]
  • 36.Becker N.G. Estimation for discrete time branching processes with applications to epidemics. Biometrics. 1977;33:515–522. [PubMed] [Google Scholar]
  • 37.Metz J.A.J. The epidemic in a closed population with all susceptibles equally vulnerable; some results for large susceptible populations and small initial infections. Acta Biotheor. 1978;27:75–123. doi: 10.1007/BF00048405. [DOI] [PubMed] [Google Scholar]
  • 38.Heyde C.C. On assessing the potential severity of an outbreak of a rare infectious disease. Austral. J. Stat. 1979;21:282–292. [Google Scholar]
  • 39.Von Bahr B., Martin-Löf A. Threshold limit theorems for some epidemic processes. Adv. Appl. Prob. 1980;12:319–349. [Google Scholar]
  • 40.Ball F. The threshold behaviour of epidemic models. J. Appl. Prob. 1983;20:227–241. [Google Scholar]
  • 41.Jacob C. Branching processes: Their role in epidemics. Int. J. Environ. Res. Public Health. 2010;7:1186–1204. doi: 10.3390/ijerph7031204. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 42.Barbour A.D., Reinert G. Approximating the epidemic curve. Electron. J. Probab. 2013;18:1–30. [Google Scholar]
  • 43.Britton T., Pardoux E. Stochastic epidemics in a homogeneous community. In: Britton T., Pardoux E., editors. Stochastic Epidemic Models. Springer; Cham, Switzerland: 2019. pp. 1–120. [Google Scholar]
  • 44.Dion J.P., Gauthier G., Latour A. Branching processes with immigration and integer-valued time series. Serdica Math. J. 1995;21:123–136. [Google Scholar]
  • 45.Grunwald G.K., Hyndman R.J., Tedesco L., Tweedie R.L. Non-Gaussian conditional linear AR(1) models. Aust. N. Z. J. Stat. 2000;42:479–495. [Google Scholar]
  • 46.Kedem B., Fokianos K. An Regression Models for Time Series Analysis. Wiley; Hoboken, NJ, USA: 2002. [Google Scholar]
  • 47.Held L., Höhle M., Hofmann M. A statistical framework for the analysis of multivariate infectious disease surveillance counts. Stat. Model. 2005;5:187–199. [Google Scholar]
  • 48.Weiss C.H. An Introduction to Discrete-Valued Time Series. Wiley; Hoboken, NJ, USA: 2018. [Google Scholar]
  • 49.Feigin P.D., Passy U. The geometric programming dual to the extinction probability problem in simple branching processes. Ann. Probab. 1981;9:498–503. [Google Scholar]
  • 50.Mordecki E. Asymptotic mixed normality and Hellinger processes. Stoch. Stoch. Rep. 1994;48:129–143. [Google Scholar]
  • 51.Sriram T.N., Vidyashankar A.N. Minimum Hellinger distance estimation for supercritical Galton-Watson processes. Stat. Probab. Lett. 2000;50:331–342. [Google Scholar]
  • 52.Guttorp P. Statistical Inference for Branching Processes. Wiley; New York, NY, USA: 1991. [Google Scholar]
  • 53.Linkov Y.N., Lunyova L.A. Large deviation theorems in the hypothesis testing problems for the Galton-Watson processes with immigration. Theory Stoch. Process. 1996;2:120–132. Erratum in Theory Stoch. Process1997, 3, 270–285. [Google Scholar]
  • 54.Heathcote C.R. A branching process allowing immigration. J. R. Stat. Soc. B. 1965;27:138–143. Erratum in: Heathcote, C.R. Corrections and comments on the paper “A branching process allowing immigration”. J. R. Stat. Soc. B1966, 28, 213–217. [Google Scholar]
  • 55.Athreya K.B., Ney P.E. Branching Processes. Springer; New York, NY, USA: 1972. [Google Scholar]
  • 56.Jagers P. Branching Processes with Biological Applications. Wiley; London, UK: 1975. [Google Scholar]
  • 57.Asmussen S., Hering H. Branching Processes. Birkhäuser; Boston, MA, USA: 1983. [Google Scholar]
  • 58.Haccou P., Jagers P., Vatutin V.A. Branching Processes: Variation, Growth, and Extinction of Populations. Cambrigde University Press; Cambridge, UK: 2005. [Google Scholar]
  • 59.Heyde C.C., Seneta E. Estimation theory for growth and immigration rates in a multiplicative process. J. Appl. Probab. 1972;9:235–256. [Google Scholar]
  • 60.Basawa I.V., Rao B.L.S. Statistical Inference of Stochastic Processes. Academic Press; London, UK: 1980. [Google Scholar]
  • 61.Basawa I.V., Scott D.J. Asymptotic Optimal Inference for Non-Ergodic Models. Springer; New York, NY, USA: 1983. [Google Scholar]
  • 62.Sankaranarayanan G. Branching Processes and Its Estimation Theory. Wiley; New Delhi, India: 1989. [Google Scholar]
  • 63.Wei C.Z., Winnicki J. Estimation of the means in the branching process with immigration. Ann. Stat. 1990;18:1757–1773. [Google Scholar]
  • 64.Winnicki J. Estimation of the variances in the branching process with immigration. Probab. Theory Relat. Fields. 1991;88:77–106. [Google Scholar]
  • 65.Yanev N.M. Statistical inference for branching processes. In: Ahsanullah M., Yanev G.P., editors. Records and Branching Processes. Nova Science Publishes; New York, NY, USA: 2008. pp. 147–172. [Google Scholar]
  • 66.Harris T.E. The Theory of Branching Processes. Springer; Berlin, Germany: 1963. [Google Scholar]
  • 67.Gauthier G., Latour A. Convergence forte des estimateurs des parametres d’un processus GENAR(p) Ann. Sci. Math. Que. 1994;18:49–71. [Google Scholar]
  • 68.Latour A. Existence and stochastic structure of a non-negative integer-valued autoregressive process. J. Time Ser. Anal. 1998;19:439–455. [Google Scholar]
  • 69.Rydberg T.H., Shephard N. Econometric Society World Congress. Econometric Society; Cambridge, UK: 2000. BIN models for trade-by-trade data. Modelling the number of trades in a fixed interval of time. Contributed Papers No. 0740. [Google Scholar]
  • 70.Brandt P.T., Williams J.T. A linear Poisson autoregressive model: The Poisson AR(p) model. Polit. Anal. 2001;9:164–184. [Google Scholar]
  • 71.Heinen A. Core Discussion Paper. Volume 62. University of Louvain; Louvain, Belgium: 2003. [(accessed on 18 May 2020)]. Modelling time series count data: An autoregressive conditional Poisson model. MPRA Paper No. 8113. Available online: https://mpra.ub.uni-muenchen.de/8113. [Google Scholar]
  • 72.Held L., Hofmann M., Höhle M., Schmid V. A two-component model for counts of infectious diseases. Biostatistics. 2006;7:422–437. doi: 10.1093/biostatistics/kxj016. [DOI] [PubMed] [Google Scholar]
  • 73.Finkenstädt B.F., Bjornstad O.N., Grenfell B.T. A stochastic model for extinction and recurrence of epidemics: Estimation and inference for measles outbreak. Biostatistics. 2002;3:493–510. doi: 10.1093/biostatistics/3.4.493. [DOI] [PubMed] [Google Scholar]
  • 74.Ferland R., Latour A., Oraichi D. Integer-valued GARCH process. J. Time Ser. Anal. 2006;27:923–942. [Google Scholar]
  • 75.Weiß C.H. Modelling time series of counts with overdispersion. Stat. Methods Appl. 2009;18:507–519. [Google Scholar]
  • 76.Weiß C.H. The INARCH(1) model for overdispersed time series of counts. Comm. Stat. Sim. Comp. 2010;39:1269–1291. [Google Scholar]
  • 77.Weiß C.H. INARCH(1) processes: Higher-order moments and jumps. Stat. Probab. Lett. 2010;80:1771–1780. [Google Scholar]
  • 78.Weiß C.H., Testik M.C. Detection of abrupt changes in count data time series: Cumulative sum derivations for INARCH(1) models. J. Qual. Technol. 2012;44:249–264. [Google Scholar]
  • 79.Kaslow R.A., Evans A.S. Epidemiologic concepts and methods. In: Evans A.S., Kaslow R.A., editors. Viral Infections of Humans. Springer; New York, NY, USA: 1997. pp. 3–58. [Google Scholar]
  • 80.Osterholm M.T., Hedberg C.W. Epidemiologic principles. In: Bennett J.E., Dolin R., Blaser M.J., editors. Mandell, Douglas, and Bennett’s Principles and Practice of Infectious Diseases. 8th ed. Elsevier; Philadelphia, PA, USA: 2015. pp. 146–157. [Google Scholar]
  • 81.Grassly N.C., Fraser C. Mathematical models of infectious disease transmission. Nat. Rev. 2008;6:477–487. doi: 10.1038/nrmicro1845. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 82.Keeling M.J., Rohani P. Modeling Infectious Diseases in Humans and Animals. Princeton UP; Princeton, NJ, USA: 2008. [Google Scholar]
  • 83.Yan P. Distribution theory stochastic processes and infectious disease modelling. In: Brauer F., van den Driessche P., Wu J., editors. Mathematical Epidemiology. Springer; Berlin, Germany: 2008. pp. 229–293. [Google Scholar]
  • 84.Yan P., Chowell G. Quantitative Methods for Investigating Infectious Disease Outbreaks. Springer; Cham, Switzerland: 2019. [Google Scholar]
  • 85.Britton T. Stochastic epidemic models: A survey. Math. Biosc. 2010;225:24–35. doi: 10.1016/j.mbs.2010.01.006. [DOI] [PubMed] [Google Scholar]
  • 86.Diekmann O., Heesterbeek H., Britton T. Mathematical Tools for Understanding Infectious Disease Dynamics. Princeton University Press; Princeton, NJ, USA: 2013. [Google Scholar]
  • 87.Cummings D.A.T., Lessler J. Infectious disease dynamics. In: Nelson K.E., Masters Williams C., editors. Infectious Disease Epidemiology: Theory and Practice. Jones & Bartlett Learning; Burlington, MA, USA: 2014. pp. 131–166. [Google Scholar]
  • 88.Just W., Callender H., Drew LaMar M., Toporikova N. Transmission of infectious diseases: Data, models and simulations. In: Robeva R.S., editor. Algebraic and Discrete Mathematical Methods of Modern Biology. Elsevier; London, UK: 2015. pp. 193–215. [Google Scholar]
  • 89.Britton T., Giardina F. Introduction to statistical inference for infectious diseases. J. Soc. Franc. Stat. 2016;157:53–70. [Google Scholar]
  • 90.Fine P.E.M. The interval between successive cases of an infectious disease. Am. J. Epidemiol. 2003;158:1039–1047. doi: 10.1093/aje/kwg251. [DOI] [PubMed] [Google Scholar]
  • 91.Svensson A. A note on generation times in epidemic models. Math. Biosci. 2007;208:300–311. doi: 10.1016/j.mbs.2006.10.010. [DOI] [PubMed] [Google Scholar]
  • 92.Svensson A. The influence of assumptions on generation time distributions in epidemic models. Math. Biosci. 2015;270:81–89. doi: 10.1016/j.mbs.2015.10.006. [DOI] [PubMed] [Google Scholar]
  • 93.Wallinga J., Lipsitch M. How generation intervals shape the relationship between growth rates and reproductive numbers. Proc. R. Soc. B. 2007;274:599–604. doi: 10.1098/rspb.2006.3754. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 94.Forsberg White L., Pagano M. A likelihood-based method for real-time estimation of the serial interval and reproductive number of an epidemic. Stat. Med. 2008;27:2999–3016. doi: 10.1002/sim.3136. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 95.Nishiura H. Time variations in the generation time of an infectious disease: Implications for sampling to appropriately quantify transmission potential. Math. Biosci. 2010;7:851–869. doi: 10.3934/mbe.2010.7.851. [DOI] [PubMed] [Google Scholar]
  • 96.Scalia Tomba G., Svensson A., Asikainen T., Giesecke J. Some model based considerations on observing generation times for communicable diseases. Math. Biosci. 2010;223:24–31. doi: 10.1016/j.mbs.2009.10.004. [DOI] [PubMed] [Google Scholar]
  • 97.Trichereau J., Verret C., Mayet A., Manet G. Estimation of the reproductive number for A(H1N1) pdm09 influenza among the French armed forces, September 2009–March 2010. J. Infect. 2012;64:628–630. doi: 10.1016/j.jinf.2012.02.005. [DOI] [PubMed] [Google Scholar]
  • 98.Vink M.A., Bootsma M.C.J., Wallinga J. Serial intervals of respiratory infectious diseases: A systematic review and analysis. Am. J. Epidemiol. 2014;180:865–875. doi: 10.1093/aje/kwu209. [DOI] [PubMed] [Google Scholar]
  • 99.Champredon D., Dushoff J. Intrinsic and realized generation intervals in infectious-disease transmission. Proc. R. Soc. B. 2015;282:20152026. doi: 10.1098/rspb.2015.2026. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 100.An der Heiden M., Hamouda O. Schätzung der aktuellen Entwicklung der SARS-CoV-2-Epidemie in Deutschland— Nowcasting. Epid. Bull. 2020;17:10–16. (In Germany) [Google Scholar]
  • 101.Ferretti L., Wymant C., Kendall M., Zhao L., Nurtay A., Abeler-Dörner L., Parker M., Bonsall D., Fraser C. Quantifying SARS-CoV-2 transmission suggests epidemic control with digital contact tracing. Science. 2020;368:eabb6936. doi: 10.1126/science.abb6936. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 102.Ganyani T., Kremer C., Chen D., Torneri A., Faes C., Wallinga J., Hens N. Estimating the generation interval for COVID-19 based on symptom onset data. medRxiv Prepr. 2020 doi: 10.1101/2020.03.05.20031815. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 103.Li M., Liu K., Song Y., Wang M., Wu J. Serial interval and generation interval for respectively the imported and local infectors estimated using reported contact-tracing data of COVID-19 in China. medRxiv Prepr. 2020 doi: 10.1101/2020.04.15.20065946. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 104.Nishiura H., Linton N.M., Akhmetzhanov A.R. Serial interval of novel coronavirus (COVID-19) infections. medRxiv Prepr. 2020 doi: 10.1101/2020.02.03.20019497. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 105.Park M., Cook A.R., Lim J.J., Sun X., Dickens B.L. A systematic review of COVID-19 epidemiology based on current evidence. J. Clin. Med. 2020;9:967. doi: 10.3390/jcm9040967. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 106.Spouge J.L. An accurate approximation for the expected site frequency spectrum in a Galton-Watson process under an infinite sites mutation model. Theor. Popul. Biol. 2019;127:7–15. doi: 10.1016/j.tpb.2019.03.001. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 107.Taneyhill D.E., Dunn A.M., Hatcher M.J. The Galton-Watson branching process as a quantitative tool in parasitology. Parasitol. Today. 1999;15:159–165. doi: 10.1016/s0169-4758(99)01417-9. [DOI] [PubMed] [Google Scholar]
  • 108.Parnes D. Analyzing the contagion effect of foreclosures as a branching process: A close look at the years that follow the Great Recession. J. Account. Financ. 2017;17:9–34. [Google Scholar]
  • 109.Le Cam L. Asymptotic Methods in Statistical Decision Theory. Springer; New York, NY, USA: 1986. [Google Scholar]
  • 110.Heyde C.C., Johnstone I.M. On asymptotic posterior normality for stochastic processes. J. R. Stat. Soc. B. 1979;41:184–189. [Google Scholar]
  • 111.Johnson R.A., Susarla V., van Ryzin J. Bayesian non-parametric estimation for age-dependent branching processes. Stoch. Proc. Appl. 1979;9:307–318. [Google Scholar]
  • 112.Scott D. On posterior asymptotic normality and asymptotic normality of estimators for the Galton-Watson process. J. R. Stat. Soc. B. 1987;49:209–214. [Google Scholar]
  • 113.Yanev N.M., Tsokos C.P. Decision-theoretic estimation of the offspring mean in mortal branching processes. Comm. Stat. Stoch. Models. 1999;15:889–902. [Google Scholar]
  • 114.Mendoza M., Gutierrez-Pena E. Bayesian conjugate analysis of the Galton-Watson process. Test. 2000;9:149–171. [Google Scholar]
  • 115.Feicht R., Stummer W. An explicit nonstationary stochastic growth model. In: De La Grandville O., editor. Economic Growth and Development (Frontiers of Economics and Globalization, Vol. 11) Emerald Group Publishing Limited; Bingley, UK: 2011. pp. 141–202. [Google Scholar]
  • 116.Dorn F., Fuest C., Göttert M., Krolage C., Lautenbacher S., Link S., Peichl A., Reif M., Sauer S., Stöckli M., et al. Die volkswirtschaftlichen Kosten des Corona-Shutdown für Deutschland: Eine Szenarienrechnung. ifo Schnelldienst. 2020;73:29–35. (In Germany) [Google Scholar]
  • 117.Dorn F., Khailaie S., Stöckli M., Binder S., Lange B., Peichl A., Vanella P., Wollmershäuser T., Fuest C., Meyer-Hermann M. Das gemeinsame Interesse von Gesundheit und Wirtschaft: Eine Szenarienrechnung zur Eindämmung der Corona-Pandemie. ifo Schnelld. Dig. 2020;6:1–9. [Google Scholar]
  • 118.Kißlinger A.-L., Stummer W. A new toolkit for robust distributional change detection. Appl. Stoch. Models Bus. Ind. 2018;34:682–699. [Google Scholar]
  • 119.Dehning J., Zierenberg J., Spitzner F.P., Wibral M., Neto J.P., Wilczek M., Priesemann V. Inferring change points in the spread of COVID-19 reveals the effectiveness of interventions. Science. 2020;369:eabb9789. doi: 10.1126/science.abb9789. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 120.Friesen M. Statistical surveillance. Optimality and methods. Int. Stat. Review. 2003;71:403–434. [Google Scholar]
  • 121.Friesen M., Andersson E., Schiöler L. Robust outbreak surveillance of epidemics in Sweden. Stat. Med. 2009;28:476–493. doi: 10.1002/sim.3483. [DOI] [PubMed] [Google Scholar]
  • 122.Brauner J.M., Mindermann S., Sharma M., Stephenson A.B., Gavenciak T., Johnston D., Salvatier J., Leech G., Besiroglu T., Altman G., et al. The effectiveness and perceived burden of nonpharmaceutical interventions against COVID-19 transmission: A modelling study with 41 countries. medRxiv Prepr. 2020 doi: 10.1101/2020.05.28.20116129. [DOI] [Google Scholar]
  • 123.Österreicher F., Vajda I. Statistical information and discrimination. IEEE Trans. Inform. Theory. 1993;39:1036–1039. [Google Scholar]
  • 124.De Groot M.H. Uncertainty, information and sequential experiments. Ann. Math. Statist. 1962;33:404–419. [Google Scholar]
  • 125.Krafft O., Plachky D. Bounds for the power of likelihood ratio tests and their asymptotic properties. Ann. Math. Stat. 1970;41:1646–1654. [Google Scholar]
  • 126.Basawa I.V., Scott D.J. Efficient tests for branching processes. Biometrika. 1976;63:531–536. [Google Scholar]
  • 127.Feigin P.D. The efficiency criteria problem for stochastic processes. Stoch. Proc. Appl. 1978;6:115–127. [Google Scholar]
  • 128.Sweeting T.J. On efficient tests for branching processes. Biometrika. 1978;65:123–127. [Google Scholar]
  • 129.Linkov Y.N. Lectures in Mathematical Statistics, Parts 1 and 2. American Mathematical Society; Providence, RI, USA: 2005. [Google Scholar]
  • 130.Feller W. Diffusion processes in genetics. In: Neyman J., editor. Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. University of California Press; Berkeley, CA, USA: 1951. pp. 227–246. [Google Scholar]
  • 131.Jirina M. On Feller’s branching diffusion process. Časopis Pěst. Mat. 1969;94:84–89. [Google Scholar]
  • 132.Lamperti J. Limiting distributions for branching processes. In: Le Cam L.M., Neyman J., editors. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. II, Part 2. University of California Press; Berkeley, CA, USA: 1967. pp. 225–241. [Google Scholar]
  • 133.Lamperti J. The limit of a sequence of branching processes. Z. Wahrscheinlichkeitstheorie Verw. Geb. 1967;7:271–288. [Google Scholar]
  • 134.Lindvall T. Convergence of critical Galton-Watson branching processes. J. Appl. Prob. 1972;9:445–450. [Google Scholar]
  • 135.Lindvall T. Limit theorems for some functionals of certain Galton-Watson branching processes. Adv. Appl. Prob. 1974;6:309–321. [Google Scholar]
  • 136.Grimvall A. On the convergence of sequences of branching processes. Ann. Probab. 1974;2:1027–1045. [Google Scholar]
  • 137.Borovkov K.A. On the convergence of branching processes to a diffusion process. Theor. Probab. Appl. 1986;30:496–506. [Google Scholar]
  • 138.Ethier S.N., Kurtz T.G. Markov Processes: Characterization and Convergence. Wiley; New York, NY, USA: 1986. [Google Scholar]
  • 139.Durrett R. Stochastic Calculus. CRC Press; Boca Raton, FL, USA: 1996. [Google Scholar]
  • 140.Kawazu K., Watanabe S. Branching processes with immigration and related limit theorems. Theor. Probab. Appl. 1971;16:36–54. [Google Scholar]
  • 141.Wei C.Z., Winnicki J. Some asymptotic results for the branching process with immigration. Stoch. Process. Appl. 1989;31:261–282. [Google Scholar]
  • 142.Sriram T.N. Invalidity of bootstrap for critical branching processes with immigration. Ann. Stat. 1994;22:1013–1023. [Google Scholar]
  • 143.Li Z. Branching processes with immigration and related topics. Front. Math. China. 2006;1:73–97. [Google Scholar]
  • 144.Dawson D.A., Li Z. Skew convolution semigroups and affine Markov processes. Ann. Probab. 2006;34:1103–1142. [Google Scholar]
  • 145.Cox J.C., Ingersoll J.E., Jr., Ross S.A. A theory of the term structure of interest rates. Econometrica. 1985;53:385–407. [Google Scholar]
  • 146.Cox J.C., Ross S.A. The valuation of options for alternative processes. J. Finan. Econ. 1976;3:145–166. [Google Scholar]
  • 147.Heston S.L. A closed-form solution for options with stochastic volatilities with applications to bond and currency options. Rev. Finan. Stud. 1993;6:327–343. [Google Scholar]
  • 148.Lansky P., Lanska V. Diffusion approximation of the neuronal model with synaptic reversal potentials. Biol. Cybern. 1987;56:19–26. doi: 10.1007/BF00333064. [DOI] [PubMed] [Google Scholar]
  • 149.Giorno V., Lansky P., Nobile A.G., Ricciardi L.M. Diffusion approximation and first-passage-time problem for a model neuron. Biol. Cybern. 1988;58:387–404. doi: 10.1007/BF00361346. [DOI] [PubMed] [Google Scholar]
  • 150.Lanska V., Lansky P., Smith C.E. Synaptic transmission in a diffusion model for neuron activity. J. Theor. Biol. 1994;166:393–406. doi: 10.1006/jtbi.1994.1035. [DOI] [PubMed] [Google Scholar]
  • 151.Lansky P., Sacerdote L., Tomassetti F. On the comparison of Feller and Ornstein-Uhlenbeck models for neural activity. Biol. Cybern. 1995;73:457–465. doi: 10.1007/BF00201480. [DOI] [PubMed] [Google Scholar]
  • 152.Ditlevsen S., Lansky P. Estimation of the input parameters in the Feller neuronal model. Phys. Rev. E. 2006;73:061910. doi: 10.1103/PhysRevE.73.061910. [DOI] [PubMed] [Google Scholar]
  • 153.Höpfner R. On a set of data for the membrane potential in a neuron. Math. Biosci. 2007;207:275–301. doi: 10.1016/j.mbs.2006.10.009. [DOI] [PubMed] [Google Scholar]
  • 154.Lansky P., Ditlevsen S. A review of the methods for signal estimation in stochastic diffusion leaky integrate-and-fire neuronal models. Biol. Cybern. 2008;99:253–262. doi: 10.1007/s00422-008-0237-x. [DOI] [PubMed] [Google Scholar]
  • 155.Pedersen A.R. Estimating the nitrous oxide emission rate from the soil surface by means of a diffusion model. Scand. J. Stat. Theory Appl. 2000;27:385–403. [Google Scholar]
  • 156.Aalen O.O., Gjessing H.K. Survival models based on the Ornstein-Uhlenbeck process. Lifetime Data Anal. 2004;10:407–423. doi: 10.1007/s10985-004-4775-9. [DOI] [PubMed] [Google Scholar]
  • 157.Kammerer N.B. Ph.D. Thesis. University of Erlangen-Nürnberg; Erlangen, Germany: 2011. Generalized-Relative-Entropy Type Distances Between Some Branching Processes and Their Diffusion Limits. [Google Scholar]

Articles from Entropy are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES