Metraipolis › archive › dc_ce48bf0a802f
Gramian-Informed Framework for Edge Flow Network Analysis Against Nodal Attacks — arXiv:2609.06897
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06897
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:29:32.463Z
- SHA-256 of the archived text
8d2b40080a48041ba3dcbde9cf4dc4d6aaf901e61221d37a7464d464c722694b- Stable URL of this page
https://metraipolis.com/documento/dc_ce48bf0a802f
How to cite
Gramian-Informed Framework for Edge Flow Network Analysis Against Nodal Attacks — arXiv:2609.06897 — arXiv (en), https://arxiv.org/abs/2609.06897 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ce48bf0a802f (Metraipolis archive dc_ce48bf0a802f, sha256 8d2b40080a48041ba3dcbde9cf4dc4d6aaf901e61221d37a7464d464c722694b)
BibTeX
@misc{dcce48bf0a802f,
title = {Gramian-Informed Framework for Edge Flow Network Analysis Against Nodal Attacks — arXiv:2609.06897},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06897},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ce48bf0a802f; sha256 8d2b40080a48041ba3dcbde9cf4dc4d6aaf901e61221d37a7464d464c722694b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06897. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the first-order effects of nodal inputs on edge flows of network systems through controllability Gramians. We consider both discrete- and continuous-time dynamics subject to impulse and step input disturbances. To characterize their impact on network behavior, we introduce the notion of a vulnerability matrix (VM) and provide explicit Gramian-based expressions that reveal the critical role played by the interplay between network topology and dynamics. For the class of directed line networks, we particularize these closed-form expressions in terms of edge weights, input duration, and graph distance to the nodal input. Numerical simulations on directed line and random Erdős-Rényi networks show a tight correspondence between influential nodes identified with the VM and conventional time-domain performance metrics, such as $\mathscr{H}_2$ and $\mathscr{H}_{\infty}$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.06897 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:09:21.677Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).