EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS

Size: px
Start display at page:

Download "EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS"

Transcription

1 (February 25, 2004) EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS BEN CAIRNS, University of Queensland PHIL POLLETT, University of Queensland Abstract The birth, death and catastrophe process is an extension of the birth-death process that incorporates the possibility of reductions in population of arbitrary size. We will consider a general form of this model, in which the transition rates are allowed to depend on the current population size in an arbitrary manner. The linear case, where the transition rates are proportional to current population size, has been studied extensively. In particular, extinction probabilities, the expected time to extinction and the distribution of the population size conditional on non-extinction (the quasi-stationary distribution) have all been evaluated explicitly. However, whilst these characteristics are of interest in the modelling and management of populations, processes with linear rate coefficients represent only a very limited class of models. We addresses this limitation by allowing for a wider range of catastrophic events. Despite this generalisation, explicit expressions can still be found for the expected extinction times. CATASTROPHE PROCESSES; PERSISTENCE TIMES; HITTING TIMES. AMS 2000 SUBJECT CLASSIFICATION: PRIMARY 60J27 SECONDARY 92B05;60J80 1. Introduction Accounting for catastrophic events has become an important part of stochastic population modelling, particularly in ecology, but also in an array of other fields, including economics, chemistry and telecommunications. In the context of population processes, catastrophes are sudden declines in the population and, according to Shaffer [12] and others, they are one of the primary sources of variation in the abundance of species. The use of catastrophe processes, such as the ones described here, is not limited to studying the numbers of individuals in a population. Mangel and Tier [7], for example, have used a catastrophe process to model the number of occupied habitat patches in a metapopulation. For a review of the significance of catastrophes in ecological modelling, see [11]. Of primary importance is the effect of catastrophes on the persistence of a population, and in particular their effect on the expected time to extinction. Recent work, beginning with Brockwell et al. [3], examines extinction probabilities, conditions for eventual extinction Postal address: Department of Mathematics, The University of Queensland, Queensland 4072, Australia. address: bjc@maths.uq.edu.au Postal address: Department of Mathematics,The University of Queensland, Queensland 4072, Australia. address: pkp@maths.uq.edu.au 1

2 2 Ben Cairns and Phil Pollett and expected extinction times, in a variety of different cases. Brockwell [2] laid out a programme for evaluating the probability of extinction and the Laplace transform of the distribution of the time to extinction for a general birth, death and catastrophe process. As Anderson points out (see Section 9.2 of [1]), Brockwell s argument can be used to evaluate expected extinction times, and indeed his entire programme extends, at least in principle, to any upwardly skip-free Markov chain. However, explicit results can only be obtained in particular cases. Here we examine one such case in which the transition rates are allowed to depend on the current population size. Our main result gives an explicit expression for the expected extinction times. We illustrate our result with several examples. 2. The model Let X(t) be the number in the population at time t, and suppose that (X(t), t 0) is a continuous-time Markov chain taking values in S = {0, 1,... }. Let f i (> 0) be the rate at which the population size changes when there are i individuals present, and suppose that, when a change occurs, it is a birth with probability a (> 0) or catastrophe of size k (the removal of k individuals) with probability d k, k 1. (Simple death events are to be interpretted as catastrophes of size 1.) Assume that d k > 0 for at least one k 1 and that a + k 1 d k = 1. Thus, the process has transition rates Q given by f i k i d k, j = 0, i 1, f i d i j, j = 1, 2,... i 1, i 2, q ij = f i, j = i, i 1, (1) f i a, j = i + 1, i 1, 0, otherwise. Notice, in particular, that q 0j = 0, j 0, and that q i0 > 0 for at least one i 1. Thus, the sole absorbing state 0, corresponding to population extinction, is accessible from {1, 2,... } (an irreducible class). The special case f i = ρi, where ρ (> 0) is a per-capita transition rate, was studied by Brockwell [2], Pakes [8] and Pollett [9]. Our purpose here is to evaluate the expected time to extinction for the present general model, thus extending Brockwell s results for the linear case. Whilst this model is quite general, it does have limitations. Firstly, it is frequently useful to separate death and catastrophe events, and to assign different rate functions to births, deaths and catastrophes, as in Mangel and Tier [7]. Another drawback is that the catastrophe size distribution does not depend on the number of individuals present. For example, it rules out two important cases: where the size of a catastrophe has (i) a binomial B(i, p) distribution (each of the i individuals present is removed with probability p) and (ii) a uniform distribution on the set {1, 2,..., i}; see for example [3]. 3. Extinction probabilities The probability of extinction does not depend on the event rates (f i, i 1), because the jump chain is the same in all cases. It was shown by Pakes [8] that the probability of

3 Extinction times for a catastrophe process 3 extinction α i, starting with i individuals, is 1 for all i 1 if and only if the drift D (drift away from 0), given by D = a id i = 1 (i + 1)d i, is less than or equal to 0. Note that the process is said to be subcritical, critical or supercritical according as D < 0, D = 0 or D > 0. In the latter case extinction is of course still possible, and the extinction probabilities can be expressed in terms of the probability generating function d(s) = a + d i s i+1, s < 1. (2) (Note that D = 1 d (1 ) and this satisfies D 1.) It follows from Theorem 4 of [5] (see also [8]) that, when D > 0, (1 α i)s i = Ds/(d(s) s). Thus, writing b(s) = d(s) s, we see that α i s i 1 = 1 1 s D b(s). (3) It is interesting to note that α i tends to 0 as i tends to ; roughly speaking, the larger the initial population the less likely the population is to become extinct (in the supercritical case). However, as Pakes [8] notes, the convergence of α i to 0 can be very slow. For example, it is easy to show, letting s 1 in (3) and using L Hôpital s rule twice, that α i = d (1 )/(2D), and so this is finite if and only if the variance of the catastrophe size distribution is finite. 4. Explosions One interesting aspect of the present model is that the process may explode (that is, the population size may reach infinity in a finite time). Of course this can only occur in the supercritical case, for as we have already noted, the process hits 0 with probability 1 in the subcritical and critical cases. It is easy to exhibit explosive behaviour, for imagine that there is no catastrophe component in the model. We obtain the pure-birth process with birth rates q i,i+1 = f i a, and this is well known to be explosive if and only if g i <, where g i = 1/f i. If death transitions are included, that is, q i,i 1 = f i b, where a + b = 1, then the resulting birth-death process is explosive if and only if a > b (supercritical) and g i < (apply Theorem of [1]). It might therefore be conjectured that the general birth, death and catastrophe process is explosive if and only if it is supercritical and g i <. Our first result establishes that this is indeed the case. Theorem 1. The birth, death and catastrophe process with transition rates (1) is nonexplosive if and only if 1/f i = or id i a.

