CHAOTIC DYNAMICS IN A TRANSPORT EQUATION ON A NETWORK

We show that for a system of transport equations defined on an infinite network, the semigroup generated is hypercyclic if and only if the adjacency matrix of the line graph is also hypercyclic. We further show that there is a range of parameters for which a transport equation on an infinite network with no loops is chaotic on a subspace X-e of the weighted Banach space l(s)(1). We relate these results to Banach-space birth-and-death models in literature by showing that when there is no proliferation, the birth-and-death model is also chaotic in the same subspace X-e of l(s)(1). We do this by noting that the eigenvalue problem for the birth-and-death model is in fact an eigenvalue problem for the adjacency matrix of the line graph (of the network on which the transport problem is defined) which controls the dynamics of the the transport problem.