2000 character limit reached
Asymptotic periodicity of flows in time-depending networks (1302.4196v2)
Published 18 Feb 2013 in math.AP, math.DS, and math.FA
Abstract: We consider a linear transport equation on the edges of a network with time-varying coefficients. Using methods for non-autonomous abstract Cauchy problems, we obtain well-posedness of the problem and describe the asymptotic profile of the solutions under certain natural conditions on the network. We further apply our theory to a model used for air traffic flow management.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
