Transport on networks—A playground of continuous and discrete mathematics in population dynamics

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider structured population models in which the population is subdivided into states according to certain feature of the individuals. We consider various rules allowing individuals to move between the states; it may be physical migration between geographical patches, or the change of the genotype by mutations during mitosis. We shall see that, depending on the type of the migration rule, the models can vary from a system of coupled McKendrick equations to a system of transport equations on a graph. We address the well-posedness of such problems but the main interest is the asymptotic state aggregation that, in the presence of different time scales, allows for a significant simplification of the equations. Interestingly enough, the aggregated equations vary widely, from scalar transport equations to systems of ordinary differential equations.

Cite

CITATION STYLE

APA

Banasiak, J., & Puchalska, A. (2019). Transport on networks—A playground of continuous and discrete mathematics in population dynamics. In Studies in Systems, Decision and Control (Vol. 200, pp. 439–487). Springer International Publishing. https://doi.org/10.1007/978-3-030-12232-4_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free