General branching processes are defined through individuals

Size: px
Start display at page:

Download "General branching processes are defined through individuals"

Transcription

1 On the path to etinction Peter Jagers*, Fima C. Klebaner, and Serik Sagitov* *Department of Mathematical Sciences, Chalmers University of Technology, SE- 9 Gothenburg, Sweden; and School of Mathematical Sciences, Monash University, Clayton, Victoria 8, Australia Communicated by David Co, University of Oford, Oford, United Kingdom, January, 7 (received for review September, ) Populations can die out in many ways. We investigate one basic form of etinction, stable or intrinsic etinction, caused by individuals on the average not being able to replace themselves through reproduction. The archetypical such population is a subcritical branching process, i.e., a population of independent, aseually reproducing individuals, for which the epected number of progeny per individual is less than one. The main purpose is to uncover a fundamental pattern of nature. Mathematically, this emerges in large systems, in our case subcritical populations, starting from a large number,, of individuals. First we describe the behavior of the time to etinction T: as grows to infinity, it behaves like the logarithm of, divided by r, where r is the absolute value of the Malthusian parameter. We give a more precise description in terms of etreme value distributions. Then we study population size partway (or u-way) to etinction, i.e., at times ut, for < u <, e.g., u gives halfway to etinction. (Note that mathematically this is no stopping time.) If the population starts from individuals, then for large, the proper scaling for the population size at time ut is into the power u. Normed by this factor, the population u-way to etinction approaches a process, which involves constants that are determined by life span and reproduction distributions, and a random variable that follows the classical Gumbel distribution in the continuous time case. In the Markov case, where an eplicit representation can be deduced, we also find a description of the behavior immediately before etinction. General branching processes are defined through individuals who give birth independently of each other. We limit ourselves to single-type such populations, all individuals having the same reproduction and, more generally life-path, distribution. Benchmark cases of such processes are the simple Galton Watson, birth-and-death, and Markov branching processes. Even though such Markovian structures dominate the probabilistic literature, more general processes (allowing aging, various distributions of life spans and fertility periods, as well as repeated litters of varying sizes) are relevant for biological modelling (). A presentation from a mathematical point of view can be found in ref. (multi-type populations) or ref. (single-type processes). A multi-type framework would have been still more general but also far less accessible. The not-so-mathematical reader will undoubtedly note that even this presentation is demanding at certain points. However, conclusions should be clear, and they, rather than the work to derive them, form the message of this paper: intrinsic stable etinction follows a simple and beautiful pattern. The purpose is thus general understanding, rather than paving the way for specific applications. For those, multi-type theory may be useful, but at the bitter end they will tend to need custom-made models of narrow relevance. A (single-type) branching process is subcritical if the epected number m of children per individual is less than one. Let (a) denote the epected number of children by age a. Clearly, m (). In the lattice case, births can occur only at multiples of some time unit, e.g., yearly. For simplicity, our focus is on the nonlattice case. We consider so-called Malthusian processes. These are defined by the requirement that there eists a number, the Malthusian parameter, such that ˆ e a da. This is always fulfilled in the critical (m ) and ercritical ( m ), and under very mild conditions (always met with in the real world) also in subcritical cases. Then, and since will play an important role, we shall write r. In the case of Galton Watson processes, r ln m. Let Z t be a shorthand for the number of individuals alive at time t, provided the population started from individuals at time, taken as newborn then, for preciseness. Z t without a suffi, is Z t, the case of one ancestor. If L denotes the life span distribution, any nonlattice Malthusian process will then satisfy Z t e ru Ludu ue ru du e rt, t (ref., p. ). We write C for the proportionality constant in this, i.e., [Z t ] Ce t Ce rt and recall that in the lattice case the enumerator integral is replaced by a sum. (To the nonmathematical reader, the importance of this is not the special formula for C, but rather the fact that the constant can be calculated from demographic facts.) For Galton Watson and Markov branching processes C, and epressions are eact, [Z t ] m t for integer t in the Galton Watson case. The epected population size thus has the same asymptotic form in all three cases,,,. For variances, though, asymptotics take different forms in the sub- and ercritical cases. Assume that m and that Malthusianness is strengthened to a second order property: let denote the reproduction point process, so that [], and write ˆ e a da; it is required that [ˆ() ]. Then, VarZ t Be rt, for some constant B. This can be checked from the convolution equation holding for second moments (ref., p. ). In the more often studied ercritical case, the leading term is proportional to e t. We impose second order Malthusianness throughout and assume that the life span distribution L and reproduction measure satisfy Author contributions: P.J. designed research; P.J., F.C.K., and S.S. performed research; P.J., F.C.K., and S.S. contributed new reagentsanalytic tools; and P.J., F.C.K., and S.S. wrote the paper. The authors declare no conflict of interest. Freely available online through the PNAS open access option. To whom correspondence should be addressed. jagers@chalmers.se. 7 by The National Academy of Sciences of the USA PNAS April, 7 vol. no. 7