4 4 Ben Cairns and Phil Pollett Proof. Recall that D = a id i. We will use results contained in [4] to prove that Q is always regular (the process is non-explosive) if D 0, while if D > 0, then Q is regular if and only if 1/f i =. Theorem 1 of [4] applies to any conservative q-matrix Q = (q ij ) defined on the nonnegative integers that is upwardly skip free in that q i,i+1 > 0, for all i 1, and q ij = 0 if j > i + 1. It states that Q is regular if and only if ( R n = q n,n+1 n m 1 m=1 k=0 n=1 R n =, where R 0 = 1 and ) q nk R m 1, n 1. (4) This result was obtained using Reuter s [10] condition (Theorem (2) of [1]) to first establish that Q is regular if and only if q n,n+1 (u n+1 u n ) = u n + n m 1 m=1 k=0 q nk (u m u m 1 ), 0 u n 1, n 0, has only the trivial solution, and then proving that this is equivalent to n=1 R n = using a generalization of Reuter s lemma (Lemma of [1]). Set g i = 1/f i, so that (4) can be written where, for m < n + 1, Since v n (m) Then, (5) becomes R n = 1 q n,n+1 + v n (m 1) = 1 m 1 q nk = g n q n,n+1 a k=0 n m=1 R m 1 v (m 1) n, n 1, (5) ( k=n m 1 d k + g n k=1 d n k g n ) = 1 a k=n m+1 depends on m and n only though the difference n m, let us write v (m) n = v n m. R n = g n 1 n a + m=0 R m v n m, n 1, remembering that R 0 = 1. On introducing generating functions R(s) = n=0 R ns n, v(s) = v is i and g(s) = g is i, we find that R(s)(1 v(s)) = 1 + g(s)/a. It is then easy to prove that b(s) = a(1 s)(1 v(s)), which implies that and hence, if b(s) 0, R(s) b(s) 1 s d k. = a + g(s), (6) R(s) 1 s = a + g(s). (7) b(s)

5 Extinction times for a catastrophe process 5 We know, from Section V.12 of Harris [6], that 1/b(s) has a power series expansion with positive coefficients and with radius of convergence σ, where σ is the smallest zero of b on (0, 1]. Furthermore, σ = 1 or σ < 1 according as D 0 or D < 0, and b(s) > 0 for all s [0, σ). Thus, if D < 0, then letting s σ in (7) gives R(σ) =, implying that n=0 R n =. If D 0, then because D = b (1 ), letting s 1 in (6) gives D n=0 R n = a + n=1 g n (> 0). Therefore, if D = 0, then then n=0 R n = if and only if n=0 R n =, while if D > 0, g i =. This completes the proof. 5. Expected extinction times We shall restrict our attention to the subcritical case (D < 0), where extinction occurs with probability 1, and make some remarks about the other cases at the end of this section. For a general Markov chain with transition rates Q = (q ij, i, j S), whose state space consists of an irreducible class {1, 2,... } and a single absorbing state 0 that is reached with probability 1, the expected absorption time τ i, starting in state i, is the minimal non-negative solution to the system of equations q ij z j + 1 = 0, i 1, (8) j 0 with z 0 = 0. In the present case, (8) becomes i 1 f i az i+1 f i z i + f i d i j z j + 1 = 0, i 1, with the empty sum being interpretted as 0 when i = 1. This can be written i 1 az i+1 z i + d i j z j + g i = 0, i 1. (9) On multiplying by s i and then summing over i, we find that the generating function h(s) = z is i 1 of any solution (z i, i 1) to (9) must satisfy b(s)h(s) az 1 + g(s) = 0. (We delay addressing the question of whether the solution is non-negative.) We have already noted that 1/b(s) has a power series expansion with positive coefficients and with radius of convergence σ, and that b(s) > 0 for all s [0, σ). (In the present subcritical case, σ < 1.) Let us write e(s) = 1/b(s) = j=0 e js j, s < σ, where e j > 0, noting that a = b(0) = 1/e 0. Letting κ = az 1, we obtain ( ) i h(s) = z 1 + κe i g j e i j s i, and hence, for i 2, i 1 z i = κe i 1 g j e i 1 j. (10)

6 6 Ben Cairns and Phil Pollett Now, (e i ) is an increasing sequence. To see this, observe that if we had g i = 0 for all i, then we would have z i = κe i 1 and then, from (9), i 1 ae i e i 1 + d i j e j 1 = 0, i 1, (11) with the empty sum being interpretted as 0 when i = 1. Hence, (e i ) satisfies i 1 a(e i e i 1 ) = d i j (e i 1 e j 1 ) + e i 1 j=i d j, i 1. Since e 0 = 1/a > 0 and d j > 0 for at least one j 1, a straightforward inductive argument shows that (e i ) is increasing. Therefore, referring to (10), (z i ) is the difference of two non-negative increasing sequences. Thus, in order to ensure that (z i ) itself is non-negative, we require κ sup i 1 h i, where h i = 1 e i i g j e i j = i ( ) ei j g j. (12) e i The minimal solution is then obtained on setting κ = sup i 1 h i. Since (e i ) is increasing, we have 0 < e i j /e i 1 for all i j 0. Moreover, because σ is the radius of convergence of j=0 e js j, we have σ = lim i e i 1 /e i, whenever this limit exists, implying that e i j /e i σ j for each j. Hence, formally, h i g(σ). Once we prove that this limit exists and equals sup i 1 h i, we may set κ = g(σ) to obtain the minimal non-negative solution to (9). To achieve this, we will draw further on branching process theory. Since e(s) has a power series expansion with positive coefficients, then so does π(s) = aπ 1 s 0 du, s < σ. b(u) Indeed, writing π(s) = π is i, it is easy to see that π i /π 1 = ae i 1 /i, i 1. However, the coefficients (π i ) form a stationary measure on {1, 2,... } for the Markov Branching Process with offspring distribution (q i, i 0), where q 0 = a, q 1 = 0 and q i = d i 1 for i 2 (refer to the corollary of Theorem V.12.2 of [6]). Theorem 1(e) of [14] then gives iπ i σ i aπ 1 /(1 d (σ)), as i, whenever D 0 (note that d (σ) < 1 since b (σ) < 0 when D 0). Consequently, e i σ i+1 1/(1 d (σ)). Thus, by the monotonicity of this limit, e i 1 /e i σ and hence e i j /e i σ j for j = 1,..., i. Furthermore, e i j /e i σ j as i. Applying the Dominated Convergence Theorem to (12) shows that if g(σ) <, then h i g(σ) and hence sup i 1 h i = g(σ) because h i g(σ). On the other hand, Fatou s Lemma always gives lim inf i h i g(σ), so that if g(σ) =, then sup i 1 h i =. We have therefore proved the following result.

