Asymptotic behaviour of flows on reducible networks
From MaRDI portal
(Redirected from Asymptotic behaviour of flows on reducible networks)
asymptotic periodicitydiagraphnetworksresolvent positive operatorssemigroups of operatorstopological sorting algorithmtransport equations
Applications of graph theory (05C90) Boundary value problems for systems of linear first-order PDEs (35F45) PDEs on graphs and networks (ramified or polygonal spaces) (35R02) One-parameter semigroups and linear evolution equations (47D06) Transport processes in time-dependent statistical mechanics (82C70)
Recommendations
Cites work
- Algebraic graph theory
- Asymptotic behavior of flows in networks
- Asymptotic periodicity of recurrent flows in infinite networks
- Birth-and-death type systems with parameter and chaotic dynamics of some linear kinetic models
- Continuous-time Markov chains. An applications-oriented approach
- Digraphs
- Flows in networks with dynamic ramification nodes
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 3446921 (Why is no real title available?)
- Modeling and analysis of modal switching in networked transport systems
- Non-negative matrices and Markov chains.
- One-parameter semigroups for linear evolution equations
- One-parameter semigroups of positive operators
- Relative entropy and discrete Poincaré inequalities for reducible matrices
- Resolvent Positive Operators
- Semigroups for flows in infinite networks
- Spectral properties and asymptotic periodicity of flows in networks
- The semigroup approach to transport processes in networks
Cited in
(26)- Generalized network transport and Euler-Hille formula
- Chaotic dynamics in a transport equation on a network
- Dynamic transmission conditions for linear hyperbolic systems on networks
- Bi-continuous semigroups for flows on infinite networks
- Well-posedness and approximate controllability of neutral network systems
- Telegraph systems on networks and port-Hamiltonians. III: Explicit representation and long-term behaviour
- Flows on metric graphs with general boundary conditions
- Telegraph systems on networks and port-Hamiltonians. II: Network realizability
- On the asymptotic behaviour of semigroups for flows in infinite networks
- Telegraph systems on networks and port-Hamiltonians. I. Boundary conditions and well-posedness
- Some transport and diffusion processes on networks and their graph realizability
- Asymptotic periodicity of flows in time-depending networks
- Explicit formulae for limit periodic flows on networks
- Kinetic models in natural sciences
- scientific article; zbMATH DE number 1004242 (Why is no real title available?)
- scientific article; zbMATH DE number 3845308 (Why is no real title available?)
- On flows in simple bidirected and skew-symmetric networks
- Semigroup approach to diffusion and transport problems on networks
- Transport on networks -- a playground of continuous and discrete mathematics in population dynamics
- Asymptotic behavior of flows in networks
- Well-posedness and stability of a class of linear systems
- A monotone finite volume scheme for linear drift-diffusion and pure drift equations on one-dimensional graphs
- Explicit representation of a semigroup related to flows on networks with unbounded edges
- Semigroups for dynamical processes on metric graphs
- Flows in networks with dynamic ramification nodes
- A note on asymptotic formulae for one-dimensional network flow problems
This page was built for publication: Asymptotic behaviour of flows on reducible networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480064)
