Displaying 61 – 80 of 143

Showing per page

Persistence and bifurcation analysis on a predator–prey system of holling type

Debasis Mukherjee (2003)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

We present a Gause type predator–prey model incorporating delay due to response of prey population growth to density and gestation. The functional response of predator is assumed to be of Holling type II. In absence of prey, predator has a density dependent death rate. Sufficient criterion for uniform persistence is derived. Conditions are found out for which system undergoes a Hopf–bifurcation.

Persistence and bifurcation analysis on a predator–prey system of holling type

Debasis Mukherjee (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

We present a Gause type predator–prey model incorporating delay due to response of prey population growth to density and gestation. The functional response of predator is assumed to be of Holling type II. In absence of prey, predator has a density dependent death rate. Sufficient criterion for uniform persistence is derived. Conditions are found out for which system undergoes a Hopf–bifurcation.

Persistence and extinction of a stochastic delay predator-prey model under regime switching

Zhen Hai Liu, Qun Liu (2014)

Applications of Mathematics

The paper is concerned with a stochastic delay predator-prey model under regime switching. Sufficient conditions for extinction and non-persistence in the mean of the system are established. The threshold between persistence and extinction is also obtained for each population. Some numerical simulations are introduced to support our main results.

Phenotype space and kinship assignment for the Simpson index

Bruce Litow, Dmitry Konovalov (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We investigate the computational structure of the biological kinship assignment problem by abstracting away all biological details that are irrelevant to computation. The computational structure depends on phenotype space, which we formally define. We illustrate this approach by exhibiting an approximation algorithm for kinship assignment in the case of the Simpson index with a priori error bound and running time that is polynomial in the bit size of the population, but exponential in phenotype...

Phenotype space and kinship assignment for the simpson index

Bruce Litow, Dmitry Konovalov (2007)

RAIRO - Theoretical Informatics and Applications

We investigate the computational structure of the biological kinship assignment problem by abstracting away all biological details that are irrelevant to computation. The computational structure depends on phenotype space, which we formally define. We illustrate this approach by exhibiting an approximation algorithm for kinship assignment in the case of the Simpson index with a priori error bound and running time that is polynomial in the bit size of the population, but exponential in phenotype...

Currently displaying 61 – 80 of 143