7 Extinction times for a catastrophe process 7 Theorem 2. For the subcritical birth, death and catastrophe process with transition rates (1), let (e i, i 0) be the coefficients of the power series expansion of e(s) = 1/(d(s) s), s < σ, where d(s) is given by (2), and σ (< 1) is the smallest solution of d(s) = s in (0, 1]. Then, the expected extinction time τ i, starting in state i, is finite if and only if κ := σi /f i <, in which case τ 0 = 0 and i 1 τ i = κe i 1 e i 1 j /f j, i 1. (13) We conclude this section with some remarks on the critical and supercritical cases, both of which have σ = 1. Theorem 2 is certainly valid in the critical case provided d (1 ) < (which corresponds to the variance of the catastrophe size distribution being finite): the expected extinction times are all finite if and only if κ := 1/f i <, in which case (13) holds. This is true because, as i, e i 1 /i 2/d (1) > 0 (Theorem 1(c) of [14]) and hence e i j /e i 1. (The infinite variance case is mathematically delicate, and we will not pursue it further here.) In the supercritical case, where there is a probability α i of extinction, starting in i, which is strictly less than 1 (and therefore the expected extinction times are infinite), it is possible to evaluate expected extinction times conditional on extinction occurring. This can be done by interpreting the result of Theorem 2 for the (subcritical) birth, death and catastrophe process with transitions rates q ij = q ij α j /α i, and following the progamme laid out in [13]. 6. Examples First let us examine the linear case studied by Brockwell [2]. This has f i = ρi, where ρ > 0. So, g(s) = log(1 s)/ρ, s < 1, implying that g(σ) is finite whenever σ < 1. Setting κ = log(1 σ)/ρ, we get from (13) ( τ i = 1 ( ) ) 1 i 2 e j e i 1 log, i 1. ρ 1 σ i j 1 j=0 This is equivalent to τ i s i 1 = 1 ρb(s) log ( ) 1 s, s < σ, 1 σ which is equation (3.1) of [2]. Further examples of the subcritical birth, death and catastrophe process for which the expected extinction times are finite include the case (i) where events occur at a constant rate f i = ρ > 0, independent of the population size, giving κρ = σ/(1 σ), and, (ii) where f i = ρi(i + 1), giving ( ) ( ) 1 σ 1 κρ = 1 log. σ 1 σ

8 8 Ben Cairns and Phil Pollett If f i = ρβ i 1, where ρ, β > 0, then the expected extinction times are finite only if σ < β, in which case κρ = βσ/(β σ). Explicit results can be obtained in the case where the catastrophe size follows a geometric law. Suppose that d i = b(1 q)q i 1, i 1, where b (> 0) satisfies a + b = 1, and 0 q < 1. The simple birth-death process with linear birth and linear death rates is recovered on setting q = 0. It is easy to see that D = a b/(1 q), and so D < 0 or D 0 according as c > 1 or c 1, where c = q + b/a. We also have b(s) = (b + qa)s2 (1 + qa)s + a 1 qs = a(1 s)(1 cs), 1 qs and hence if D < 0, then σ = 1/c (< 1). The coefficients of the power series 1/b(s) = j=0 e js j are easily evaluated using partial fractions. If D < 0 (or indeed if D > 0), then e j = 1 q (c q)cj, j 0. a(1 c) We may evaluate τ i by substituting these expressions into (13). If, for example, f i = ρβ i 1, where ρ, β > 0, then if β = 1, τ i = 1 + (1 q)(i 1) ρ(b a(1 q)), i 1, while if β 1, the expected extinction times are finite only if β > a/(b + qa), in which case where γ = 1/β. τ i = 1 q (γ q)γi 1 ρ(b a(γ q))(1 γ), i 1, Acknowledgements We would like to thank the referee for helpful suggestions. The support of the Australian Research Council is gratefully acknowledged (Grant No. A ). The work of the first author is supported by a PhD scholarship from the Australian Research Council Centre of Excellence for Mathematics and Statistics of Complex Systems. References [1] Anderson, W. (1991). Continuous-Time Markov Chains: An Applications-Oriented Approach. Springer-Verlag, New York. [2] Brockwell, P. (1985). The extinction time of a birth, death and catastrophe process and of a related diffusion model. Adv. Appl. Probab. 17, [3] Brockwell, P., Gani, J. and Resnick, S. (1982). Birth, immigration and catastrophe processes. Adv. Appl. Probab. 14,

9 Extinction times for a catastrophe process 9 [4] Chen, A., Pollett, P., Zhang, H. and Cairns, B. (2003). Uniqueness criteria for continuous-time Markov chains with general transition structure. Submitted for publication. [5] Ezhov, I. and Reshetnyak, V. (1983). A modification of the branching process. Ukranian Math. J. 35, [6] Harris, T. (1963). The Theory of Branching Processes. Springer-Verlag, Berlin. [7] Mangel, M. and Tier, C. (1993). Dynamics of metapopulations with demographic stochasticity and environmental catastrophes. Theoret. Pop. Biol. 44, [8] Pakes, A. (1987). Limit theorems for the population size of a birth and death process allowing catastrophes. J. Math. Biol. 25, [9] Pollett, P. (2001). Quasi-stationarity in populations that are subject to large-scale mortality or emigration. Environment International 27, [10] Reuter, G. (1957). Denumerable Markov processes and the associated contraction semigroups on l. Acta Math. 97, [11] Shafer, C. (2001). Inter-reserve distance. Biological Conservation 100, [12] Shaffer, M. (1981). Minimum population sizes for species conservation. BioScience 31, [13] Walker, D. (1998). The expected time till absorption when absorption is not certain. J. Appl. Probab. 35, [14] Yang, Y. (1973). Asymptotic properties of the stationary measure of a Markov branching process. J. Appl. Probab. 10,

EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS

EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS J. Appl. Prob. 41, 1211 1218 (2004) Printed in Israel Applied Probability Trust 2004 EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS BEN CAIRNS and P. K. POLLETT, University of Queensland

More information

Integrals for Continuous-time Markov chains

Integrals for Continuous-time Markov chains Integrals for Continuous-time Markov chains P.K. Pollett Abstract This paper presents a method of evaluating the expected value of a path integral for a general Markov chain on a countable state space.

More information

A Method for Evaluating the Distribution of the Total Cost of a Random Process over its Lifetime

A Method for Evaluating the Distribution of the Total Cost of a Random Process over its Lifetime A Method for Evaluating the Distribution of the Total Cost of a Random Process over its Lifetime P.K. Pollett a and V.T. Stefanov b a Department of Mathematics, The University of Queensland Queensland

More information

Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing

Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 2, pp. 401 412 (2013) http://campus.mst.edu/adsa Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes

More information

Quasi-Stationary Distributions in Linear Birth and Death Processes

Quasi-Stationary Distributions in Linear Birth and Death Processes Quasi-Stationary Distributions in Linear Birth and Death Processes Wenbo Liu & Hanjun Zhang School of Mathematics and Computational Science, Xiangtan University Hunan 411105, China E-mail: liuwenbo10111011@yahoo.com.cn

More information

Central limit theorems for ergodic continuous-time Markov chains with applications to single birth processes

Central limit theorems for ergodic continuous-time Markov chains with applications to single birth processes Front. Math. China 215, 1(4): 933 947 DOI 1.17/s11464-15-488-5 Central limit theorems for ergodic continuous-time Markov chains with applications to single birth processes Yuanyuan LIU 1, Yuhui ZHANG 2

More information

SIMILAR MARKOV CHAINS

SIMILAR MARKOV CHAINS SIMILAR MARKOV CHAINS by Phil Pollett The University of Queensland MAIN REFERENCES Convergence of Markov transition probabilities and their spectral properties 1. Vere-Jones, D. Geometric ergodicity in

More information

Quasi-stationary distributions

Quasi-stationary distributions Quasi-stationary distributions Phil Pollett Discipline of Mathematics The University of Queensland http://www.maths.uq.edu.au/ pkp AUSTRALIAN RESEARCH COUNCIL Centre of Excellence for Mathematics and Statistics

More information

Linear-fractional branching processes with countably many types

Linear-fractional branching processes with countably many types Branching processes and and their applications Badajoz, April 11-13, 2012 Serik Sagitov Chalmers University and University of Gothenburg Linear-fractional branching processes with countably many types

More information

Irregular Birth-Death process: stationarity and quasi-stationarity

Irregular Birth-Death process: stationarity and quasi-stationarity Irregular Birth-Death process: stationarity and quasi-stationarity MAO Yong-Hua May 8-12, 2017 @ BNU orks with W-J Gao and C Zhang) CONTENTS 1 Stationarity and quasi-stationarity 2 birth-death process

More information

LIMIT THEOREMS FOR NON-CRITICAL BRANCHING PROCESSES WITH CONTINUOUS STATE SPACE. S. Kurbanov

LIMIT THEOREMS FOR NON-CRITICAL BRANCHING PROCESSES WITH CONTINUOUS STATE SPACE. S. Kurbanov Serdica Math. J. 34 (2008), 483 488 LIMIT THEOREMS FOR NON-CRITICAL BRANCHING PROCESSES WITH CONTINUOUS STATE SPACE S. Kurbanov Communicated by N. Yanev Abstract. In the paper a modification of the branching

More information

EXTINCTION PROBABILITY IN A BIRTH-DEATH PROCESS WITH KILLING

EXTINCTION PROBABILITY IN A BIRTH-DEATH PROCESS WITH KILLING EXTINCTION PROBABILITY IN A BIRTH-DEATH PROCESS WITH KILLING Erik A. van Doorn and Alexander I. Zeifman Department of Applied Mathematics University of Twente P.O. Box 217, 7500 AE Enschede, The Netherlands

More information

2. Transience and Recurrence

2. Transience and Recurrence Virtual Laboratories > 15. Markov Chains > 1 2 3 4 5 6 7 8 9 10 11 12 2. Transience and Recurrence The study of Markov chains, particularly the limiting behavior, depends critically on the random times

More information

Extinction times for a birth-death process with two phases

Extinction times for a birth-death process with two phases Extinction times for a birth-death process with two phases J.V. Ross P.K. Pollett January 6, 2006 Abstract Many populations have a negative impact on their habitat or upon other species in the environment

More information

Department of Applied Mathematics Faculty of EEMCS. University of Twente. Memorandum No Birth-death processes with killing

Department of Applied Mathematics Faculty of EEMCS. University of Twente. Memorandum No Birth-death processes with killing Department of Applied Mathematics Faculty of EEMCS t University of Twente The Netherlands P.O. Box 27 75 AE Enschede The Netherlands Phone: +3-53-48934 Fax: +3-53-48934 Email: memo@math.utwente.nl www.math.utwente.nl/publications

More information

RECENT RESULTS FOR SUPERCRITICAL CONTROLLED BRANCHING PROCESSES WITH CONTROL RANDOM FUNCTIONS

RECENT RESULTS FOR SUPERCRITICAL CONTROLLED BRANCHING PROCESSES WITH CONTROL RANDOM FUNCTIONS Pliska Stud. Math. Bulgar. 16 (2004), 43-54 STUDIA MATHEMATICA BULGARICA RECENT RESULTS FOR SUPERCRITICAL CONTROLLED BRANCHING PROCESSES WITH CONTROL RANDOM FUNCTIONS Miguel González, Manuel Molina, Inés

More information

Metapopulations with infinitely many patches

Metapopulations with infinitely many patches Metapopulations with infinitely many patches Phil. Pollett The University of Queensland UQ ACEMS Research Group Meeting 10th September 2018 Phil. Pollett (The University of Queensland) Infinite-patch metapopulations

More information

Computable bounds for the decay parameter of a birth-death process

Computable bounds for the decay parameter of a birth-death process Loughborough University Institutional Repository Computable bounds for the decay parameter of a birth-death process This item was submitted to Loughborough University's Institutional Repository by the/an

