On a problem in population structure

age distribution age structured population columnwise stochastic Leslie matrix limit distribution second largest eigenvalue speed convergence upper bound

Mathematics Subject Classification ID

Miscellaneous inequalities involving matrices (15A45) Stochastic matrices (15B51) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Population dynamics (general) (92D25)

Review text

Consider the age structured population \(n(t\mid 1)=Pn(t)\), where \(P\) is a \(k\times k\) Leslie matrix, \(n(t)\) is the population vector at time \(t\). The author assumes that \(P\) is columnwise stochastic. It follows that \(\lim_{t\to\infty}P^ t=L\), where \(L\) is a constant matrix. The problem considered is to obtain an upper bound for the elements of the matrix \(P^ t-L\). For a matrix \(A=(a_{ij})\), let \(\mu(A)=\max\{| a_{ij}|\}\). It is shown that \[ \mu(P^ t-L)\leq cp^ t t^{k- 1}, \] where \(c\) is a constant, \(p=\max\{p_ 1,p_ 2,\dots,p_{k-1}\}\), and \(p_ 1,p_ 2,\dots,p_{k-1}\) are the elements in the first subdiagonal of \(P\).

Recommendations

Cites work

Cited in

(7)

This page was built for publication: On a problem in population structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185052)