Tri-generative Stochastic Model of Population Growth
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2015, Vol 10, Issue 2
Abstract
This paper investigates the population growth of a certain species in which every generation reproduces twice. First we probe the cases of 100% regeneration. We find that the population stabilizes for all the case although the stable values are different and exhibit interesting patterns. Then we study the survival period of a species by randomizing the reproduction probabilities within a window at same predefined ages. Now the population meets three different possibilities when left over for long periods -Dies, Stabilizes, Shoots up. We carry out a detail study for these outcomes in the parameter space defined by the reproduction probabilities.
Authors and Affiliations
Rahul Nigam
Some Functional Relations of I-functions using Saigo Fractional Integral Operator
In the present paper we seek to establish functional relations between digamma functions and I-functions by using Saigo fractional integral operator. This paper is extension of the paper of functional relations of I-func...
Existence of positive solutions for the boundary value problem of a nonlinear fractional differential equation
In this paper, we deal with the following nonlinear fractional boundary value problem Dao+u(t) +f(t, u(t))= 0,0 <...
Active Control of a Non-Linear Ship model with External and Parametric Excitation
The response of a ship model with non-linearly coupled pitch and roll modes under modulated external and parametric solved and studied. The active control is applied to reduce the vibration of the system . The method of...
Another Newton-type method with (k+2) order convergence for solving quadratic equations
In this paper we define another Newton-type method for finding simple root of quadratic equations. It is proved that the new one-point method has the convergence order of k  2 requiring only three function evalu...
A way to compute a greatest common divisor in the Galois field (GF (2^n ))
This paper presents how the steps that used to determine a multiplicative inverse by method based on the Euclidean algorithm, can be used to find a greatest common divisor for polynomials in the Galois field (2^n ).