Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2408.06344 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916355085697024 |
|---|---|
| author | Teknomo, Kardi |
| author_facet | Teknomo, Kardi |
| 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_06344 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Signatures of Ideal Flow Networks Teknomo, Kardi Discrete Mathematics Social and Information Networks Representation Theory 05C50, 05C38 (Primary) 05C21, 47C05 (Secondary) G.2.2; I.1.1 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. |
| title | The Signatures of Ideal Flow Networks |
| topic | Discrete Mathematics Social and Information Networks Representation Theory 05C50, 05C38 (Primary) 05C21, 47C05 (Secondary) G.2.2; I.1.1 |
| url | https://arxiv.org/abs/2408.06344 |