Well-posedness and long-term behaviour of buffered flows in infinite networks
Abstract
We consider a transport problem on an infinite metric graph and discuss its well-posedness and long-term behaviour under the condition that the mass flow is buffered in at least one of the vertices. In order to show the well-posedness of the problem, we employ the theory of C0-semigroups and prove a Desch--Schappacher type perturbation theorem for dispersive semigroups. Investigating the long-term behaviour of the system, we prove irreducibility of the semigroup under the assumption that the underlying graph is strongly connected and an additional spectral condition on its adjacency matrix. Moreover, we employ recent results about the convergence of stochastic semigroups that dominate a kernel operator to prove that the solutions converge strongly to equilibrium. Finally, we prove that the solutions converge uniformly under more restrictive assumptions.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.