2008
DOI: 10.1007/s00209-008-0410-x
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic periodicity of recurrent flows in infinite networks

Abstract: We consider a transport process on an infinite network and, using the corresponding flow semigroup as in Dorn (Semigroup Forum 76:341-356, 2008), investigate its long term behavior. Combining methods from functional analysis, graph theory and stochastics, we are able to characterize the networks for which the flow semigroup converges strongly to a periodic group.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
10
0

Year Published

2008
2008
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(10 citation statements)
references
References 28 publications
0
10
0
Order By: Relevance
“…During the last decade a deep and extensive theory of network flow semigroups has been developed which deals, among other topics, with the long time behaviour of the flow and relates it to properties of the underlying graph; see e.g. [40,20,19]. However, it seems that so far only positive weights for the mass diversion in the vertices have been considered.…”
Section: The Resolvent Of the Bi-laplace Operator With Dirichlet Bounmentioning
confidence: 99%
“…During the last decade a deep and extensive theory of network flow semigroups has been developed which deals, among other topics, with the long time behaviour of the flow and relates it to properties of the underlying graph; see e.g. [40,20,19]. However, it seems that so far only positive weights for the mass diversion in the vertices have been considered.…”
Section: The Resolvent Of the Bi-laplace Operator With Dirichlet Bounmentioning
confidence: 99%
“…Wang [3] and W.W. Hu [9] separately obtained the exponential stability of series and parallel repairable system by different methods. At the same time, A. Haji [10,14] obtained the well-posedness and stability of the repairable system with primary and secondary failures and the M/M B /1 queueing model by the methods of [15][16][17][18][19] which are completely different from those of [4][5][6][7][8][9][10]. By the graph 6 in the next section, the repairable system could be interpreted as flows of networks.…”
Section: Introductionmentioning
confidence: 98%
“…In recent years, there are abundant results on the well-posedness and stability of the various kinds of repairable systems [3][4][5][6][7][8][9][10] and similar systems, such as queueing systems [11][12][13][14], flows of networks [15][16][17][18][19] and so on [20][21][22]. In 2001, G. Gupur first obtained the well-posedness and asymptotic stability of several queueing system in [11,12] by the c 0 semigroups theory.…”
Section: Introductionmentioning
confidence: 99%
“…In this case, the intervals are referred to as edges on which the transport process takes place, while in their endpoints, called vertices , the material is distributed into the adjacent edges. The study of such transport processes using semigroup methods has been initiated under the name flows in networks by 14, and since then, many extensions have been considered, such as 7 or 20. See also 8 for a recent survey article.…”
Section: Introductionmentioning
confidence: 99%