Modeling advection on distance-weighted directed networks

Abstract

In this paper we propose a model for describing advection dynamics on distance-weighted directed graphs. To this end we establish a set of key properties, or axioms, that a discrete advection operator should satisfy, and prove that there exists an essentially unique operator satisfying all such properties. Both infinite and finite networks are considered, as well as possible variants and extensions. We illustrate the proposed model through examples, both analytical and numerical, and we describe an application to the simulation of a traffic network.

References in corpus (7)

• Statistical mechanics of complex networks
• Random walks and diffusion on networks
• Fractional dynamics on networks: Emergence of anomalous diffusion and Lévy flights
• Nonlocal network dynamics via fractional graph Laplacians
• New Trends on the Systems Approach to Modeling SARS-CoV-2 Pandemics in a Globally Connected Planet
• Time and space generalized diffusion equation on graphs/networks
• Scale-dependent measure of network centrality from diffusion dynamics