title: Continuous-time random walks on networks with vertex- and time-dependent forcing.
abstract: We have investigated the transport of particles moving as random walks on the vertices of a network, subject to vertex- and time-dependent forcing. We have derived the generalized master equations for this transport using continuous time random walks, characterized by jump and waiting time densities, as the underlying stochastic process. The forcing is incorporated through a vertex- and time-dependent bias in the jump densities governing the random walking particles. As a particular case, we consider particle forcing proportional to the concentration of particles on adjacent vertices, analogous to self-chemotactic attraction in a spatial continuum. Our algebraic and numerical studies of this system reveal an interesting pair-aggregation pattern formation in which the steady state is composed of a high concentration of particles on a small number of isolated pairs of adjacent vertices. The steady states do not exhibit this pair aggregation if the transport is random on the vertices, i.e., without forcing. The manifestation of pair aggregation on a transport network may thus be a signature of self-chemotactic-like forcing.
authors.affiliation: School of Mathematics and Statistics, University of New South Wales, Sydney, New South Wales 2052, Australia.
authors.forename: C N
authors.initials: CN
authors.lastname: Angstmann
authors.forename: I C
authors.initials: IC
authors.lastname: Donnelly
authors.forename: B I
authors.initials: BI
authors.lastname: Henry
authors.forename: T A M
authors.initials: TA
authors.lastname: Langlands