Bi-continuous semigroups for flows on infinite networks
Christian Budde, Marjeta Kramar Fijav\v{z}

TL;DR
This paper investigates transport processes on infinite metric graphs with variable velocities and complex boundary conditions, employing bi-continuous semigroup theory to establish well-posedness in an $L^{\,\infty}$-framework.
Contribution
It introduces a novel application of bi-continuous semigroup theory to analyze transport on infinite networks with stochastic boundary conditions.
Findings
Established well-posedness of transport equations on infinite graphs
Extended semigroup theory to handle non-constant velocities and stochastic matrices
Provided conditions for the existence and uniqueness of solutions
Abstract
We study transport processes on infinite metric graphs with non-constant velocities and matrix boundary conditions in the -setting. We apply the theory of bi-continuous operator semigroups to obtain well-posedness of the problem under different assumptions on the velocities and for general stochastic matrices appearing in the boundary conditions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Bi-Continuous Semigroups for Flows on Infinite Networks
Christian Budde
North-West University, School of Mathematical and Statistical Sciences, Private Bag X6001-209, Potchefstroom 2520, South Africa
and
Marjeta Kramar Fijavž
University of Ljubljana, Faculty of Civil and Geodetic Engineering, Jamova 2, SI-1000 Ljubljana, Slovenia / Institute of Mathematics, Physics, and Mechanics, Jadranska 19, SI-1000 Ljubljana, Slovenia
Abstract.
We study transport processes on infinite metric graphs with non-constant velocities and matrix boundary conditions in the -setting. We apply the theory of bi-continuous operator semigroups to obtain well-posedness of the problem under different assumptions on the velocities and for general stochastic matrices appearing in the boundary conditions.
Key words and phrases:
transport equations, infinite metric graphs, bi-continuous operator semigroups, Bochner -spaces, perturbations.
1991 Mathematics Subject Classification:
Primary: 35R02; Secondary: 35F46, 47D06, 46A70.
The authors are grateful to University of Wuppertal for the possibility of funding the stay of the first author at the University of Ljubljana within the Erasmus exchange program. The first author was supported by the DAAD-TKA Project 308019 “Coupled systems and innovative time integrators”. The second author acknowledges financial support from the Slovenian Research Agency, Grant No. P1-0222. Both authors are thankful to Bálint Farkas for encouraging the topic of this paper as well as for many beneficial discussions, and to Eszter Sikolya for her valuable comments.
1. Introduction
Consider a huge network of possibly unknown size but known structure. To model this situation, we may take an infinite graph and equip it with the appropriate combinatorial assumptions. Along the edges of the network some transport processes take place that are coupled in the vertices in which the edges meet. This means that we consider each edge as an interval and describe functions on it, that is, we consider a metric graph. Such systems of partial differential equations on a metric graph are also known as quantum graphs. The transport processes (or flows) on the edges are given by partial differential equations of the form and are interlinked in the common nodes via some prescribed transmission conditions.
Such a problem was considered by Dorn et al. [15, 16, 17] on the state space applying the theory of strongly continuous operator semigroups. A semigroup approach to flows in finite metric graphs was first presented by Kramar and Sikolya [24] and further used in [28, 18, 17, 10, 5, 9] while transport processes in infinite networks were also studied in [6, 8]. All these results were obtained in the -setting. Mátrai and Sikolya [28] went further and considered the space of bounded Borel measures. When studying problems in infinite graphs, the flow problem in the -setting should be interesting for applications as well. Von Below and Lubary [31, 32], for example, study eigenvalues of the Laplacian on infinite networks in an -setting. Also the celebrated existence, uniqueness, and stability results for linear transport equations by DiPerna and Lions [13] are proven in the -setting for all . To the best of our knowledge, transport equations on infinite metric graphs with an -state space have not yet been studied. By Lotz’ Theorem [27, Thm. 3], every strongly continuous semigroup on an -space is automatically uniformly continuous which means that semigoups on such spaces, which are not strongly continuous, are of special interest and a different approach is needed. We consider the transport problem on the state space where the obtained operator semigroup is not strongly continuous. To tackle this we apply the theory of bi-continuous semigroups that was introduced by Kühnemund [25, 26] and further developed by Farkas [20, 21, 22] and Albanese-Lorenzi-Manco [2].
This paper is organised as follows. Section 2 is a preliminary section which we start by a short introduction to the theory of bi-continuous semigroups. We also recall certain duality concepts of Bochner -spaces that are needed later to obtain the generation theorem, and introduce some notions for networks and metric graphs. In Section 3 we present our flow problem for an infinite metric graph. We first prove the well posedness in the case when all flow velocities equal 1. Next, we generalise this result to the case with rationally dependent velocities satisfying a finiteness condition. Finally, we show that the general problem on a finite metric graph is well-posed.
2. Preliminaries
2.1. Bi-Continuous Semigroups
A family of linear bounded operators on a Banach space is called a (one-parameter) strongly continuous semigroup if it satisfies the following properties,
- (1)
, for all , and 2. (2)
the function is continuous for all .
Strongly continuous semigroups and their applications to evolution equations have been studied intensively in the last decades, we refer to monographs [19, 4, 9] and references therein. It is well-known, however, that there are important examples of semigroups which fail to satisfy property (2) above, i.e., that are not strongly continuous with respect to the Banach space norm. A standard example is the left translation semigroup on defined by It is also known that this semigroup is strongly continuous with respect to the so-called compact open topology . This is a locally convex topology induced by the family of seminorms where
[TABLE]
Hence, it might be useful to equip the given Banach space with an additional locally convex topology . This is the general idea of the so-called bi-continuous semigroups. Before giving the proper definition we state the main assumptions on the interplay between the norm and the locally convex topology .
Assumption 2.1**.**
- (i)
is a Hausdorff topology and is coarser then the norm-topology on , i.e., the identity map is continuous. 2. (ii)
is sequentially complete on norm-bounded sets, i.e., every -bounded -Cauchy sequence in -convergent. 3. (iii)
The dual space of is norming for , i.e.,
[TABLE]
Remark 2.2**.**
- (a)
One can re-formulate the third assumption by the following equivalent statement: There is a set of -continuous seminorms defining the topology , such that
[TABLE] 2. (b)
The above mentioned compact-open topology on satisfies all these assumptions.
Now we are in the state to formulate the definition of a bi-continuous semigroup.
Definition 2.3** (Kühnemund [26]).**
Let be a Banach space with norm together with a locally convex topology , such that the conditions in Assumption 2.1 are satisfied. We call a family of linear bounded operators a bi-continuous semigroup on if the following holds.
- (i)
satisfies the semigroup property, i.e., and for all . 2. (ii)
is strongly -continuous, i.e., the map defined by is continuous for every . 3. (iii)
is exponentially bounded, i.e., there exist and such that for each . 4. (iv)
is locally-bi-equicontinuous, i.e., if is a norm-bounded sequence in which is -convergent to [math], then also is -convergent to [math] uniformly for for each fixed .
The growth bound of is defined as
[TABLE]
As in the case of strongly continuous semigroups one can define a generator and relate it to the well-posedness property of abstract initial value problems. The generator of a bi-continuous semigroup is defined as
[TABLE]
with the domain
[TABLE]
Let us recall some more notions from the bi-continuous setting. A subset is called bi-dense if for every there exists a -bounded sequence in which is -convergent to . An operator is called bi-closed, whenever for and , where both sequences are norm-bounded, it holds and .
We have collected here some basic properties of generators of bi-continuous semigroups. For the proofs we refer to [25, 26, 21].
Proposition 2.4**.**
The following assertions hold for the generator of a bi-continuous semigroup .
- (a)
The operator is bi-closed and its domain is bi-dense in . 2. (b)
For one has and for all . 3. (c)
For and one has
[TABLE] 4. (d)
For one has and for every
[TABLE]
where the integral is a -improper integral. 5. (e)
The semigroup is uniquely determined by its generator .
The following generalisation of the classical notion of well-posedness is due to Farkas [20, Def. 4.1.1]. By we denote the space of functions that are bounded on each compact subset of and the differentiation is understood in the vector valued sense with respect to .
Definition 2.5**.**
The abstract Cauchy problem
[TABLE]
is well-posed in if
- (i)
for every there exists a solution of (ACP) with and , 2. (ii)
the solution is unique, and 3. (iii)
the solution of (ACP) depends continuously on the initial data , i.e., if the sequence is norm-bounded and -convergent to [math] then the solutions converge to [math] in and uniformly on compact intervals .
Theorem 2.6**.**
[20, Thm. 4.1.2]** If generates a bi-continuous semigroup then the abstract Cauchy problem (ACP) is well-posed.
This result is very useful for applications in combination with some version of the generation theorem for bi-continuous semigroups. We only recall here a variant of Trotter–Kato approximation theorem, see [25, 3, 20]. For that we also evoke the notion of uniformly bi-continuous semigroups [25, Def. 2.1].
Definition 2.7**.**
Let , , be bi-continuous semigroups on . They are called uniformly bi-continuous (of type ) if the following conditions hold.
- (i)
There exist and such that for all and . 2. (ii)
are locally bi-equicontinuous uniformly for , i.e., for every and for every -bounded sequence in which is -convergent to [math] we have
[TABLE]
uniformly for and .
Let us also recall the notion of a bi-core, as defined in [25, Def. 1.20]. A subspace of the domain of a linear operator on a Banach space is a bi-core for if for all there exists a sequence in such that and are -bounded and with respect to the locally convex (graph) topology generated by the family of seminorms
[TABLE]
Having these definitions in mind, we can state the Trotter–Kato approximation theorem for bi-continuous semigroups which was first proven by Kühnemund [25, Thm. 2.6] and later on in a more general version by Albanese and Mangino [3, Thm. 3.6]. For locally equicontinuous semigroups on locally convex space this was done by Albanese and Kühnemund [1, Thm. 16].
Theorem 2.8**.**
[25, Thm. 2.6]** Let , , be bi-continuous semigroups with generators such that they are uniformly bi-continuous of type and let . Consider the following assertions.
- (a)
There exists a bi-densely defined operator such that for all in a bi-core of and such that is bi-dense in . 2. (b)
There exists an operator such that for all in a subset of which is bi-dense in . 3. (c)
There exists a bi-continuous semigroup with generator such that for all uniformly for in compact intervals
Then the implications hold. In this case, the bi-closure of equals .
Remark 2.9**.**
In the proof of [25, Thm. 2.6] one observes that operator in assertion (b) gives rise to a pseudo-resolvent that is used to define operator in assertion (c).
We refer to [25, 26, 20, 11, 21, 3] for further properties of bi-continuous semigroups and their generators.
2.2. Bochner -spaces, duality, and translation semigroups
We consider spaces of the form where is a Banach space. From [12, Chapter IV,Section 1] we obtain that for and one has
[TABLE]
whenever has the Radon–Nikodym property. If this is not the case, one only has an isometric inclusion for . Recall, that the pairing is defined by
[TABLE]
and denotes the dual pairing between and .
Example 1**.**
It is known that the space has the Radon-Nikodym property while the spaces , , and do not. Recall that while as well as (that is, the space does not have a unique predual space). By (2.2) we obtain that
[TABLE]
while is only isomorphic to a subspace of .
We would like to study the left translation semigroup on the space , which is not strongly continuous. By using duality arguments we will show that it is, however, a bi-continuous semigroup on . We start by showing that the right translation semigroup on is strongly continuous.
Lemma 2.10**.**
The right translation semigroup , defined by
[TABLE]
for and , is strongly continuous on .
Proof.
Let and let for a measurable subset . We first show that with respect to the norm on as :
[TABLE]
where is the one-dimensional Lebesgue measure on and the symmetric difference of sets defined by . Since every function is an increasing limit of linear combinations of functions of the form for some and measurable set , the vector-valued version of Beppo–Levis’s monotone convergence theorem [30, Prop. 2.6] yields the result. ∎
Now note, that the left translation semigroup on is the adjoint semigroup of the right translation semigroup on , see Subsection 2.2 and [19, II.5.14].
Lemma 2.11**.**
The left translation semigroup , defined by
[TABLE]
for and , is bi-continuous on with respect to the weak∗-topology.
Proof.
By [29, Corollary 2.1.7], the dual space of any Banach space satisfies Assumption 2.1 for the weak∗-topology. Moreover, by [25, Proposition 3.18], the dual semigroup on is bi-continuous with respect to the weak∗-topology whenever is a strongly continuous semigroup on . Thus, [23, Example 1.3], Example 1 and Lemma 2.10 imply the result. ∎
Remark 2.12**.**
Let us stress here that, given a strongly continuous semigroup, its adjoint semigroup on the dual space is not necessarily strongly continuous. Indeed, the translation semigroup is not strongly continuous in the sup-norm of the -space and the largest subspace where it is strongly continuous is , the space of all bounded, uniformly continuous functions (the so-called sun dual, see [19, Sec. II.2.5]). Since we are interested in the solutions taking place in , the classical theory on adjoint semigroups does not apply. The above result, however, shows that the theory of bi-continuous semigroups is appropriate here.
2.3. Infinite Networks, Metric Graphs
We use the notation introduced in [24] for finite networks and expanded in [15] to infinite networks. A network is modeled with an infinite directed graph with a set of vertices and a set of directed edges for some countable sets . For a directed edge we call the tail and the head of . Further, the edge is an outgoing edge of the vertex and an incoming edge for the vertex . We assume that graph is simple, i.e., there are no loops or multiple edges, and locally finite, i.e., each vertex only has finitely many incident edges.
Graph is weighted, that is equipped with some weights such that
[TABLE]
The structure of a graph can be described by its incidence and/or adjacency matrices. We shall only use the so-called weighted (transposed) adjacency matrix of the line graph defined as
[TABLE]
By (2.4), matrix defines a stochastic operator on . From that it follows that . It reflects many properties of graph . For example, is irreducible iff graph is strongly connected (see [15, Prop. 4.9]).
We identify every edge of our graph with the unit interval, for each , and parametrise it contrary to its direction, so that it is assumed to have its tail at the endpoint and its head at the endpoint [math]. For simplicity we use the notation and for the tail and the head, respectively. In this way we obtain a metric graph.
For the unexplained terminology we refer to [9, Sect. 18] and [15].
3. Transport problems in (in)finite metric graphs
We now consider a transport process (or a flow) along the edges of an infinite network, modeled by a metric graph . The distribution of material along the edge at time is described by a function for . The material is transported along the edge with constant velocity and is absorbed according to the absorption rate . We assume that and
[TABLE]
for all . Let be a diagonal velocity matrix and define another weighted adjacency matrix of the line graph by
[TABLE]
In the vertices the material gets redistributed according to some prescribed rules. This is modelled in the boundary conditions by using the adjacency matrix . The flow process on is thus given by the following infinite system of equations
[TABLE]
for every , where are the initial distributions along the edges.
One can give different interpretations to the weights , i.e, entries of the matrix , resulting in different transport problems. The two most obvious are the following.
- (1)
is the proportion of the material arriving from edge leaving on edge . 2. (2)
is the proportion of the material arriving from vertex leaving on edge .
Note, that in both situations (2.4) represents a conservation of mass and the assumption on local finiteness of the graph guarantees that all the sums are finite. While the latter situation is the most common one (see e.g. [15, 24, 9]) the first one was considered for finite networks in [10, Sect. 5]. Here, we will not give any particular interpretation and will treat all the cases simultaneously.
Remark 3.1**.**
By replacing in (3.2) the graph matrix with some other matrix, one obtains a more general initial-value problem that does not necessarily consider a process in a physical network. Such a problem from population dynamics was for example studied in [6]. Furthermore, a question when can such a general problem be identified with a corresponding problem on a metric graph was raised in [5].
Remark 3.2**.**
Note, that we could also consider space-dependent velocities and then either re-norm the space as in [28]:
[TABLE]
or change the variables appropriately to obtain an equivalent problem with constant velocities.
3.1. The simple case
First we assume that all the velocities are the same and there is no absorption: and for each . As the state space we choose equipped with the norm
[TABLE]
On the Banach space we define the operator by
[TABLE]
Observe that the corresponding abstract Cauchy problem
[TABLE]
on is equivalent to the flow problem (3.2) in case when all the velocities equal 1. This problem was considered by Dorn [15] on the state space where an explicit formula for the solution semigroup in terms of a shift and matrix was derived. We will use this formula and show that it yields a bi-continuous semigroup on . For that we have to check all the assertions from Definition 2.3 which we do in several steps.
Lemma 3.3**.**
The semigroup on , defined by
[TABLE]
is strongly continuous with respect to the weak∗-topology.
Proof.
The semigroup property is easy to verify. Observe that for any , , and we have
[TABLE]
Now, notice that the second summand vanishes since as . Here, is the one-dimensional Lebesgue measure on the unit interval . By Lemma 2.11, the left translation semigroup is bi-continuous on , which means, in particular, that it is strongly continuous with respect to the weak∗-topology and hence the first summand also vanishes as . ∎
Lemma 3.4**.**
The semigroup , defined by (3.5), is a contraction semigroup on .
Proof.
Let and . Then there exists such that . This means that for one has . By (3.5), we can make the following estimate:
[TABLE]
Since , we have
[TABLE]
and hence, . ∎
Lemma 3.5**.**
The semigroup , defined by (3.5), is locally bi-equicontinuous with respect to the weak∗-topology on .
Proof.
Let be a sequence of functions in that is -bounded and converges to [math] with respect to the weak∗-topology. By Definition 2.3, we need to show that converges to [math] with respect to the weak∗-topology uniformly on compact intervals . To this end, fix For every one can find , , such that for all and by (3.5) we have
[TABLE]
hence
[TABLE]
for any . Observe, that our assumption on locally finiteness of the graph implies that both and only have finitely many elements in each row or column. Therefore, leaves the space invariant. Moreover, there are only finitely many choices of the integer and we have
[TABLE]
Since, by Lemma 2.11, the left translation semigroup is bi-continuous, hence locally bi-equicontinuous with respect to the weak∗-topology on , also tends to [math] uniformly on . This finishes the proof. ∎
Let us here recall the explicit expression of the resolvent of operator defined by (3.3) which was obtained in [15, Theorem 18]. This result does not rely on the Banach space and remains the same by taking .
Proposition 3.6**.**
For the resolvent of the operator defined by (3.3) is given by
[TABLE]
, .
We are now in the state to prove the first generation theorem.
Theorem 3.7**.**
The operator , defined in (3.3), generates a contraction bi-continuous semigroup on with respect to the weak∗-topology. This semigroup is given by (3.5).
Proof.
By Lemmas 3.3, 3.4, and 3.5, the semigroup defined by (3.5) is a bi-continuous semigroup with respect to the weak∗-topology. It remains to show that , given in (3.3), is the generator of this semigroup. Let be the generator of . For and we have . By (2.1), the resolvent of is the Laplace transform of the semigroup , that is, for we have
[TABLE]
By Proposition 3.6, the resolvent operators and , coincide on the bi-dense set , so we may conclude that . ∎
Corollary 1**.**
If all and , , the flow problem (3.2) is well-posed on .
Remark 3.8**.**
All the obtained results also hold for finite networks. If is a finite network with , we have , hence we consider our semigroups on the space .
3.2. The rationally dependent case
We now consider the case when the velocities appearing in (3.2) are not all equal to and define on the operator
[TABLE]
We assume, however, that the velocities are linearly dependant over : for all , with a finite common multiplier, that is,
[TABLE]
This enables us to use the procedure that was introduced in the proof of [24, Thm. 4.5] and carried out in detail in [7, Sect. 3]. We construct a new directed graph by adding vertices on edge for all . The newly obtained edges inherit the direction of the original edge and are parametrised as unit intervals . We can thus consider a new problem on with corresponding functions and velocities for each . After appropriately correcting the initial and boundary conditions the new problem is equivalent to the original one. Since all the velocities on the edges of the new graph are equal, we can treat this case by rescaling to 1 and use the results from Subsection 3.1. Moreover, since (3.1) and (3.7) hold, the procedure described in [7, Sect. 3] for the finite case can be as preformed in the infinite case as well. Hence, we even obtain an isomorphism between the corresponding semigroups.
Theorem 3.9**.**
Let the assumptions (3.1) and (3.7) on the velocities hold. Then the operator , defined in (3.6), generates a contraction bi-continuous semigroup on with respect to the weak∗-topology. Moreover, there exists a lattice isomorphism such that
[TABLE]
where the semigroup is given by (3.5).
Finally, we also allow nonzero absorption functions . Notice, that (3.2) is equivalent to the abstract Cauchy problem associated to the following operator
[TABLE]
where denotes the multiplication operator with the function . We can split the operator into a sum of operators
[TABLE]
We already know that the operator generates a bi-continuous semigroup on . In order to show that is a generator as well we shall apply the perturbation theory for bi-continuous semigroups.
Theorem 3.10**.**
Let the assumptions (3.1) and (3.7) hold and let . Then the operator , defined by (3.9), generates a bi-continuous semigroup on with respect to the weak∗-topology.
Proof.
By Theorem 3.9, is the generator of a bi-continuous semigroup. Since , the multiplication operator is a bounded operator on and its dual is again a multiplication operator. Therefore, we can apply the special case of the bounded perturbation theorem for bi-continuous semigroups due to Farkas, cf. [21, Prop. 4.3] yielding that generates a bi-continuous semigroup on . ∎
Remark 3.11**.**
Note, that the bi-continuous semigroup obtained in Theorem 3.10 is given by the Dyson-Phillips series, see [21, Thm. 3.5]. The semigroup can also be represented by means of the Trotter product formula for bi-continuous semigroups, cf. [3, Cor. 4.2] or [25, Cor. 2.11]. Let denote the semigroup generated by . Then
[TABLE]
for all and uniformly on compact intervals, where we denote by the bi-continuous semigroup generated by given in (3.8)..
Corollary 2**.**
If the assumptions (3.1) and (3.7) on the velocities hold and , then the flow problem (3.2) is well-posed on .
3.3. The general case for finite networks
We finally consider the case of general but restrict ourselves to finite graphs, i.e., we work on the Banach space , where denotes the number of edges in the graph. In [9, Cor. 18.15] the Lumer–Phillips generation theorem for positive strongly continuous semigroups is applied to show that the transport problem with general is well-posed on . Since an appropriate variant of this result for the bi-continuous situation is not known, we proceed differently and use the variant of Trotter–Kato approximation theorem given in Theorem 2.8.
Let
[TABLE]
By using this notation one can write an explicit expression for the resolvent of the operator defined in (3.6).
Lemma 3.12**.**
[9, Prop. 18.12]** For the resolvent of the operator , given in (3.6), equals
[TABLE]
where denotes the point evaluation at [math] and
[TABLE]
Theorem 3.13**.**
The operator , defined in (3.6), generates a bi-continuous semigroup on .
Proof.
We first show that the operator is bi-densely defined. Take any . For let and define by a linear truncation of outside , i.e.,
[TABLE]
Observe that is Lipschitz for each and hence . Moreover for each implying that , hence . Furthermore, one has that and as with respect to the weak∗-topology since
[TABLE]
for each .
We now define a sequence of operators approximating in the following way. For each there exists a sequence in such that . Since the network is finite, for each the velocities , , satisfy condition (3.7) and, by Proposition 3.9 we obtain a contraction bi-continuous semigroup generated by
[TABLE]
where . Moreover, all semigroups , , are similar and thus uniformly bi-continuous of type 0.
Observe, that the general assumptions of Theorem 2.8 are satisfied. Let us now check the assumptions of assertion (b). Let and observe that is a bijection. By above, is bi-dense in . For every , replacing by for all , Lemma (3.12) yields an explicit expression for . It is easy to see that for as . Applying Theorem 2.8 gives us a bi-continuous semigroup with generator . Note that, since in our case is a resolvent, by Remark 2.9 we have for and by the uniqueness of the Laplace transform we conclude that . ∎
Corollary 3**.**
The flow problem (3.2) is well-posed on .
Remark 3.14**.**
In the same manner, by using the original strongly continuous version of the Trotter–Kato Theorem (see [19, Sect. III.4b]), one can deduce the well-posedness of the problem on .
Remark 3.15**.**
Note, that by our assumptions (see also [9, (18.20)]), hence von-Neuman expansion yields positivity of the resolvent given in Lemma 3.12 (which can be proven also in the case of an infinite graph). By [20, Them. 1.4.1], thus generates a positive bi-continuous semigroup. Further, some spectral properties can be deduced from the resolvent formula as in [15].
Conclusion
We have shown that the abstract theory of bi-continuous operator semigroups can be successfully applied to study transport processes in infinite networks. This opens the door for various possible further considerations. In fact, our setting is already used in [14] where the long-term behaviour of the solutions in the spirit of [17] is studied. By using a concept of the semigroup at infinity and recently developed asymptotical theory, it is shown that, under suitable assumptions on the graph, the bi-continuous semigroups obtained in Theorem 3.7 and and Theorem 3.9 both behave asymptotically periodic with respect to the operator norm. In the case of general velocities, the question of well-posedness of problem (3.2) as well as the description of the long-time behaviour of its solutions in remain open.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Albanese and F. Kühnemund. Trotter-Kato approximation theorems for locally equicontinuous semigroups. Riv. Mat. Univ. Parma (7) , 1:19–53, 2002.
- 2[2] A. A. Albanese, L. Lorenzi, and V. Manco. Mean ergodic theorems for bi-continuous semigroups. Semigroup Forum , 82(1):141–171, Feb 2011.
- 3[3] A. A. Albanese and E. Mangino. Trotter-Kato theorems for bi-continuous semigroups and applications to Feller semigroups. Journal of Mathematical Analysis and Applications , 289(2):477 – 492, 2004.
- 4[4] W. Arendt, A. Grabosch, G. Greiner, U. Groh, H. P. Lotz, U. Moustakas, R. Nagel, F. Neubrander, and U. Schlotterbeck. One-parameter semigroups of positive operators , volume 1184 of Lecture Notes in Mathematics . Springer-Verlag, Berlin, 1986.
- 5[5] J. Banasiak and A. Falkiewicz. Some transport and diffusion processes on networks and their graph realizability. Appl. Math. Lett. , 45:25–30, 2015.
- 6[6] J. Banasiak and A. Falkiewicz. A singular limit for an age structured mutation problem. Math. Biosci. Eng. , 14(1):17–30, 2017.
- 7[7] J. Banasiak and P. Namayanja. Asymptotic behaviour of flows on reducible networks. Netw. Heterog. Media , 9(2):197–216, 2014.
- 8[8] J. Banasiak and A. Puchalska. Generalized network transport and Euler-Hille formula. Discrete Contin. Dyn. Syst., Ser. B , 23(5):1873–1893, 2018.
