Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.06344 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- An Ideal Flow Network (IFN) is a strongly connected network where relative flows are preserved (irreducible premagic matrix). IFN can be decomposed into canonical cycles to form a string code called network signature. A network signature can be composed back into an IFN by assignment and merging operations. Using string manipulations on network signatures, we can derive total flow, link values, sum of rows and columns, and probability matrices and test for irreducibility.