The multi-type Galton-Watson process with immigration

1970 ◽  
Vol 7 (2) ◽  
pp. 411-422 ◽  
Author(s):  
M. P. Quine
Keyword(s):  
Recurrence Relation ◽  
Limiting Behaviour ◽  
Watson Process

SummaryWe consider the limiting behaviour of a k-type (k < ∞) Galton-Watson process which is augmented at each generation by a stochastic immigration component. In Section 2, conditions for ergodicity are found for a subclass of such processes. In Section 3, expressions are derived for the first two moments of the nth generation (by way of a recurrence relation) and for the first two asymptotic moments, in a manner which to some extent generalises previous results.

The multi-type Galton-Watson process with immigration

1970 ◽  
Vol 7 (02) ◽  
pp. 411-422 ◽  
Author(s):  
M. P. Quine
Keyword(s):  
Recurrence Relation ◽  
Limiting Behaviour ◽  
Watson Process

Summary We consider the limiting behaviour of a k-type (k &lt; ∞) Galton-Watson process which is augmented at each generation by a stochastic immigration component. In Section 2, conditions for ergodicity are found for a subclass of such processes. In Section 3, expressions are derived for the first two moments of the nth generation (by way of a recurrence relation) and for the first two asymptotic moments, in a manner which to some extent generalises previous results.

The Galton-Watson process conditioned on the total progeny

1975 ◽  
Vol 12 (04) ◽  
pp. 800-806 ◽  
Author(s):  
Douglas P. Kennedy
Keyword(s):  
Marked Contrast ◽  
Total Progeny ◽  
Limiting Behaviour ◽  
Watson Process

Let Zk denote the number in the kth generation of a Galton-Watson process initiated by one individual and let N be the total progeny, i.e., As n → ∞ the limiting behaviour of the process {Zk, 0 ≦ k ≦ n} conditioned on the event {N =n} is studied. The results obtained are of exactly the same form for the subcritical, critical and supercritical cases. This is in marked contrast to the analogous situation got by conditioning on non-extinction by the nth generation and letting n → ∞. In the latter case the limiting results differ in form for the critical and non-critical cases.

On a Problem of L. Moser

1960 ◽  
Vol 3 (1) ◽  
pp. 35-39 ◽  
Author(s):  
Irwin Guttman
Keyword(s):  
Real Number ◽  
Recurrence Relation ◽  
Stopping Rule ◽  
Limiting Behaviour

In [l], Moser derives a recurrence relation and studies the limiting behaviour of the Expectations En of the following game. “A real number is drawn at random from [0,1]. We may either keep the number selected, or reject it and draw again. We can then either keep the second number chosen or reject it, and draw again, and so on. Suppose we have at most n choices. What stopping rule gives the largest En and how can we estimate En?”

The Galton-Watson process conditioned on the total progeny

1975 ◽  
Vol 12 (4) ◽  
pp. 800-806 ◽  
Author(s):  
Douglas P. Kennedy
Keyword(s):  
Marked Contrast ◽  
Total Progeny ◽  
Limiting Behaviour ◽  
Watson Process

Let Zk denote the number in the kth generation of a Galton-Watson process initiated by one individual and let N be the total progeny, i.e., As n → ∞ the limiting behaviour of the process {Zk, 0 ≦ k ≦ n} conditioned on the event {N =n} is studied. The results obtained are of exactly the same form for the subcritical, critical and supercritical cases. This is in marked contrast to the analogous situation got by conditioning on non-extinction by the nth generation and letting n → ∞. In the latter case the limiting results differ in form for the critical and non-critical cases.

Sebuah Generalisasi Baru Barisan Fibonacci-Lucas

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Musraini M Musraini M ◽  
Rustam Efendi ◽  
Rolan Pane ◽  
Endang Lily
Keyword(s):  
Recurrence Relation ◽  
Initial Conditions ◽  
Lucas Sequence ◽  
Binet’S Formula

Barisan Fibonacci dan Lucas telah digeneralisasi dalam banyak cara, beberapa dengan mempertahankan kondisi awal, dan lainnya dengan mempertahankan relasi rekurensi. Makalah ini menyajikan sebuah generalisasi baru barisan Fibonacci-Lucas yang didefinisikan oleh relasi rekurensi B_n=B_(n-1)+B_(n-2),n≥2 , B_0=2b,B_1=s dengan b dan s bilangan bulat  tak negatif. Selanjutnya, beberapa identitas dihasilkan dan diturunkan menggunakan formula Binet dan metode sederhana lainnya. Juga dibahas beberapa identitas dalam bentuk determinan.   The Fibonacci and Lucas sequence has been generalized in many ways, some by preserving the initial conditions, and others by preserving the recurrence relation. In this paper, a new generalization of Fibonacci-Lucas sequence is introduced and defined by the recurrence relation B_n=B_(n-1)+B_(n-2),n≥2, with ,  B_0=2b,B_1=s                          where b and s are non negative integers. Further, some identities are generated and derived by Binet’s formula and other simple methods. Also some determinant identities are discussed.

scholarly journals Extending the Applicability of a Two-Step Chord-Type Method for Non-Differentiable Operators

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 804
Author(s):  
Ioannis K. Argyros ◽  
Neha Gupta ◽  
J. P. Jaiswal
Keyword(s):  
Approximate Solution ◽  
Convergence Analysis ◽  
Banach Spaces ◽  
Recurrence Relation ◽  
Convergence Theorem ◽  
Local Convergence ◽  
Existence And Uniqueness ◽  
Numerical Illustration ◽  
Type Method ◽  
Local Convergence Analysis

The semi-local convergence analysis of a well defined and efficient two-step Chord-type method in Banach spaces is presented in this study. The recurrence relation technique is used under some weak assumptions. The pertinency of the assumed method is extended for nonlinear non-differentiable operators. The convergence theorem is also established to show the existence and uniqueness of the approximate solution. A numerical illustration is quoted to certify the theoretical part which shows that earlier studies fail if the function is non-differentiable.

scholarly journals An ubiquitous three-term recurrence relation

2021 ◽  
Vol 62 (3) ◽  
pp. 032106
Author(s):  
Paolo Amore ◽  
Francisco M. Fernández
Keyword(s):  
Recurrence Relation ◽  
Three Term Recurrence Relation

scholarly journals Coagulation Processes with Gibbsian Time Evolution

2012 ◽  
Vol 49 (03) ◽  
pp. 612-626
Author(s):  
Boris L. Granovsky ◽  
Alexander V. Kryvoshaev
Keyword(s):  
Stochastic Process ◽  
Recurrence Relation ◽  
Time Evolution ◽  
Nonnegative Function ◽  
Gibbs Distribution ◽  
Time Dependent ◽  
Explicit Solutions ◽  
Gibbs Distributions ◽  
Giant Cluster ◽  
Positive Integers

We prove that a stochastic process of pure coagulation has at any timet≥ 0 a time-dependent Gibbs distribution if and only if the rates ψ(i,j) of single coagulations are of the form ψ(i;j) =if(j) +jf(i), wherefis an arbitrary nonnegative function on the set of positive integers. We also obtain a recurrence relation for weights of these Gibbs distributions that allow us to derive the general form of the solution and the explicit solutions in three particular cases of the functionf. For the three corresponding models, we study the probability of coagulation into one giant cluster by timet&gt; 0.

Sign in / Sign up

Export Citation Format

Share Document