|
|
|
|
| LEADER |
02720nam a2200469Ia 4500 |
| 001 |
10.1109-TCNS.2022.3175127 |
| 008 |
220630s2022 CNT 000 0 und d |
| 020 |
|
|
|a 23255870 (ISSN)
|
| 245 |
1 |
0 |
|a Macroscopic network circulation for planar graphs
|
| 260 |
|
0 |
|b Institute of Electrical and Electronics Engineers Inc.
|c 2022
|
| 520 |
3 |
|
|a The analysis of networks, aimed at suitably defined functionality, often focuses on partitions that capture desired features. Chief among the relevant concepts is a 2-partition; this underlies the Cheeger inequality and highlights a ‘`constriction’' that limits accessibility between the respective parts of the network. In a similar spirit, we explore a notion of global circulation which necessitates a concept of a 3-partition that exposes this macroscopic feature of network flows. Graph circulation is often present in transportation networks as well as in certain biological networks. We introduce a notion of circulation for general graphs and then focus on planar graphs. For the latter we explain that a scalar potential characterizes circulation in complete analogy with the curl of planar vector fields and we present an algorithm for determining values of the potential and, hence, quantify circulation. We then discuss notions of circulation, explain how these may depend on graph embedding, draw parallels with Helmholtz-Hodge decomposition of vector fields, and conclude with an application in detecting abnormalities in cardiac circulatory physiology. IEEE
|
| 650 |
0 |
4 |
|a Cardiac circulatory abnormalities
|
| 650 |
0 |
4 |
|a Cardiac circulatory abnormality
|
| 650 |
0 |
4 |
|a Control systems
|
| 650 |
0 |
4 |
|a Graph Partitioning
|
| 650 |
0 |
4 |
|a Graph Partitioning
|
| 650 |
0 |
4 |
|a Graph theory
|
| 650 |
0 |
4 |
|a Graphic methods
|
| 650 |
0 |
4 |
|a Helmholtz-hodge decomposition
|
| 650 |
0 |
4 |
|a Helmholtz-hodge decomposition on graph
|
| 650 |
0 |
4 |
|a Helmholtz-Hodge decomposition on graphs
|
| 650 |
0 |
4 |
|a Linear matrix in equalities
|
| 650 |
0 |
4 |
|a Linear matrix inequalities
|
| 650 |
0 |
4 |
|a Linear matrix inequalities
|
| 650 |
0 |
4 |
|a Markov chains
|
| 650 |
0 |
4 |
|a Markov processes
|
| 650 |
0 |
4 |
|a Markov processes
|
| 650 |
0 |
4 |
|a Mathematical models
|
| 650 |
0 |
4 |
|a Network systems
|
| 650 |
0 |
4 |
|a Network systems
|
| 650 |
0 |
4 |
|a Planar graph
|
| 650 |
0 |
4 |
|a Symmetric matrices
|
| 650 |
0 |
4 |
|a Symmetric matrices
|
| 650 |
0 |
4 |
|a Urban areas
|
| 650 |
0 |
4 |
|a Urban areas
|
| 650 |
0 |
4 |
|a Vector fields
|
| 700 |
1 |
0 |
|a Ariaei, F.
|e author
|
| 700 |
1 |
0 |
|a Askarzadeh, Z.
|e author
|
| 700 |
1 |
0 |
|a Chen, Y.
|e author
|
| 700 |
1 |
0 |
|a Georgiou, T.T.
|e author
|
| 773 |
|
|
|t IEEE Transactions on Control of Network Systems
|
| 856 |
|
|
|z View Fulltext in Publisher
|u https://doi.org/10.1109/TCNS.2022.3175127
|