2 e rt tldt e and rt tdt, [] respectively. As a consequence, the so called log -condition holds, guaranteeing the Kolmogorov and Yaglom theorems on survival chances and conditional population size given nonetinction (see ref., p. 7, for the case of age-dependent processes and ref., p. 9, and ref., for general processes). In the nonlattice formulation, they tell us that for some c, Z t ce rt, t [] lim Z t kz t b k, k,,,... [] t eist, k b k, and b kb k Cc. [] k It is worth noting that these two theorems do not require the full strength of branching process independence assumptions (see ref. for population-size-dependent branching). Even though we shall not embark upon the subtleties of measuring the population in other ways than by just counting its individuals, it turns out that the proof of our results is considerably facilitated by use of counting with a particular random characteristic (ref., p. 7 ff.). The characteristic we shall use will be one that records all events to come in an individual s life and daughter process. It is thus not individual like the ones treated in op. cit. but still well behaved (7). The first and second moment results quoted above for processes just counting the number of individuals alive, clearly etend to processes counted with characteristics such that e rt [(t)] is directly Riemann integrable, and so do the Kolmogorov-Yaglom theorems (). The Time to Etinction Now consider processes with ancestors, Z t. By the time to etinction, satisfies T inft ; Z t T t T t Z t c t e rt for some c t tending to c, ast. As a consequence, T [] T tdt ln ln c r, [] where Euler s. To verify note that for any fied number v, v On the other hand, v v T tdt v,. T tdt c t e v rt c t e rt k dt, k where tv c t c for any, given that v is sufficiently large. Thus it remains to observe that as kv ce rt ce rt k dt r k k cerv k ln ln c v o, r where o(), denotes a remainder term, vanishing as. Etreme value theory handily delivers distributional forms of this, though again distinction should be made between continuous-time and lattice cases. In the former, Kolmogorov s theorem yields the eponential tail that implies a classical Gumbel limit (ref. 8, p. 7). Indeed, for each initial number, define by Then, as, T ln ln c r. [7] y epe y, y. [8] This etends Pakes s (9) result for Markov branching processes. In Between Dawn and Demise Let Z ut denote the population size at some time ut, u, between its inception at size Z and etinction. We consider nonlattice processes, and to ease eposition, write t ln, so that T t r, by7 and 8. Since [Z t ] Ce rt,ast, also u [Z u(t t)/r] Ce ut,, and it is natural to guess that u provides the right norming and that u Z ut C u b u e u in distribution, as the initial population size, at least for fied u. A first check of this conjecture can be made by simulation. Consider a binary splitting Markov branching process, i.e., birth-and-death process, with the probability p.7 for zero and p. for two offspring, and epected life span. For birth-and-death, as pointed out, C and further b can be shown to equal p (p ), which is. in the present case. Fig. displays the simulation results. The two upper panels show that the process Z ut, u displays much more of variation than does Z t. The lower panels indicate that the amount of variation is just right to allow nontrivial normalisation. They also point at convergence towards a process with a rather constant mean and a variance increasing with u. The epectation and variance of the proposed limiting population size are C u b u e u C u b u u, VarC u b u e u C u b u u u, u, in terms of the classical Gamma function. Thus, for bc close to one (it cannot be smaller), the Gamma function eerts a strong influence on the behavior of epected size, and since () () the overall picture is that of a fairly constant mean. For large bc it increases practically eponentially. This may seem intriguing, but is eplained by the norming through u. The limiting variance always increases with u, fromtob. Fig. shows these epectations and standard deviations for different values of b assuming C. The situation for b. thus seems to fit simulations. 8 Jagers et al.

3 8 (Z, <t<t) t 8 (Z ut, <u<)....8 ( u Z ut, <u<) ( u Z ut, <u<) Fig.. Markov branching with p.7, p., life epectancy. (Upper) Forty simulations with initial number,, population size on the vertical ais, time (Left) and proportion of time u to etinction (Right) horizontally. (Lower) Forty simulations of normed size with, (Left) and, (Right), proportion u of time to etinction on the horizontal ais. The Path-to-Etinction Theorem and Its Proof Our proof of the convergence follows a three-step programme, which requires acquaintance with weak convergence theory (). The reader interested in the basic pattern of etinction, rather than mathematical technique is thus advised to jump to Theorem.. For fied u, write (t) u Z u(t t)/r and prove that t Ce ut, t, as, the arrow indicating weak convergence in the Lindvall Skorohod topology etended to the whole real line.. Consider at the random argument : ln c : ln (Cb), where is Gumbel by 7 and 8, and check conditions for ( ) Ce u C u b u e u in distribution for fied u b b= b. b Fig.. Mean (upper line) and standard deviation (lower line) of the limit process b u e u for b.,.,, u on the horizontal ais. The upper right panel shows simulations of (.) u e u, to be compared with the simulations in Fig.. Jagers et al. PNAS April, 7 vol. no. 9

