Search

The present paper deals with the dynamics of a stage-structured predator-prey model, with a ratio-dependent functional response including gestational delay in the predator. The prey is carrying an infection which affects the predator adversely. The boundedness of solutions and the stability of equilibrium points have been investigated. There is a Hopf-bifurcation arising out of the variation in the time-delay parameter. Numerical simulations of phase-plane diagrams, and bifurcation diagrams illustrate the dependence of the system on the delay -time. The effect of the disease transmission from prey to predator has also been illustrated through simulations.

Abstract We consider the extinction events of Galton–Watson processes with countably infinitely many types. In particular, we construct truncated and augmented Galton–Watson processes with finite but increasing sets of types. A pathwise approach is then used to show that, under some sufficient conditions, the corresponding sequence of extinction probability vectors converges to the global extinction probability vector of the Galton–Watson process with countably infinitely many types. Besides giving rise to a family of new iterative methods for computing the global extinction probability vector, our approach paves the way to new global extinction criteria for branching processes with countably infinitely many types. [ABSTRACT FROM AUTHOR]

We consider multitype branching processes evolving in a Markovian random environment. To determine whether or not the branching process becomes extinct almost surely is akin to computing the maximal Lyapunov exponent of a sequence of random matrices, which is a notoriously difficult problem. We define Markov chains associated to the branching process, and we construct bounds for the Lyapunov exponent. The bounds are obtained by adding or by removing information: to add information results in a lower bound, to remove information results in an upper bound, and we show that adding less information improves the lower bound. We give a few illustrative examples and we observe that the upper bound is generally more accurate than the lower bounds. [ABSTRACT FROM AUTHOR]

Direct Numerical Simulations (DNS) of ethylene/air diffusion flame extinctions in decaying two-dimensional turbulence were performed. A Damköhler-number-based flame extinction criterion as provided by classical large activation energy asymptotic (AEA) theory is assessed for its validity in predicting flame extinction and compared to one based on Chemical Explosive Mode Analysis (CEMA) of the detailed chemistry. The DNS code solves compressible flow conservation equations using high order finite difference and explicit time integration schemes. The ethylene/air chemistry is simulated with a reduced mechanism that is generated based on the directed relation graph (DRG) based methods along with stiffness removal. The numerical configuration is an ethylene fuel strip embedded in ambient air and exposed to a prescribed decaying turbulent flow field. The emphasis of this study is on the several flame extinction events observed in contrived parametric simulations. A modified viscosity and changing pressure (MVCP) scheme was adopted in order to artificially manipulate the probability of flame extinction. Using MVCP, pressure was changed from the baseline case of 1 atm to 0.1 and 10 atm. In the high pressure MVCP case, the simulated flame is extinction-free, whereas in the low pressure MVCP case, the simulated flame features frequent extinction events and is close to global extinction. Results show that, despite its relative simplicity and provided that the global flame activation temperature is correctly calibrated, the AEA-based flame extinction criterion can accurately predict the simulated flame extinction events. It is also found that the AEA-based criterion provides predictions of flame extinction that are consistent with those provided by a CEMA-based criterion. This study supports the validity of a simple Damköhler-number-based criterion to predict flame extinction in engineering-level CFD models. [ABSTRACT FROM AUTHOR]

We show that in the setting of fair-coin measure on the power set of the natural numbers, each sufficiently random set has an infinite subset that computes no random set. That is, there is an almost sure event $\mathcal{A}$ such that if $X \in \mathcal{A}$ then X has an infinite subset Y such that no element of $\mathcal{A}$ is Turing computable from Y. [ABSTRACT FROM AUTHOR]