Ecology. Michael Begon

Чтение книги онлайн.

Читать онлайн книгу Ecology - Michael Begon страница 87

Ecology - Michael  Begon

Скачать книгу

0.492 7 2 0.0000020 12 700 0.025 0.175 8 2 0.0000020 12 700 0.025 0.200 images images images

      4.8.1 Population projection matrices

      life cycle graphs

Schematic illustration of life cycle graphs and population projection matrices for two different life cycles. The connection between the graphs and the matrices is explained in the text. (a) A life cycle with four successive classes. Over one time step, individuals may survive within the same class, survive and pass to the next class or die, and individuals in classes 2, 3 and 4 may give birth to individuals in class 1. (b) Another life cycle with four classes, but in this case only reproductive class 4 individuals can give birth to class 1 individuals, but class 3 individuals can give birth to further class 2 individuals.

      the elements of the matrix

      The information in a life cycle graph can be summarised in a population projection matrix. Such matrices are shown alongside the graphs in Figure 4.15. The convention is to contain the elements of a matrix within square brackets. In fact, a projection matrix is itself always ‘square’: it has the same number of columns as rows. The rows refer to the class number at the endpoint of a transition: the columns refer to the class number at the start. Thus, for instance, the matrix element in the third row of the second column describes the flow of individuals from the second class into the third class. More specifically, then, and using the life cycle in Figure 4.15a as an example, the elements in the main diagonal from top left to bottom right represent the probabilities of surviving and remaining in the same class (the ps), the elements in the remainder of the first row represent the fecundities of each subsequent class into the youngest class (the ms), while the gs, the probabilities of surviving and moving to the next class, appear in the subdiagonal below the main diagonal (from 1 to 2, from 2 to 3, etc.).

      Summarising the information in this way is useful because, using standard rules of matrix manipulation, we can take the numbers in the different classes (n1, n2, etc.) at one point in time (t1), expressed as a ‘column vector’ (simply a matrix comprising just one column), pre‐multiply this vector by the projection matrix, and generate the numbers in the different classes one time step later (t2). The mechanics of this – that is, where each element of the new column vector comes from – are as follows:

equation

      determining R from a matrix

Скачать книгу