4 . Study the asymptotics of ( )(u) u Z ut as a function of u varying inside the unit interval. Step. We already noted that t u Z utt/r u Ce utt Ce ut,. Similarly, Var t Var u Z utt/r u B u e ut. We can conclude that for any fied t, (t) Ce ut in mean square. The finite dimensional convergence t, t,..., t k Ce ut, Ce ut,...,ce utk is obvious. Turning to tightness, we note that for any v and a tv t a u tut v/r Z t a u tut v/r Z t a. But the total progeny Y of a population from one newborn ancestor clearly dominates the maimum of the numbers ever simultaneously present, and the sum of the maima majorises the remum of the sum. Since [Y] ( m), it follows that Z ut v/r m] u Ce uv m. Z t tut v/r We can conclude that tv t a Ka for some constant K. Now consider the population counted with a characteristic (ref., p. 7) that for any h gives to each individual present the value of Y Y an indicator of dying the net hr time units plus the total number of progeny of the individual born within the same net time span of length hr. Denote the process thus counted by D h (t). Clearly, for any t, tsth Z uts/r Z utt/r D h ut tr. Write hr, and denote the total progeny within t time units stemming from one newborn individual by Y t. Then, t Lt Lt t t Y tu du. For nonlattice processes it follows that, as t, D h t e rt e rt Lt Ltdt e rt t t Y tu dudt te rt dt e rt Oh, h. If we assume that reproduction is L -Lipschitz in the sense that the second moment of the number of births between ages t and t h, v h (t), satisfies v h te rt dt Oh, h, [9] then a similar, but prohibitive, analysis of the convolution equation for second moments, shows that also D h t e rt Oh. This Lipschitz-property is broadly satisfied, e.g., if the number of children in short intervals is bounded. Indeed, if B is a bound, then v h (t) B((t h) (t), so that such qualities of the reproduction function transfer. By Chebyshev s inequality, therefore, for a suitable K, tsth s t uts/r tsthz D h ut tr u Z utt/r u D h ut tr D h ut tr u u Kh VarD h ut tr u Kh e ut K u h for h little enough and K some constant. Tightness follows along the lines of the Corollaries in ref. (p. 8 and p. ). The process (t) thus has the weak nonrandom continuous limit Ce ut, t, as. The modification from there is that those corollaries concern processes on the unit interval, whereas our processes are defined on the whole line, with the natural Lindvall Skorohod topology of convergence on all finite subintervals. Step. In the nonlattice case, the pair (, ) is also weakly convergent and by the continuity of the eponential limit function and the Gumbel limit, d u Z ut ln Cb O C u b u e u, in distribution, as claimed (see ref., p., or ref., Section.). Step. The preceding two steps can now be repeated for any linear combination i ui Z ui T yielding the finite dimensional distributional convergence fd u Z ut,uo C u b u e u,u, [] where is standard Gumbel. We summarize the situation for nonlattice populations: Jagers et al.

5 Theorem. Consider subcritical Malthusian general, single-type, nonlattice branching processes with finite reproduction variances. Assume conditions and 9. Then the finite dimensional distributional convergence holds. It remains to note the discontinuity at the endpoints of the unit interval in that u Z ut equals at u andatu. The former disappears in the Markov case, where age distribution does not matter and C. The latter mirrors the drastic fall of population size from u close to but tou, at which we proceed to have a closer look. Markov Branching Processes on the Eve of Etinction Markov branching processes, i.e., splitting processes (children are only born at their mother s death) where individuals have eponentially distributed life spans, have been much used in mathematical biology, even though they are of limited biological relevance, since eponential life spans imply the absence of aging. Being nonlattice, Markov branching processes are covered by our general results on etinction time and path to etinction. However, they also allow a direct approach. The latter is mathematically interesting, using a conditioning argument at a nonstopping time. For the Markov case, it recovers Theorem under slightly relaed conditions, and adds new knowledge because it renders it possible to study the process immediately before etinction, viewing the discontinuity from the left, as u, through a magnifying glass, as it were (Theorem ). Now, let Z t be a Markov branching process in which particles have eponentially distributed lifetimes with parameter a. Then Z t e rt, eactly. Hence, as pointed out, C ; also r a( m), as any tetbook would tell you. Further, consider a function v(t) t. A total probability argument yields Z vt y Z vt Z vt Z vt Z vt y, T dt y, T dt yt dtz vt y yt y vt dt. In words, the last equation holds because, conditionally on Z v(t) y, the probability of the original population, initiated by ancestors, dying out at dt is the same as the probability that a population of y individuals at v(t) dies out after time t v(t). Note that this argument applies quite generally to Markov processes. What is special in the branching case is the simple relation T y t T t y, valid for any positive integer y and helpful in calculating an integral representation of the probability generating function s Z vt. Analysis of the latter for the case v(t) ut, u yields Theorem for the Markov branching case, as mentioned under somewhat less restrictive conditions: the finite reproduction moment can be replaced by the log condition k log kp k, where p k is the probability of splitting into k children. In the present contet, it is more interesting that the case v(t) t u, u t, yields distributional convergence of Z T u,as, the limiting process Y u, thus displaying the properties of etinct populations on the eve of their disappearance. Indeed, write y, y,,... for the unique solution (up to multiplicative factors) of the system y Z t y, y,,..., the stationary measure of the process (ref., p. ). Then, the following can be proved to hold: Theorem. Consider a subcritical Markov branching process Z t starting from individuals, having parameters a and {p k } satisfying the log condition, as above. Then, as, Z T u Y u, in distribution for fied u, and finite-dimensionally. The limiting process is Markov. It starts from Y, stays at any position y,,,... an eponentially distributed time, with parameter ay, and then jumps to a position z with probability z z p y yz. y In the long run, it increases eponentially: as u, Y u Xe ru in distribution. Here X is an eponentially distributed random variable, with mean b. We thank a referee for taking readability seriously. This work has been ported by the Swedish and Australian Research Councils.. Haccou P, Jagers P, Vatutin V () Branching Processes: Variation, Growth, and Etinction of Populations (Cambridge Univ Press, Cambridge, UK).. Jagers P (989) Stoch Proc Appl :8.. Jagers P (97) Branching Processes with Biological Applications (Wiley, New York).. Athreya K, Ney P (97) Branching Processes (Springer, Berlin).. Green PJ (977) J Appl Prob :.. Gosselin F () Ann Appl Prob : Jagers P, Nerman O (98) J Appl Prob : Leadbetter MR, Lindgren G, Rootzén H (98) Etremes and Related Properties of Random Sequences and Processes (Springer, New York). 9. Pakes AG (989) Adv Appl Prob : 9.. Billingsley P (999) Convergence of Probability Measures (Wiley, New York), nd Ed.. Silvestrov DS () Limit Theorems for Randomly Stopped Stochastic Processes (Springer, London).. Harris TE (9) The Theory of Branching Processes (Springer, Berlin). Jagers et al. PNAS April, 7 vol. no.

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

1 Informal definition of a C-M-J process

1 Informal definition of a C-M-J process (Very rough) 1 notes on C-M-J processes Andreas E. Kyprianou, Department of Mathematical Sciences, University of Bath, Claverton Down, Bath, BA2 7AY. C-M-J processes are short for Crump-Mode-Jagers processes

More information

Advanced School and Conference on Statistics and Applied Probability in Life Sciences. 24 September - 12 October, 2007

Advanced School and Conference on Statistics and Applied Probability in Life Sciences. 24 September - 12 October, 2007 1863-5 Advanced School and Conference on Statistics and Applied Probability in Life Sciences 24 September - 12 October, 2007 Branching Processes and Population Dynamics Peter Jagers Chalmers University

More information

Branching processes, budding yeast, and k-nacci numbers

Branching processes, budding yeast, and k-nacci numbers Branching processes, budding yeast, and k-nacci numbers Peter Olofsson March 26, 2010 Abstract A real-world application of branching processes to a problem in cell biology where generalized k-nacci numbers

More information

Taylor Series and Series Convergence (Online)

Taylor Series and Series Convergence (Online) 7in 0in Felder c02_online.te V3 - February 9, 205 9:5 A.M. Page CHAPTER 2 Taylor Series and Series Convergence (Online) 2.8 Asymptotic Epansions In introductory calculus classes the statement this series

More information

THE x log x CONDITION FOR GENERAL BRANCHING PROCESSES

THE x log x CONDITION FOR GENERAL BRANCHING PROCESSES J. Appl. Prob. 35, 537 544 (1998) Printed in Israel Applied Probability Trust 1998 THE x log x CONDITION FOR GENERAL BRANCHING PROCESSES PETER OLOFSSON, Rice University Abstract The x log x condition is

More information

Budding Yeast, Branching Processes, and Generalized Fibonacci Numbers

Budding Yeast, Branching Processes, and Generalized Fibonacci Numbers Integre Technical Publishing Co., Inc. Mathematics Magazine 84:3 April 2, 211 11:36 a.m. olofsson.tex page 163 VOL. 84, NO. 3, JUNE 211 163 Budding Yeast, Branching Processes, and Generalized Fibonacci

More information

PREPRINT 2007:25. Multitype Galton-Watson processes escaping extinction SERIK SAGITOV MARIA CONCEIÇÃO SERRA

PREPRINT 2007:25. Multitype Galton-Watson processes escaping extinction SERIK SAGITOV MARIA CONCEIÇÃO SERRA PREPRINT 2007:25 Multitype Galton-Watson processes escaping extinction SERIK SAGITOV MARIA CONCEIÇÃO SERRA Department of Mathematical Sciences Division of Mathematical Statistics CHALMERS UNIVERSITY OF

More information

The incomplete gamma functions. Notes by G.J.O. Jameson. These notes incorporate the Math. Gazette article [Jam1], with some extra material.

The incomplete gamma functions. Notes by G.J.O. Jameson. These notes incorporate the Math. Gazette article [Jam1], with some extra material. The incomplete gamma functions Notes by G.J.O. Jameson These notes incorporate the Math. Gazette article [Jam], with some etra material. Definitions and elementary properties functions: Recall the integral

More information

Crump Mode Jagers processes with neutral Poissonian mutations

Crump Mode Jagers processes with neutral Poissonian mutations Crump Mode Jagers processes with neutral Poissonian mutations Nicolas Champagnat 1 Amaury Lambert 2 1 INRIA Nancy, équipe TOSCA 2 UPMC Univ Paris 06, Laboratoire de Probabilités et Modèles Aléatoires Paris,

More information

Answer Key 1973 BC 1969 BC 24. A 14. A 24. C 25. A 26. C 27. C 28. D 29. C 30. D 31. C 13. C 12. D 12. E 3. A 32. B 27. E 34. C 14. D 25. B 26.

Answer Key 1973 BC 1969 BC 24. A 14. A 24. C 25. A 26. C 27. C 28. D 29. C 30. D 31. C 13. C 12. D 12. E 3. A 32. B 27. E 34. C 14. D 25. B 26. Answer Key 969 BC 97 BC. C. E. B. D 5. E 6. B 7. D 8. C 9. D. A. B. E. C. D 5. B 6. B 7. B 8. E 9. C. A. B. E. D. C 5. A 6. C 7. C 8. D 9. C. D. C. B. A. D 5. A 6. B 7. D 8. A 9. D. E. D. B. E. E 5. E.

More information

MATH 1325 Business Calculus Guided Notes

MATH 1325 Business Calculus Guided Notes MATH 135 Business Calculus Guided Notes LSC North Harris By Isabella Fisher Section.1 Functions and Theirs Graphs A is a rule that assigns to each element in one and only one element in. Set A Set B Set

More information

DISTRIBUTION OF THE SUPREMUM LOCATION OF STATIONARY PROCESSES. 1. Introduction

DISTRIBUTION OF THE SUPREMUM LOCATION OF STATIONARY PROCESSES. 1. Introduction DISTRIBUTION OF THE SUPREMUM LOCATION OF STATIONARY PROCESSES GENNADY SAMORODNITSKY AND YI SHEN Abstract. The location of the unique supremum of a stationary process on an interval does not need to be

More information

Diffusion Approximation of Branching Processes

Diffusion Approximation of Branching Processes UDC 519.218.23 Diffusion Approximation of Branching Processes N. Limnios Sorbonne University, Université de technologie de Compiègne LMAC Laboratory of Applied Mathematics of Compiègne - CS 60319-60203

More information

BRANCHING PROCESSES AND THEIR APPLICATIONS: Lecture 15: Crump-Mode-Jagers processes and queueing systems with processor sharing

BRANCHING PROCESSES AND THEIR APPLICATIONS: Lecture 15: Crump-Mode-Jagers processes and queueing systems with processor sharing BRANCHING PROCESSES AND THEIR APPLICATIONS: Lecture 5: Crump-Mode-Jagers processes and queueing systems with processor sharing June 7, 5 Crump-Mode-Jagers process counted by random characteristics We give

More information

HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES

HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES HEAVY-TRAFFIC EXTREME-VALUE LIMITS FOR QUEUES by Peter W. Glynn Department of Operations Research Stanford University Stanford, CA 94305-4022 and Ward Whitt AT&T Bell Laboratories Murray Hill, NJ 07974-0636

More information

8 Autonomous first order ODE

8 Autonomous first order ODE 8 Autonomous first order ODE There are different ways to approach differential equations. Prior to this lecture we mostly dealt with analytical methods, i.e., with methods that require a formula as a final

More information

CONTINUOUS STATE BRANCHING PROCESSES

CONTINUOUS STATE BRANCHING PROCESSES CONTINUOUS STATE BRANCHING PROCESSES BY JOHN LAMPERTI 1 Communicated by Henry McKean, January 20, 1967 1. Introduction. A class of Markov processes having properties resembling those of ordinary branching

More information

Upper Bounds for the Ruin Probability in a Risk Model With Interest WhosePremiumsDependonthe Backward Recurrence Time Process

Upper Bounds for the Ruin Probability in a Risk Model With Interest WhosePremiumsDependonthe Backward Recurrence Time Process Λ4flΛ4» ν ff ff χ Vol.4, No.4 211 8fl ADVANCES IN MATHEMATICS Aug., 211 Upper Bounds for the Ruin Probability in a Risk Model With Interest WhosePremiumsDependonthe Backward Recurrence Time Process HE

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

1. Find A and B so that f x Axe Bx. has a local minimum of 6 when. x 2.

1. Find A and B so that f x Axe Bx. has a local minimum of 6 when. x 2. . Find A and B so that f Ae B has a local minimum of 6 when.. The graph below is the graph of f, the derivative of f; The domain of the derivative is 5 6. Note there is a cusp when =, a horizontal tangent

More information

= 1 2 x (x 1) + 1 {x} (1 {x}). [t] dt = 1 x (x 1) + O (1), [t] dt = 1 2 x2 + O (x), (where the error is not now zero when x is an integer.

= 1 2 x (x 1) + 1 {x} (1 {x}). [t] dt = 1 x (x 1) + O (1), [t] dt = 1 2 x2 + O (x), (where the error is not now zero when x is an integer. Problem Sheet,. i) Draw the graphs for [] and {}. ii) Show that for α R, α+ α [t] dt = α and α+ α {t} dt =. Hint Split these integrals at the integer which must lie in any interval of length, such as [α,

More information

A simple branching process approach to the phase transition in G n,p

A simple branching process approach to the phase transition in G n,p A simple branching process approach to the phase transition in G n,p Béla Bollobás Department of Pure Mathematics and Mathematical Statistics Wilberforce Road, Cambridge CB3 0WB, UK b.bollobas@dpmms.cam.ac.uk

More information

Random trees and branching processes

Random trees and branching processes Random trees and branching processes Svante Janson IMS Medallion Lecture 12 th Vilnius Conference and 2018 IMS Annual Meeting Vilnius, 5 July, 2018 Part I. Galton Watson trees Let ξ be a random variable

More information

Answers for NSSH exam paper 2 type of questions, based on the syllabus part 2 (includes 16)

Answers for NSSH exam paper 2 type of questions, based on the syllabus part 2 (includes 16) Answers for NSSH eam paper type of questions, based on the syllabus part (includes 6) Section Integration dy 6 6. (a) Integrate with respect to : d y c ( )d or d The curve passes through P(,) so = 6/ +

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

(a) During what time intervals on [0, 4] is the particle traveling to the left?

(a) During what time intervals on [0, 4] is the particle traveling to the left? Chapter 5. (AB/BC, calculator) A particle travels along the -ais for times 0 t 4. The velocity of the particle is given by 5 () sin. At time t = 0, the particle is units to the right of the origin. t /

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

DIFFERENTIATING UNDER THE INTEGRAL SIGN

DIFFERENTIATING UNDER THE INTEGRAL SIGN DIFFEENTIATING UNDE THE INTEGAL SIGN KEITH CONAD I had learned to do integrals by various methods shown in a book that my high school physics teacher Mr. Bader had given me. [It] showed how to differentiate

More information

Non-Parametric Bayesian Inference for Controlled Branching Processes Through MCMC Methods

Non-Parametric Bayesian Inference for Controlled Branching Processes Through MCMC Methods Non-Parametric Bayesian Inference for Controlled Branching Processes Through MCMC Methods M. González, R. Martínez, I. del Puerto, A. Ramos Department of Mathematics. University of Extremadura Spanish

More information

On the age of a randomly picked individual in a linear birth and death process

On the age of a randomly picked individual in a linear birth and death process On the age of a randomly picked individual in a linear birth and death process Fabian Kück, 2 and Dominic Schuhmacher,3 University of Göttingen September 7, 27 Abstract We consider the distribution of

More information

Decomposition of supercritical branching processes with countably many types

Decomposition of supercritical branching processes with countably many types Pomorie 26 June 2012 Serik Sagitov and Altynay Shaimerdenova 20 slides Chalmers University and University of Gothenburg Al-Farabi Kazakh National University Decomposition of supercritical branching processes

More information

Introduction to self-similar growth-fragmentations

Introduction to self-similar growth-fragmentations Introduction to self-similar growth-fragmentations Quan Shi CIMAT, 11-15 December, 2017 Quan Shi Growth-Fragmentations CIMAT, 11-15 December, 2017 1 / 34 Literature Jean Bertoin, Compensated fragmentation

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

Yaglom-type limit theorems for branching Brownian motion with absorption. by Jason Schweinsberg University of California San Diego

Yaglom-type limit theorems for branching Brownian motion with absorption. by Jason Schweinsberg University of California San Diego Yaglom-type limit theorems for branching Brownian motion with absorption by Jason Schweinsberg University of California San Diego (with Julien Berestycki, Nathanaël Berestycki, Pascal Maillard) Outline

More information

THE CONVEX HULL OF THE PRIME NUMBER GRAPH

THE CONVEX HULL OF THE PRIME NUMBER GRAPH THE CONVEX HULL OF THE PRIME NUMBER GRAPH NATHAN MCNEW Abstract Let p n denote the n-th prime number, and consider the prime number graph, the collection of points n, p n in the plane Pomerance uses the

More information

arxiv:math.pr/ v1 17 May 2004

arxiv:math.pr/ v1 17 May 2004 Probabilistic Analysis for Randomized Game Tree Evaluation Tämur Ali Khan and Ralph Neininger arxiv:math.pr/0405322 v1 17 May 2004 ABSTRACT: We give a probabilistic analysis for the randomized game tree

More information

Math 180A. Lecture 16 Friday May 7 th. Expectation. Recall the three main probability density functions so far (1) Uniform (2) Exponential.

Math 180A. Lecture 16 Friday May 7 th. Expectation. Recall the three main probability density functions so far (1) Uniform (2) Exponential. Math 8A Lecture 6 Friday May 7 th Epectation Recall the three main probability density functions so far () Uniform () Eponential (3) Power Law e, ( ), Math 8A Lecture 6 Friday May 7 th Epectation Eample

More information

Review sheet Final Exam Math 140 Calculus I Fall 2015 UMass Boston

Review sheet Final Exam Math 140 Calculus I Fall 2015 UMass Boston Review sheet Final Eam Math Calculus I Fall 5 UMass Boston The eam is closed tetbook NO CALCULATORS OR ELECTRONIC DEVICES ARE ALLOWED DURING THE EXAM The final eam will contain problems of types similar

More information

Computer Problems for Taylor Series and Series Convergence

Computer Problems for Taylor Series and Series Convergence Computer Problems for Taylor Series and Series Convergence The two problems below are a set; the first should be done without a computer and the second is a computer-based follow up. 1. The drawing below

More information

Piecewise Smooth Solutions to the Burgers-Hilbert Equation

Piecewise Smooth Solutions to the Burgers-Hilbert Equation Piecewise Smooth Solutions to the Burgers-Hilbert Equation Alberto Bressan and Tianyou Zhang Department of Mathematics, Penn State University, University Park, Pa 68, USA e-mails: bressan@mathpsuedu, zhang

More information

CSCI-6971 Lecture Notes: Probability theory

CSCI-6971 Lecture Notes: Probability theory CSCI-6971 Lecture Notes: Probability theory Kristopher R. Beevers Department of Computer Science Rensselaer Polytechnic Institute beevek@cs.rpi.edu January 31, 2006 1 Properties of probabilities Let, A,

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

Characterizations on Heavy-tailed Distributions by Means of Hazard Rate

Characterizations on Heavy-tailed Distributions by Means of Hazard Rate Acta Mathematicae Applicatae Sinica, English Series Vol. 19, No. 1 (23) 135 142 Characterizations on Heavy-tailed Distributions by Means of Hazard Rate Chun Su 1, Qi-he Tang 2 1 Department of Statistics

More information

On lower limits and equivalences for distribution tails of randomly stopped sums 1

On lower limits and equivalences for distribution tails of randomly stopped sums 1 On lower limits and equivalences for distribution tails of randomly stopped sums 1 D. Denisov, 2 S. Foss, 3 and D. Korshunov 4 Eurandom, Heriot-Watt University and Sobolev Institute of Mathematics Abstract

More information

Note: Unless otherwise specified, the domain of a function f is assumed to be the set of all real numbers x for which f (x) is a real number.

Note: Unless otherwise specified, the domain of a function f is assumed to be the set of all real numbers x for which f (x) is a real number. 997 AP Calculus BC: Section I, Part A 5 Minutes No Calculator Note: Unless otherwise specified, the domain of a function f is assumed to be the set of all real numbers for which f () is a real number..

More information

3.3.1 Linear functions yet again and dot product In 2D, a homogenous linear scalar function takes the general form:

3.3.1 Linear functions yet again and dot product In 2D, a homogenous linear scalar function takes the general form: 3.3 Gradient Vector and Jacobian Matri 3 3.3 Gradient Vector and Jacobian Matri Overview: Differentiable functions have a local linear approimation. Near a given point, local changes are determined by

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

(i) find the points where f(x) is discontinuous, and classify each point of discontinuity.

(i) find the points where f(x) is discontinuous, and classify each point of discontinuity. Math Final Eam - Practice Problems. A function f is graphed below. f() 5 4 8 7 5 4 4 5 7 8 4 5 (a) Find f(0), f( ), f(), and f(4) Find the domain and range of f (c) Find the intervals where f () is positive

More information

MATH 101 Midterm Examination Spring 2009

MATH 101 Midterm Examination Spring 2009 MATH Midterm Eamination Spring 9 Date: May 5, 9 Time: 7 minutes Surname: (Please, print!) Given name(s): Signature: Instructions. This is a closed book eam: No books, no notes, no calculators are allowed!.

More information

CONTINUITY AND DIFFERENTIABILITY

CONTINUITY AND DIFFERENTIABILITY 5. Introduction The whole of science is nothing more than a refinement of everyday thinking. ALBERT EINSTEIN This chapter is essentially a continuation of our stu of differentiation of functions in Class

More information

Review of elements of Calculus (functions in one variable)

Review of elements of Calculus (functions in one variable) Review of elements of Calculus (functions in one variable) Mainly adapted from the lectures of prof Greg Kelly Hanford High School, Richland Washington http://online.math.uh.edu/houstonact/ https://sites.google.com/site/gkellymath/home/calculuspowerpoints

More information

A. Bovier () Branching Brownian motion: extremal process and ergodic theorems

A. Bovier () Branching Brownian motion: extremal process and ergodic theorems Branching Brownian motion: extremal process and ergodic theorems Anton Bovier with Louis-Pierre Arguin and Nicola Kistler RCS&SM, Venezia, 06.05.2013 Plan 1 BBM 2 Maximum of BBM 3 The Lalley-Sellke conjecture

More information

Sections 5.1: Areas and Distances

Sections 5.1: Areas and Distances Sections.: Areas and Distances In this section we shall consider problems closely related to the problems we considered at the beginning of the semester (the tangent and velocity problems). Specifically,

More information

Tail Approximation of the Skew-Normal by the Skew-Normal Laplace: Application to Owen s T Function and the Bivariate Normal Distribution

Tail Approximation of the Skew-Normal by the Skew-Normal Laplace: Application to Owen s T Function and the Bivariate Normal Distribution Journal of Statistical and Econometric ethods vol. no. 3 - ISS: 5-557 print version 5-565online Scienpress Ltd 3 Tail Approimation of the Skew-ormal by the Skew-ormal Laplace: Application to Owen s T Function

More information

New asymptotic expansion for the Γ (x) function

New asymptotic expansion for the Γ (x) function New asymptotic epansion for the Γ function Gergő Nemes December 7, 2008 http://d.doi.org/0.3247/sl2math08.005 Abstract Using a series transformation, Stirling-De Moivre asymptotic series approimation to

More information

Two new regularization methods for solving sideways heat equation

Two new regularization methods for solving sideways heat equation Nguyen and uu Journal of Inequalities and Applications 015) 015:65 DOI 10.1186/s13660-015-0564-0 R E S E A R C H Open Access Two new regularization methods for solving sideways heat equation Huy Tuan Nguyen

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

Chapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations

Chapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations Chapter 5 Statistical Models in Simulations 5.1 Contents Basic Probability Theory Concepts Discrete Distributions Continuous Distributions Poisson Process Empirical Distributions Useful Statistical Models

More information

MATH39001 Generating functions. 1 Ordinary power series generating functions

MATH39001 Generating functions. 1 Ordinary power series generating functions MATH3900 Generating functions The reference for this part of the course is generatingfunctionology by Herbert Wilf. The 2nd edition is downloadable free from http://www.math.upenn. edu/~wilf/downldgf.html,

More information

About the Gamma Function

About the Gamma Function About the Gamma Function Notes for Honors Calculus II, Originally Prepared in Spring 995 Basic Facts about the Gamma Function The Gamma function is defined by the improper integral Γ) = The integral is

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

EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS

EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS (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

More information

Math 2250 Final Exam Practice Problem Solutions. f(x) = ln x x. 1 x. lim. lim. x x = lim. = lim 2

Math 2250 Final Exam Practice Problem Solutions. f(x) = ln x x. 1 x. lim. lim. x x = lim. = lim 2 Math 5 Final Eam Practice Problem Solutions. What are the domain and range of the function f() = ln? Answer: is only defined for, and ln is only defined for >. Hence, the domain of the function is >. Notice

More information

12.1 The Extrema of a Function

12.1 The Extrema of a Function . The Etrema of a Function Question : What is the difference between a relative etremum and an absolute etremum? Question : What is a critical point of a function? Question : How do you find the relative

More information

e x Improper Integral , dx

e x Improper Integral , dx Improper Integral ff() dddd aa bb, ff() dddd, ff() dddd e, d An improper integral is a definite integral that has. an infinite interval of integration.. They have a discontinuity on the interior of the

More information

k-protected VERTICES IN BINARY SEARCH TREES

k-protected VERTICES IN BINARY SEARCH TREES k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from

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

Ferromagnetic Ising models

Ferromagnetic Ising models Stat 36 Stochastic Processes on Graphs Ferromagnetic Ising models Amir Dembo Lecture 3-4 - 0/5/2007 Introduction By ferromagnetic Ising models we mean the study of the large-n behavior of the measures

More information

Mat104 Fall 2002, Improper Integrals From Old Exams

Mat104 Fall 2002, Improper Integrals From Old Exams Mat4 Fall 22, Improper Integrals From Old Eams For the following integrals, state whether they are convergent or divergent, and give your reasons. () (2) (3) (4) (5) converges. Break it up as 3 + 2 3 +

More information

EULER MARUYAMA APPROXIMATION FOR SDES WITH JUMPS AND NON-LIPSCHITZ COEFFICIENTS

EULER MARUYAMA APPROXIMATION FOR SDES WITH JUMPS AND NON-LIPSCHITZ COEFFICIENTS Qiao, H. Osaka J. Math. 51 (14), 47 66 EULER MARUYAMA APPROXIMATION FOR SDES WITH JUMPS AND NON-LIPSCHITZ COEFFICIENTS HUIJIE QIAO (Received May 6, 11, revised May 1, 1) Abstract In this paper we show

More information

A remark on a conjecture of Chowla

A remark on a conjecture of Chowla J. Ramanujan Math. Soc. 33, No.2 (2018) 111 123 A remark on a conjecture of Chowla M. Ram Murty 1 and Akshaa Vatwani 2 1 Department of Mathematics, Queen s University, Kingston, Ontario K7L 3N6, Canada

More information

The Contour Process of Crump-Mode-Jagers Branching Processes

The Contour Process of Crump-Mode-Jagers Branching Processes The Contour Process of Crump-Mode-Jagers Branching Processes Emmanuel Schertzer (LPMA Paris 6), with Florian Simatos (ISAE Toulouse) June 24, 2015 Crump-Mode-Jagers trees Crump Mode Jagers (CMJ) branching

More information

Branching Processes II: Convergence of critical branching to Feller s CSB

Branching Processes II: Convergence of critical branching to Feller s CSB Chapter 4 Branching Processes II: Convergence of critical branching to Feller s CSB Figure 4.1: Feller 4.1 Birth and Death Processes 4.1.1 Linear birth and death processes Branching processes can be studied

More information

Roberto s Notes on Differential Calculus Chapter 1: Limits and continuity Section 7. Discontinuities. is the tool to use,

Roberto s Notes on Differential Calculus Chapter 1: Limits and continuity Section 7. Discontinuities. is the tool to use, Roberto s Notes on Differential Calculus Chapter 1: Limits and continuity Section 7 Discontinuities What you need to know already: The concept and definition of continuity. What you can learn here: The

More information

APPLICATIONS OF DIFFERENTIATION

APPLICATIONS OF DIFFERENTIATION 4 APPLICATIONS OF DIFFERENTIATION APPLICATIONS OF DIFFERENTIATION 4.4 Indeterminate Forms and L Hospital s Rule In this section, we will learn: How to evaluate functions whose values cannot be found at

More information

FRINGE TREES, CRUMP MODE JAGERS BRANCHING PROCESSES AND m-ary SEARCH TREES

FRINGE TREES, CRUMP MODE JAGERS BRANCHING PROCESSES AND m-ary SEARCH TREES FRINGE TREES, CRUMP MODE JAGERS BRANCHING PROCESSES AND m-ary SEARCH TREES CECILIA HOLMGREN AND SVANTE JANSON Abstract. This survey studies asymptotics of random fringe trees and extended fringe trees

More information

Resistance Growth of Branching Random Networks

Resistance Growth of Branching Random Networks Peking University Oct.25, 2018, Chengdu Joint work with Yueyun Hu (U. Paris 13) and Shen Lin (U. Paris 6), supported by NSFC Grant No. 11528101 (2016-2017) for Research Cooperation with Oversea Investigators

More information

Math 261 Final Exam - Practice Problem Solutions. 1. A function f is graphed below.

Math 261 Final Exam - Practice Problem Solutions. 1. A function f is graphed below. Math Final Eam - Practice Problem Solutions. A function f is graphed below. f() 8 7 7 8 (a) Find f(), f( ), f(), and f() f() = ;f( ).;f() is undefined; f() = (b) Find the domain and range of f Domain:

More information

Dynamics of the evolving Bolthausen-Sznitman coalescent. by Jason Schweinsberg University of California at San Diego.

Dynamics of the evolving Bolthausen-Sznitman coalescent. by Jason Schweinsberg University of California at San Diego. Dynamics of the evolving Bolthausen-Sznitman coalescent by Jason Schweinsberg University of California at San Diego Outline of Talk 1. The Moran model and Kingman s coalescent 2. The evolving Kingman s

More information

3x 2. x ))))) and sketch the graph, labelling everything.

