Discrete advection–diffusion equations on graphs: Maximum principle and finite volumes

摘要

We study an initial value problem for explicit and implicit difference advection–diffusion equations on graphs. Problems on both finite and infinite graphs are considered. We analyze the existence and uniqueness of solutions. Interestingly, we show that there exist infinitely many solutions to implicit problems on infinite graphs similarly as in the case of continuous or lattice diffusion equations on infinite spatial domains. The main part of the paper is devoted to maximum principles. Firstly, we establish discrete maximum principles for equations on graphs. Then we show that finite volume numerical schemes for advection–diffusion PDEs in any dimension can be reformulated as equations on graphs and consequently, we use this relation to verify maximum principles for corresponding numerical solutions.