Extinction Probabilities of Supercritical Decomposable Branching Processes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genealogy for Supercritical Branching Processes

We study the genealogy of so-called immortal branching processes, i.e. branching processes where each individual upon death is replaced by at least one new individual, and conclude that their marginal distributions are compound geometric. The result also implies that the limiting distributions of properly scaled supercritical branching processes are compound geometric. We exemplify our results ...

متن کامل

Identifiability of Age-Dependent Branching Processes from Extinction Probabilities and Number Distributions

Consider an age-dependent, single-species branching process defined by a progeny number distribution, and a lifetime distribution associated with each independent particle. In this paper, we focus on the associated inverse problem where one wishes to formally solve for the progeny number distribution or the lifetime distribution that defines the Bellman-Harris branching process. We derive resul...

متن کامل

A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes

We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/ ), where > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We use this result to resolve several open ...

متن کامل

Explorer A polynomial time algorithm for computing extinction probabilities of multi - type branching processes

We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/ ), where > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We use this result to resolve several open ...

متن کامل

Extinction times in Multitype Markov Branching Processes

In this paper, a distributional approximation to the time to extinction in a subcritical continuous-time Markov branching process is derived. A limit theorem for this distribution is established and the error in the approximation is quantified. The accuracy of the approximation is illustrated in an epidemiological example. Since Markov branching processes serve as approximations to nonlinear ep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2012

ISSN: 0021-9002,1475-6072

DOI: 10.1017/s0021900200009438