3x 2. x ))))) and sketch the graph, labelling everything. Fall 2006 Practice Math 102 Final Eam 1 1. Sketch the graph of f() =. What is the domain of f? [0, ) Use transformations to sketch the graph of g() = 2. What is the domain of g? 1 1 2. a. Given f() = )))))

More information

The range of tree-indexed random walk

The range of tree-indexed random walk The range of tree-indexed random walk Jean-François Le Gall, Shen Lin Institut universitaire de France et Université Paris-Sud Orsay Erdös Centennial Conference July 2013 Jean-François Le Gall (Université

More information

Curriculum Framework Alignment and Rationales for Answers

Curriculum Framework Alignment and Rationales for Answers The multiple-choice section on each eam is designed for broad coverage of the course content. Multiple-choice questions are discrete, as opposed to appearing in question sets, and the questions do not

More information

M151B Practice Problems for Exam 1

M151B Practice Problems for Exam 1 M151B Practice Problems for Eam 1 Calculators will not be allowed on the eam. Unjustified answers will not receive credit. 1. Compute each of the following its: 1a. 1b. 1c. 1d. 1e. 1 3 4. 3. sin 7 0. +

More information

Math 2250 Final Exam Practice Problem Solutions. f(x) = ln x x. 1 x. lim. lim. x x = lim. = lim 2

Math 2250 Final Exam Practice Problem Solutions. f(x) = ln x x. 1 x. lim. lim. x x = lim. = lim 2 Math 5 Final Eam Practice Problem Solutions. What are the domain and range of the function f() = ln? Answer: is only defined for, and ln is only defined for >. Hence, the domain of the function is >. Notice

More information

The Codimension of the Zeros of a Stable Process in Random Scenery

The Codimension of the Zeros of a Stable Process in Random Scenery The Codimension of the Zeros of a Stable Process in Random Scenery Davar Khoshnevisan The University of Utah, Department of Mathematics Salt Lake City, UT 84105 0090, U.S.A. davar@math.utah.edu http://www.math.utah.edu/~davar

More information

The Fluid Limit of an Overloaded Processor Sharing Queue

The Fluid Limit of an Overloaded Processor Sharing Queue MATHEMATICS OF OPERATIONS RESEARCH Vol. 31, No. 2, May 26, pp. 316 35 issn 364-765X eissn 1526-5471 6 312 316 informs doi 1.1287/moor.15.181 26 INFORMS The Fluid Limit of an Overloaded Processor Sharing

More information

Question 1. (8 points) The following diagram shows the graphs of eight equations.

Question 1. (8 points) The following diagram shows the graphs of eight equations. MAC 2233/-6 Business Calculus, Spring 2 Final Eam Name: Date: 5/3/2 Time: :am-2:nn Section: Show ALL steps. One hundred points equal % Question. (8 points) The following diagram shows the graphs of eight

More information

Name Solutions to Test 3 November 7, 2018

Name Solutions to Test 3 November 7, 2018 Name Solutions to Test November 7 8 This test consists of three parts. Please note that in parts II and III you can skip one question of those offered. Some possibly useful formulas can be found below.

More information

Branching within branching: a general model for host-parasite co-evolution

Branching within branching: a general model for host-parasite co-evolution Branching within branching: a general model for host-parasite co-evolution Gerold Alsmeyer (joint work with Sören Gröttrup) May 15, 2017 Gerold Alsmeyer Host-parasite co-evolution 1 of 26 1 Model 2 The

More information

Vibrating Strings and Heat Flow

Vibrating Strings and Heat Flow Vibrating Strings and Heat Flow Consider an infinite vibrating string Assume that the -ais is the equilibrium position of the string and that the tension in the string at rest in equilibrium is τ Let u(,

More information

On rate of convergence in distribution of asymptotically normal statistics based on samples of random size

On rate of convergence in distribution of asymptotically normal statistics based on samples of random size Annales Mathematicae et Informaticae 39 212 pp. 17 28 Proceedings of the Conference on Stochastic Models and their Applications Faculty of Informatics, University of Debrecen, Debrecen, Hungary, August

More information

14 Branching processes

14 Branching processes 4 BRANCHING PROCESSES 6 4 Branching processes In this chapter we will consider a rom model for population growth in the absence of spatial or any other resource constraints. So, consider a population of

More information

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr. Simulation Discrete-Event System Simulation Chapter 4 Statistical Models in Simulation Purpose & Overview The world the model-builder sees is probabilistic rather than deterministic. Some statistical model

More information

AP Calculus Review Assignment Answer Sheet 1. Name: Date: Per. Harton Spring Break Packet 2015

AP Calculus Review Assignment Answer Sheet 1. Name: Date: Per. Harton Spring Break Packet 2015 AP Calculus Review Assignment Answer Sheet 1 Name: Date: Per. Harton Spring Break Packet 015 This is an AP Calc Review packet. As we get closer to the eam, it is time to start reviewing old concepts. Use

More information

Optimal Sojourn Time Control within an Interval 1

Optimal Sojourn Time Control within an Interval 1 Optimal Sojourn Time Control within an Interval Jianghai Hu and Shankar Sastry Department of Electrical Engineering and Computer Sciences University of California at Berkeley Berkeley, CA 97-77 {jianghai,sastry}@eecs.berkeley.edu

More information

Strongly nonlinear long gravity waves in uniform shear flows

Strongly nonlinear long gravity waves in uniform shear flows Strongly nonlinear long gravity waves in uniform shear flows Wooyoung Choi Department of Naval Architecture and Marine Engineering, University of Michigan, Ann Arbor, Michigan 48109, USA Received 14 January

More information

4.3 How derivatives affect the shape of a graph. The first derivative test and the second derivative test.

4.3 How derivatives affect the shape of a graph. The first derivative test and the second derivative test. Chapter 4: Applications of Differentiation In this chapter we will cover: 41 Maimum and minimum values The critical points method for finding etrema 43 How derivatives affect the shape of a graph The first

More information

Chapter 2 - Survival Models

Chapter 2 - Survival Models 2-1 Chapter 2 - Survival Models Section 2.2 - Future Lifetime Random Variable and the Survival Function Let T x = ( Future lifelength beyond age x of an individual who has survived to age x [measured in

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