More information

arxiv: v1 [math.pr] 1 Jan 2013

arxiv: v1 [math.pr] 1 Jan 2013 The role of dispersal in interacting patches subject to an Allee effect arxiv:1301.0125v1 [math.pr] 1 Jan 2013 1. Introduction N. Lanchier Abstract This article is concerned with a stochastic multi-patch

More information

Limit theorems for discrete-time metapopulation models

Limit theorems for discrete-time metapopulation models MASCOS AustMS Meeting, October 2008 - Page 1 Limit theorems for discrete-time metapopulation models Phil Pollett Department of Mathematics The University of Queensland http://www.maths.uq.edu.au/ pkp AUSTRALIAN

More information

Lectures on Probability and Statistical Models

Lectures on Probability and Statistical Models Lectures on Probability and Statistical Models Phil Pollett Professor of Mathematics The University of Queensland c These materials can be used for any educational purpose provided they are are not altered

More information

Stochastic modelling of epidemic spread

Stochastic modelling of epidemic spread Stochastic modelling of epidemic spread Julien Arino Centre for Research on Inner City Health St Michael s Hospital Toronto On leave from Department of Mathematics University of Manitoba Julien Arino@umanitoba.ca

More information

LIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974

LIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974 LIMITS FOR QUEUES AS THE WAITING ROOM GROWS by Daniel P. Heyman Ward Whitt Bell Communications Research AT&T Bell Laboratories Red Bank, NJ 07701 Murray Hill, NJ 07974 May 11, 1988 ABSTRACT We study the

More information

Modern Discrete Probability Branching processes

Modern Discrete Probability Branching processes Modern Discrete Probability IV - Branching processes Review Sébastien Roch UW Madison Mathematics November 15, 2014 1 Basic definitions 2 3 4 Galton-Watson branching processes I Definition A Galton-Watson

More information

On hitting times and fastest strong stationary times for skip-free and more general chains

On hitting times and fastest strong stationary times for skip-free and more general chains On hitting times and fastest strong stationary times for skip-free and more general chains James Allen Fill 1 Department of Applied Mathematics and Statistics The Johns Hopkins University jimfill@jhu.edu

More information

SMSTC (2007/08) Probability.

SMSTC (2007/08) Probability. SMSTC (27/8) Probability www.smstc.ac.uk Contents 12 Markov chains in continuous time 12 1 12.1 Markov property and the Kolmogorov equations.................... 12 2 12.1.1 Finite state space.................................

More information

1 Types of stochastic models

1 Types of stochastic models 1 Types of stochastic models Models so far discussed are all deterministic, meaning that, if the present state were perfectly known, it would be possible to predict exactly all future states. We have seen

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journal of Inequalities in Pure and Applied Mathematics ASYMPTOTIC EXPANSION OF THE EQUIPOISE CURVE OF A POLYNOMIAL INEQUALITY ROGER B. EGGLETON AND WILLIAM P. GALVIN Department of Mathematics Illinois

More information

arxiv: v2 [math.pr] 4 Sep 2017

arxiv: v2 [math.pr] 4 Sep 2017 arxiv:1708.08576v2 [math.pr] 4 Sep 2017 On the Speed of an Excited Asymmetric Random Walk Mike Cinkoske, Joe Jackson, Claire Plunkett September 5, 2017 Abstract An excited random walk is a non-markovian

More information

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

ON THE COMPLETE LIFE CAREER OF POPULATIONS IN ENVIRONMENTS WITH A FINITE CARRYING CAPACITY. P. Jagers

ON THE COMPLETE LIFE CAREER OF POPULATIONS IN ENVIRONMENTS WITH A FINITE CARRYING CAPACITY. P. Jagers Pliska Stud. Math. 24 (2015), 55 60 STUDIA MATHEMATICA ON THE COMPLETE LIFE CAREER OF POPULATIONS IN ENVIRONMENTS WITH A FINITE CARRYING CAPACITY P. Jagers If a general branching process evolves in a habitat

More information

STABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL

STABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL First published in Journal of Applied Probability 43(1) c 2006 Applied Probability Trust STABILIZATION OF AN OVERLOADED QUEUEING NETWORK USING MEASUREMENT-BASED ADMISSION CONTROL LASSE LESKELÄ, Helsinki

More information

Stochastic modelling of epidemic spread

Stochastic modelling of epidemic spread Stochastic modelling of epidemic spread Julien Arino Department of Mathematics University of Manitoba Winnipeg Julien Arino@umanitoba.ca 19 May 2012 1 Introduction 2 Stochastic processes 3 The SIS model

More information

N.G.Bean, D.A.Green and P.G.Taylor. University of Adelaide. Adelaide. Abstract. process of an MMPP/M/1 queue is not a MAP unless the queue is a

N.G.Bean, D.A.Green and P.G.Taylor. University of Adelaide. Adelaide. Abstract. process of an MMPP/M/1 queue is not a MAP unless the queue is a WHEN IS A MAP POISSON N.G.Bean, D.A.Green and P.G.Taylor Department of Applied Mathematics University of Adelaide Adelaide 55 Abstract In a recent paper, Olivier and Walrand (994) claimed that the departure

More information

Limiting distribution for subcritical controlled branching processes with random control function

