A (Strongly) Connected Weighted Graph is Uniformly Detectable based on any Output Node
Many dynamical systems, including thermal, fluid, and multi-agent systems, can be represented as weighted graphs. In this paper we consider whether the unstable states of such systems can be observed from limited discrete-time measurement, that is, whether the discrete formulation of system is detec...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Inyang-Udoh, Uduak Shanks, Michael Jain, Neera |
| description | Many dynamical systems, including thermal, fluid, and multi-agent systems,
can be represented as weighted graphs. In this paper we consider whether the
unstable states of such systems can be observed from limited discrete-time
measurement, that is, whether the discrete formulation of system is detectable.
We establish that if the associated graph is fully connected, then a linear
time invariant system is detectable by measuring any state. Further, we show
that a parameter-varying or time-varying system remains uniformly detectable
for a reasonable approximation of its state transition matrix, if the
underlying graph structure is maintained. |
| doi_str_mv | 10.48550/arxiv.2209.13119 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2209_13119</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2209_13119</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-dbbac807f73630806c0983a55695cb4b39d4fa94e5e95db7ae013341ea8e8e033</originalsourceid><addsrcrecordid>eNotj7FOwzAURb0woMIHMOERhgS7thN7rAIUpIoOFBij5_iltZQ6keMi8ve0hene4ehIh5AbznKplWIPEH_8dz6fM5Nzwbm5JJ8LeveeYh-23XRPqz4EbBI6-oV-uzudZYRhR_1IP4Jv-7jvJvqI6QiB7ZBaGI9MHyiEia4PaTgk-tY7vCIXLXQjXv_vjGyenzbVS7ZaL1-rxSqDojSZsxYazcq2FIVgmhUNM1qAUoVRjZVWGCdbMBIVGuVsCci4EJIjaNTIhJiR2z_tOaweot9DnOpTYH0OFL-cI0rV</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A (Strongly) Connected Weighted Graph is Uniformly Detectable based on any Output Node</title><source>arXiv.org</source><creator>Inyang-Udoh, Uduak ; Shanks, Michael ; Jain, Neera</creator><creatorcontrib>Inyang-Udoh, Uduak ; Shanks, Michael ; Jain, Neera</creatorcontrib><description>Many dynamical systems, including thermal, fluid, and multi-agent systems,
can be represented as weighted graphs. In this paper we consider whether the
unstable states of such systems can be observed from limited discrete-time
measurement, that is, whether the discrete formulation of system is detectable.
We establish that if the associated graph is fully connected, then a linear
time invariant system is detectable by measuring any state. Further, we show
that a parameter-varying or time-varying system remains uniformly detectable
for a reasonable approximation of its state transition matrix, if the
underlying graph structure is maintained.</description><identifier>DOI: 10.48550/arxiv.2209.13119</identifier><language>eng</language><subject>Computer Science - Systems and Control ; Mathematics - Dynamical Systems</subject><creationdate>2022-09</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2209.13119$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2209.13119$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Inyang-Udoh, Uduak</creatorcontrib><creatorcontrib>Shanks, Michael</creatorcontrib><creatorcontrib>Jain, Neera</creatorcontrib><title>A (Strongly) Connected Weighted Graph is Uniformly Detectable based on any Output Node</title><description>Many dynamical systems, including thermal, fluid, and multi-agent systems,
can be represented as weighted graphs. In this paper we consider whether the
unstable states of such systems can be observed from limited discrete-time
measurement, that is, whether the discrete formulation of system is detectable.
We establish that if the associated graph is fully connected, then a linear
time invariant system is detectable by measuring any state. Further, we show
that a parameter-varying or time-varying system remains uniformly detectable
for a reasonable approximation of its state transition matrix, if the
underlying graph structure is maintained.</description><subject>Computer Science - Systems and Control</subject><subject>Mathematics - Dynamical Systems</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj7FOwzAURb0woMIHMOERhgS7thN7rAIUpIoOFBij5_iltZQ6keMi8ve0hene4ehIh5AbznKplWIPEH_8dz6fM5Nzwbm5JJ8LeveeYh-23XRPqz4EbBI6-oV-uzudZYRhR_1IP4Jv-7jvJvqI6QiB7ZBaGI9MHyiEia4PaTgk-tY7vCIXLXQjXv_vjGyenzbVS7ZaL1-rxSqDojSZsxYazcq2FIVgmhUNM1qAUoVRjZVWGCdbMBIVGuVsCci4EJIjaNTIhJiR2z_tOaweot9DnOpTYH0OFL-cI0rV</recordid><startdate>20220926</startdate><enddate>20220926</enddate><creator>Inyang-Udoh, Uduak</creator><creator>Shanks, Michael</creator><creator>Jain, Neera</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20220926</creationdate><title>A (Strongly) Connected Weighted Graph is Uniformly Detectable based on any Output Node</title><author>Inyang-Udoh, Uduak ; Shanks, Michael ; Jain, Neera</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-dbbac807f73630806c0983a55695cb4b39d4fa94e5e95db7ae013341ea8e8e033</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Systems and Control</topic><topic>Mathematics - Dynamical Systems</topic><toplevel>online_resources</toplevel><creatorcontrib>Inyang-Udoh, Uduak</creatorcontrib><creatorcontrib>Shanks, Michael</creatorcontrib><creatorcontrib>Jain, Neera</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Inyang-Udoh, Uduak</au><au>Shanks, Michael</au><au>Jain, Neera</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A (Strongly) Connected Weighted Graph is Uniformly Detectable based on any Output Node</atitle><date>2022-09-26</date><risdate>2022</risdate><abstract>Many dynamical systems, including thermal, fluid, and multi-agent systems,
can be represented as weighted graphs. In this paper we consider whether the
unstable states of such systems can be observed from limited discrete-time
measurement, that is, whether the discrete formulation of system is detectable.
We establish that if the associated graph is fully connected, then a linear
time invariant system is detectable by measuring any state. Further, we show
that a parameter-varying or time-varying system remains uniformly detectable
for a reasonable approximation of its state transition matrix, if the
underlying graph structure is maintained.</abstract><doi>10.48550/arxiv.2209.13119</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2209.13119 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2209_13119 |
| source | arXiv.org |
| subjects | Computer Science - Systems and Control Mathematics - Dynamical Systems |
| title | A (Strongly) Connected Weighted Graph is Uniformly Detectable based on any Output Node |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T12%3A43%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20(Strongly)%20Connected%20Weighted%20Graph%20is%20Uniformly%20Detectable%20based%20on%20any%20Output%20Node&rft.au=Inyang-Udoh,%20Uduak&rft.date=2022-09-26&rft_id=info:doi/10.48550/arxiv.2209.13119&rft_dat=%3Carxiv_GOX%3E2209_13119%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |