๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On circulant populations. I. The algebra of semelparity

โœ Scribed by N.V. Davydova; O. Diekmann; S.A. van Gils


Book ID
104036215
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
548 KB
Volume
398
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis


We consider a class of nonlinear Leslie matrix models, describing the population dynamics of an age-structured semelparous species. Semelparous species are those whose individuals reproduce only once and die afterwards. Competitive interaction between individuals is modelled via a one-dimensional environmental quantity. Age classes are characterised by their impact on, and their sensitivity to, the environment. We do not restrict ourselves to some particular form of functional dependence and keep the model otherwise as general as possible.

The system possesses a cyclic symmetry. Due to the symmetry it exhibits so-called vertical bifurcations, where a manifold filled with periodic orbits appears in the phase space for specific parameter combinations. This bifurcation serves as a switch between the main types of behaviour: coexistence of all year classes or a periodic regime with some year classes missing. In particular, the vertical bifurcation takes place when a certain circulant matrix is singular.

We also analyse the local stability of the unique coexistence equilibrium state and derive a characteristic equation for it. The dynamics of populations with two and, especially, with three age classes are analysed in detail.


๐Ÿ“œ SIMILAR VOLUMES


On the Hall algebra of an elliptic curve
โœ Burban, Igor; Schiffmann, Olivier ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Duke University Press ๐ŸŒ English โš– 424 KB
On the metric dimension of circulant gra
โœ Muhammad Imran; A.Q. Baig; Syed Ahtsham Ul Haq Bokhary; Imran Javaid ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 252 KB
On the average energy of circulant graph
โœ Simon R. Blackburn; Igor E. Shparlinski ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 122 KB

We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regularity d. The average is taken over all representations of such graphs by circulant adjacency matrices.