Limiting distribution for subcritical controlled branching processes with random control function Available online at www.sciencedirect.com Statistics & Probability Letters 67 (2004 277 284 Limiting distribution for subcritical controlled branching processes with random control function M. Gonzalez,

More information

Censoring Technique in Studying Block-Structured Markov Chains

Censoring Technique in Studying Block-Structured Markov Chains Censoring Technique in Studying Block-Structured Markov Chains Yiqiang Q. Zhao 1 Abstract: Markov chains with block-structured transition matrices find many applications in various areas. Such Markov chains

More information

The Distribution of Mixing Times in Markov Chains

The Distribution of Mixing Times in Markov Chains The Distribution of Mixing Times in Markov Chains Jeffrey J. Hunter School of Computing & Mathematical Sciences, Auckland University of Technology, Auckland, New Zealand December 2010 Abstract The distribution

More information

Markov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains

Markov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains Markov Chains A random process X is a family {X t : t T } of random variables indexed by some set T. When T = {0, 1, 2,... } one speaks about a discrete-time process, for T = R or T = [0, ) one has a continuous-time

More information

Other properties of M M 1

Other properties of M M 1 Other properties of M M 1 Přemysl Bejda premyslbejda@gmail.com 2012 Contents 1 Reflected Lévy Process 2 Time dependent properties of M M 1 3 Waiting times and queue disciplines in M M 1 Contents 1 Reflected

More information

Intertwining of Markov processes

Intertwining of Markov processes January 4, 2011 Outline Outline First passage times of birth and death processes Outline First passage times of birth and death processes The contact process on the hierarchical group 1 0.5 0-0.5-1 0 0.2

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 2

MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 2. Countable Markov Chains I started Chapter 2 which talks about Markov chains with a countably infinite number of states. I did my favorite example which is on

More information

The SIS and SIR stochastic epidemic models revisited

The SIS and SIR stochastic epidemic models revisited The SIS and SIR stochastic epidemic models revisited Jesús Artalejo Faculty of Mathematics, University Complutense of Madrid Madrid, Spain jesus_artalejomat.ucm.es BCAM Talk, June 16, 2011 Talk Schedule

More information

Solving the Poisson Disorder Problem

Solving the Poisson Disorder Problem Advances in Finance and Stochastics: Essays in Honour of Dieter Sondermann, Springer-Verlag, 22, (295-32) Research Report No. 49, 2, Dept. Theoret. Statist. Aarhus Solving the Poisson Disorder Problem

More information

A proof of a partition conjecture of Bateman and Erdős

A proof of a partition conjecture of Bateman and Erdős proof of a partition conjecture of Bateman and Erdős Jason P. Bell Department of Mathematics University of California, San Diego La Jolla C, 92093-0112. US jbell@math.ucsd.edu 1 Proposed Running Head:

More information

Iterative common solutions of fixed point and variational inequality problems

Iterative common solutions of fixed point and variational inequality problems Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 (2016), 1882 1890 Research Article Iterative common solutions of fixed point and variational inequality problems Yunpeng Zhang a, Qing Yuan b,

More information

Lecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321

Lecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321 Lecture 11: Introduction to Markov Chains Copyright G. Caire (Sample Lectures) 321 Discrete-time random processes A sequence of RVs indexed by a variable n 2 {0, 1, 2,...} forms a discretetime random process

More information

process on the hierarchical group

process on the hierarchical group Intertwining of Markov processes and the contact process on the hierarchical group April 27, 2010 Outline Intertwining of Markov processes Outline Intertwining of Markov processes First passage times of

More information

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim

More information

Birth-death chain models (countable state)

Birth-death chain models (countable state) Countable State Birth-Death Chains and Branching Processes Tuesday, March 25, 2014 1:59 PM Homework 3 posted, due Friday, April 18. Birth-death chain models (countable state) S = We'll characterize the

More information

Statistics 150: Spring 2007

Statistics 150: Spring 2007 Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities

More information

Metapopulation modeling: Stochastic Patch Occupancy Model (SPOM) by Atte Moilanen

Metapopulation modeling: Stochastic Patch Occupancy Model (SPOM) by Atte Moilanen Metapopulation modeling: Stochastic Patch Occupancy Model (SPOM) by Atte Moilanen 1. Metapopulation processes and variables 2. Stochastic Patch Occupancy Models (SPOMs) 3. Connectivity in metapopulation

More information

Convergence Rates for Renewal Sequences

Convergence Rates for Renewal Sequences Convergence Rates for Renewal Sequences M. C. Spruill School of Mathematics Georgia Institute of Technology Atlanta, Ga. USA January 2002 ABSTRACT The precise rate of geometric convergence of nonhomogeneous

More information

Almost sure asymptotics for the random binary search tree

Almost sure asymptotics for the random binary search tree AofA 10 DMTCS proc. AM, 2010, 565 576 Almost sure asymptotics for the rom binary search tree Matthew I. Roberts Laboratoire de Probabilités et Modèles Aléatoires, Université Paris VI Case courrier 188,

More information

The Wright-Fisher Model and Genetic Drift

The Wright-Fisher Model and Genetic Drift The Wright-Fisher Model and Genetic Drift January 22, 2015 1 1 Hardy-Weinberg Equilibrium Our goal is to understand the dynamics of allele and genotype frequencies in an infinite, randomlymating population

More information

Discrete Time Markov Chain of a Dynamical System with a Rest Phase

Discrete Time Markov Chain of a Dynamical System with a Rest Phase Discrete Time Markov Chain of a Dynamical System with a Rest Phase Abstract A stochastic model, in the form of a discrete time Markov chain, is constructed to describe the dynamics of a population that

More information

TAUBERIAN THEOREM FOR HARMONIC MEAN OF STIELTJES TRANSFORMS AND ITS APPLICATIONS TO LINEAR DIFFUSIONS

TAUBERIAN THEOREM FOR HARMONIC MEAN OF STIELTJES TRANSFORMS AND ITS APPLICATIONS TO LINEAR DIFFUSIONS Kasahara, Y. and Kotani, S. Osaka J. Math. 53 (26), 22 249 TAUBERIAN THEOREM FOR HARMONIC MEAN OF STIELTJES TRANSFORMS AND ITS APPLICATIONS TO LINEAR DIFFUSIONS YUJI KASAHARA and SHIN ICHI KOTANI (Received

More information

Birth and Death Processes. Birth and Death Processes. Linear Growth with Immigration. Limiting Behaviour for Birth and Death Processes

Birth and Death Processes. Birth and Death Processes. Linear Growth with Immigration. Limiting Behaviour for Birth and Death Processes DTU Informatics 247 Stochastic Processes 6, October 27 Today: Limiting behaviour of birth and death processes Birth and death processes with absorbing states Finite state continuous time Markov chains

More information

CHUN-HUA GUO. Key words. matrix equations, minimal nonnegative solution, Markov chains, cyclic reduction, iterative methods, convergence rate

CHUN-HUA GUO. Key words. matrix equations, minimal nonnegative solution, Markov chains, cyclic reduction, iterative methods, convergence rate CONVERGENCE ANALYSIS OF THE LATOUCHE-RAMASWAMI ALGORITHM FOR NULL RECURRENT QUASI-BIRTH-DEATH PROCESSES CHUN-HUA GUO Abstract The minimal nonnegative solution G of the matrix equation G = A 0 + A 1 G +

More information

BRANCHING PROCESS WITH

BRANCHING PROCESS WITH Chapter 2 A MODIFIED MARKOV BRANCHING PROCESS WITH IMMIGRATION 2. Introduction Several physical and biological populations exhibit a branching character in their evolutionary behaviour in the sense that

More information

Math 456: Mathematical Modeling. Tuesday, March 6th, 2018

Math 456: Mathematical Modeling. Tuesday, March 6th, 2018 Math 456: Mathematical Modeling Tuesday, March 6th, 2018 Markov Chains: Exit distributions and the Strong Markov Property Tuesday, March 6th, 2018 Last time 1. Weighted graphs. 2. Existence of stationary

More information

The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof

The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof James Allen Fill 1 Department of Applied Mathematics and Statistics The Johns Hopkins

More information

Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk

Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk ANSAPW University of Queensland 8-11 July, 2013 1 Outline (I) Fluid

More information

DYNAMICS IN 3-SPECIES PREDATOR-PREY MODELS WITH TIME DELAYS. Wei Feng

DYNAMICS IN 3-SPECIES PREDATOR-PREY MODELS WITH TIME DELAYS. Wei Feng DISCRETE AND CONTINUOUS Website: www.aimsciences.org DYNAMICAL SYSTEMS SUPPLEMENT 7 pp. 36 37 DYNAMICS IN 3-SPECIES PREDATOR-PREY MODELS WITH TIME DELAYS Wei Feng Mathematics and Statistics Department

More information

A regeneration proof of the central limit theorem for uniformly ergodic Markov chains

A regeneration proof of the central limit theorem for uniformly ergodic Markov chains A regeneration proof of the central limit theorem for uniformly ergodic Markov chains By AJAY JASRA Department of Mathematics, Imperial College London, SW7 2AZ, London, UK and CHAO YANG Department of Mathematics,

More information

Toufik Mansour 1. Department of Mathematics, Chalmers University of Technology, S Göteborg, Sweden

Toufik Mansour 1. Department of Mathematics, Chalmers University of Technology, S Göteborg, Sweden COUNTING OCCURRENCES OF 32 IN AN EVEN PERMUTATION Toufik Mansour Department of Mathematics, Chalmers University of Technology, S-4296 Göteborg, Sweden toufik@mathchalmersse Abstract We study the generating

More information

Notes on uniform convergence

Notes on uniform convergence Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean

More information

Chapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan

Chapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Chapter 5. Continuous-Time Markov Chains Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Continuous-Time Markov Chains Consider a continuous-time stochastic process

More information

ON THE GAPS BETWEEN ZEROS OF TRIGONOMETRIC POLYNOMIALS

ON THE GAPS BETWEEN ZEROS OF TRIGONOMETRIC POLYNOMIALS Real Analysis Exchange Vol. 8(), 00/003, pp. 447 454 Gady Kozma, Faculty of Mathematics and Computer Science, Weizmann Institute of Science, POB 6, Rehovot 76100, Israel. e-mail: gadyk@wisdom.weizmann.ac.il,

More information

Stochastic Demography, Coalescents, and Effective Population Size

Stochastic Demography, Coalescents, and Effective Population Size Demography Stochastic Demography, Coalescents, and Effective Population Size Steve Krone University of Idaho Department of Mathematics & IBEST Demographic effects bottlenecks, expansion, fluctuating population

More information

A Note on Bisexual Galton-Watson Branching Processes with Immigration

A Note on Bisexual Galton-Watson Branching Processes with Immigration E extracta mathematicae Vol. 16, Núm. 3, 361 365 (2001 A Note on Bisexual Galton-Watson Branching Processes with Immigration M. González, M. Molina, M. Mota Departamento de Matemáticas, Universidad de

More information

The Contraction Mapping Theorem and the Implicit and Inverse Function Theorems

The Contraction Mapping Theorem and the Implicit and Inverse Function Theorems The Contraction Mapping Theorem and the Implicit and Inverse Function Theorems The Contraction Mapping Theorem Theorem The Contraction Mapping Theorem) Let B a = { x IR d x < a } denote the open ball of

More information

Mi-Hwa Ko. t=1 Z t is true. j=0

Mi-Hwa Ko. t=1 Z t is true. j=0 Commun. Korean Math. Soc. 21 (2006), No. 4, pp. 779 786 FUNCTIONAL CENTRAL LIMIT THEOREMS FOR MULTIVARIATE LINEAR PROCESSES GENERATED BY DEPENDENT RANDOM VECTORS Mi-Hwa Ko Abstract. Let X t be an m-dimensional

More information

MATH4406 Assignment 5

MATH4406 Assignment 5 MATH4406 Assignment 5 Patrick Laub (ID: 42051392) October 7, 2014 1 The machine replacement model 1.1 Real-world motivation Consider the machine to be the entire world. Over time the creator has running

More information

Research Article New Oscillation Criteria for Second-Order Neutral Delay Differential Equations with Positive and Negative Coefficients

Research Article New Oscillation Criteria for Second-Order Neutral Delay Differential Equations with Positive and Negative Coefficients Abstract and Applied Analysis Volume 2010, Article ID 564068, 11 pages doi:10.1155/2010/564068 Research Article New Oscillation Criteria for Second-Order Neutral Delay Differential Equations with Positive

More information

The tail does not determine the size of the giant

The tail does not determine the size of the giant The tail does not determine the size of the giant arxiv:1710.01208v2 [math.pr] 20 Jun 2018 Maria Deijfen Sebastian Rosengren Pieter Trapman June 2018 Abstract The size of the giant component in the configuration

More information

Math 104: Homework 7 solutions

Math 104: Homework 7 solutions Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for

More information

Theory of Stochastic Processes 3. Generating functions and their applications

Theory of Stochastic Processes 3. Generating functions and their applications Theory of Stochastic Processes 3. Generating functions and their applications Tomonari Sei sei@mist.i.u-tokyo.ac.jp Department of Mathematical Informatics, University of Tokyo April 20, 2017 http://www.stat.t.u-tokyo.ac.jp/~sei/lec.html

More information

Erdős-Renyi random graphs basics

Erdős-Renyi random graphs basics Erdős-Renyi random graphs basics Nathanaël Berestycki U.B.C. - class on percolation We take n vertices and a number p = p(n) with < p < 1. Let G(n, p(n)) be the graph such that there is an edge between

More information

CHAPTER 8: EXPLORING R

CHAPTER 8: EXPLORING R CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed

More information

arxiv: v1 [math.pr] 13 Nov 2018

arxiv: v1 [math.pr] 13 Nov 2018 PHASE TRANSITION FOR THE FROG MODEL ON BIREGULAR TREES ELCIO LEBENSZTAYN AND JAIME UTRIA arxiv:1811.05495v1 [math.pr] 13 Nov 2018 Abstract. We study the frog model with death on the biregular tree T d1,d

More information

Ancestor Problem for Branching Trees

Ancestor Problem for Branching Trees Mathematics Newsletter: Special Issue Commemorating ICM in India Vol. 9, Sp. No., August, pp. Ancestor Problem for Branching Trees K. B. Athreya Abstract Let T be a branching tree generated by a probability

More information

AARMS Homework Exercises

AARMS Homework Exercises 1 For the gamma distribution, AARMS Homework Exercises (a) Show that the mgf is M(t) = (1 βt) α for t < 1/β (b) Use the mgf to find the mean and variance of the gamma distribution 2 A well-known inequality

More information

P (A G) dp G P (A G)

P (A G) dp G P (A G) First homework assignment. Due at 12:15 on 22 September 2016. Homework 1. We roll two dices. X is the result of one of them and Z the sum of the results. Find E [X Z. Homework 2. Let X be a r.v.. Assume

More information

Probability Distributions

Probability Distributions Lecture : Background in Probability Theory Probability Distributions The probability mass function (pmf) or probability density functions (pdf), mean, µ, variance, σ 2, and moment generating function (mgf)

More information

2905 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES

2905 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES 295 Queueing Theory and Simulation PART III: HIGHER DIMENSIONAL AND NON-MARKOVIAN QUEUES 16 Queueing Systems with Two Types of Customers In this section, we discuss queueing systems with two types of customers.

More information

GARCH processes probabilistic properties (Part 1)

GARCH processes probabilistic properties (Part 1) GARCH processes probabilistic properties (Part 1) Alexander Lindner Centre of Mathematical Sciences Technical University of Munich D 85747 Garching Germany lindner@ma.tum.de http://www-m1.ma.tum.de/m4/pers/lindner/

More information

The kappa function. [ a b. c d

The kappa function. [ a b. c d The kappa function Masanobu KANEKO Masaaki YOSHIDA Abstract: The kappa function is introduced as the function κ satisfying Jκτ)) = λτ), where J and λ are the elliptic modular functions. A Fourier expansion

More information

Models for predicting extinction times: shall we dance (or walk or jump)?

Models for predicting extinction times: shall we dance (or walk or jump)? Models for predicting extinction times: shall we dance (or walk or jump)? 1,2 Cairns, B.J., 1 J.V. Ross and 1 T. Taimre 1 School of Physical Sciences, The University of Queensland, St Lucia QLD 4072, Australia.

More information

BRANCHING PROCESSES 1. GALTON-WATSON PROCESSES

BRANCHING PROCESSES 1. GALTON-WATSON PROCESSES BRANCHING PROCESSES 1. GALTON-WATSON PROCESSES Galton-Watson processes were introduced by Francis Galton in 1889 as a simple mathematical model for the propagation of family names. They were reinvented

More information

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also

More information

Criteria for existence of semigroup homomorphisms and projective rank functions. George M. Bergman

Criteria for existence of semigroup homomorphisms and projective rank functions. George M. Bergman Criteria for existence of semigroup homomorphisms and projective rank functions George M. Bergman Suppose A, S, and T are semigroups, e: A S and f: A T semigroup homomorphisms, and X a generating set for

More information

Random graphs: Random geometric graphs

Random graphs: Random geometric graphs Random graphs: Random geometric graphs Mathew Penrose (University of Bath) Oberwolfach workshop Stochastic analysis for Poisson point processes February 2013 athew Penrose (Bath), Oberwolfach February

More information

1 Stochastic Dynamic Programming

1 Stochastic Dynamic Programming 1 Stochastic Dynamic Programming Formally, a stochastic dynamic program has the same components as a deterministic one; the only modification is to the state transition equation. When events in the future

More information

A Note on Certain Stability and Limiting Properties of ν-infinitely divisible distributions

A Note on Certain Stability and Limiting Properties of ν-infinitely divisible distributions Int. J. Contemp. Math. Sci., Vol. 1, 2006, no. 4, 155-161 A Note on Certain Stability and Limiting Properties of ν-infinitely divisible distributions Tomasz J. Kozubowski 1 Department of Mathematics &

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 1

MATH 56A: STOCHASTIC PROCESSES CHAPTER 1 MATH 56A: STOCHASTIC PROCESSES CHAPTER. Finite Markov chains For the sake of completeness of these notes I decided to write a summary of the basic concepts of finite Markov chains. The topics in this chapter

More information

Introduction to Queuing Networks Solutions to Problem Sheet 3

Introduction to Queuing Networks Solutions to Problem Sheet 3 Introduction to Queuing Networks Solutions to Problem Sheet 3 1. (a) The state space is the whole numbers {, 1, 2,...}. The transition rates are q i,i+1 λ for all i and q i, for all i 1 since, when a bus

More information

Elementary Applications of Probability Theory

Elementary Applications of Probability Theory Elementary Applications of Probability Theory With an introduction to stochastic differential equations Second edition Henry C. Tuckwell Senior Research Fellow Stochastic Analysis Group of the Centre for

More information

4 Branching Processes

4 Branching Processes 4 Branching Processes Organise by generations: Discrete time. If P(no offspring) 0 there is a probability that the process will die out. Let X = number of offspring of an individual p(x) = P(X = x) = offspring

More information

Spectral Properties of Matrix Polynomials in the Max Algebra

Spectral Properties of Matrix Polynomials in the Max Algebra Spectral Properties of Matrix Polynomials in the Max Algebra Buket Benek Gursoy 1,1, Oliver Mason a,1, a Hamilton Institute, National University of Ireland, Maynooth Maynooth, Co Kildare, Ireland Abstract

More information

6 Continuous-Time Birth and Death Chains

6 Continuous-Time Birth and Death Chains 6 Continuous-Time Birth and Death Chains Angela Peace Biomathematics II MATH 5355 Spring 2017 Lecture notes follow: Allen, Linda JS. An introduction to stochastic processes with applications to biology.

More information