Strong Sign Controllability of Diffusively-Coupled Networks

Strong Sign Controllability of Diffusively-Coupled Networks

This paper presents several conditions to determine strong sign controllability for diffusively-coupled undirected networks. The strong sign controllability is determined by the sign patterns (positive, negative, zero) of the edges. We first provide the necessary and sufficient conditions for strong...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2022-05
Hauptverfasser: Nam-Jin, Park, Seong-Ho, Kwon, Yoo-Bin Bae, Kim, Byeong-Yeon, Moore, Kevin L, Hyo-Sung Ahn
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Controllability
Polynomials
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Nam-Jin, Park
Seong-Ho, Kwon
Yoo-Bin Bae
Kim, Byeong-Yeon
Moore, Kevin L
Hyo-Sung Ahn
description This paper presents several conditions to determine strong sign controllability for diffusively-coupled undirected networks. The strong sign controllability is determined by the sign patterns (positive, negative, zero) of the edges. We first provide the necessary and sufficient conditions for strong sign controllability of basic components, such as path, cycle, and tree. Next, we propose a merging process to extend the basic componenets to a larger graph based on the conditions of the strong sign controllability. Furthermore, we develop an algorithm of polynomial complexity to find the minimum number of external input nodes while maintaining the strong sign controllability of a network.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2663125400</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2663125400</sourcerecordid><originalsourceid>FETCH-proquest_journals_26631254003</originalsourceid><addsrcrecordid>eNqNir0KwjAYAIMgWLTvEHAOpF_aKjhGxcml7qViUlJDvpofpW9vBx_A6TjuFiQDIQq2LwFWJA9h4JxDvYOqEhk5NNGj62ljekclutms7e7GmjhR1PRotE7BvJWdmMQ0WvWgVxU_6J9hQ5a6s0HlP67J9ny6yQsbPb6SCrEdMHk3pxbqWhRQlZyL_64vMzE3mA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2663125400</pqid></control><display><type>article</type><title>Strong Sign Controllability of Diffusively-Coupled Networks</title><source>Free E- Journals</source><creator>Nam-Jin, Park ; Seong-Ho, Kwon ; Yoo-Bin Bae ; Kim, Byeong-Yeon ; Moore, Kevin L ; Hyo-Sung Ahn</creator><creatorcontrib>Nam-Jin, Park ; Seong-Ho, Kwon ; Yoo-Bin Bae ; Kim, Byeong-Yeon ; Moore, Kevin L ; Hyo-Sung Ahn</creatorcontrib><description>This paper presents several conditions to determine strong sign controllability for diffusively-coupled undirected networks. The strong sign controllability is determined by the sign patterns (positive, negative, zero) of the edges. We first provide the necessary and sufficient conditions for strong sign controllability of basic components, such as path, cycle, and tree. Next, we propose a merging process to extend the basic componenets to a larger graph based on the conditions of the strong sign controllability. Furthermore, we develop an algorithm of polynomial complexity to find the minimum number of external input nodes while maintaining the strong sign controllability of a network.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Controllability ; Polynomials</subject><ispartof>arXiv.org, 2022-05</ispartof><rights>2022. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</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>776,780</link.rule.ids></links><search><creatorcontrib>Nam-Jin, Park</creatorcontrib><creatorcontrib>Seong-Ho, Kwon</creatorcontrib><creatorcontrib>Yoo-Bin Bae</creatorcontrib><creatorcontrib>Kim, Byeong-Yeon</creatorcontrib><creatorcontrib>Moore, Kevin L</creatorcontrib><creatorcontrib>Hyo-Sung Ahn</creatorcontrib><title>Strong Sign Controllability of Diffusively-Coupled Networks</title><title>arXiv.org</title><description>This paper presents several conditions to determine strong sign controllability for diffusively-coupled undirected networks. The strong sign controllability is determined by the sign patterns (positive, negative, zero) of the edges. We first provide the necessary and sufficient conditions for strong sign controllability of basic components, such as path, cycle, and tree. Next, we propose a merging process to extend the basic componenets to a larger graph based on the conditions of the strong sign controllability. Furthermore, we develop an algorithm of polynomial complexity to find the minimum number of external input nodes while maintaining the strong sign controllability of a network.</description><subject>Algorithms</subject><subject>Controllability</subject><subject>Polynomials</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNir0KwjAYAIMgWLTvEHAOpF_aKjhGxcml7qViUlJDvpofpW9vBx_A6TjuFiQDIQq2LwFWJA9h4JxDvYOqEhk5NNGj62ljekclutms7e7GmjhR1PRotE7BvJWdmMQ0WvWgVxU_6J9hQ5a6s0HlP67J9ny6yQsbPb6SCrEdMHk3pxbqWhRQlZyL_64vMzE3mA</recordid><startdate>20220511</startdate><enddate>20220511</enddate><creator>Nam-Jin, Park</creator><creator>Seong-Ho, Kwon</creator><creator>Yoo-Bin Bae</creator><creator>Kim, Byeong-Yeon</creator><creator>Moore, Kevin L</creator><creator>Hyo-Sung Ahn</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20220511</creationdate><title>Strong Sign Controllability of Diffusively-Coupled Networks</title><author>Nam-Jin, Park ; Seong-Ho, Kwon ; Yoo-Bin Bae ; Kim, Byeong-Yeon ; Moore, Kevin L ; Hyo-Sung Ahn</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_26631254003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Controllability</topic><topic>Polynomials</topic><toplevel>online_resources</toplevel><creatorcontrib>Nam-Jin, Park</creatorcontrib><creatorcontrib>Seong-Ho, Kwon</creatorcontrib><creatorcontrib>Yoo-Bin Bae</creatorcontrib><creatorcontrib>Kim, Byeong-Yeon</creatorcontrib><creatorcontrib>Moore, Kevin L</creatorcontrib><creatorcontrib>Hyo-Sung Ahn</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nam-Jin, Park</au><au>Seong-Ho, Kwon</au><au>Yoo-Bin Bae</au><au>Kim, Byeong-Yeon</au><au>Moore, Kevin L</au><au>Hyo-Sung Ahn</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Strong Sign Controllability of Diffusively-Coupled Networks</atitle><jtitle>arXiv.org</jtitle><date>2022-05-11</date><risdate>2022</risdate><eissn>2331-8422</eissn><abstract>This paper presents several conditions to determine strong sign controllability for diffusively-coupled undirected networks. The strong sign controllability is determined by the sign patterns (positive, negative, zero) of the edges. We first provide the necessary and sufficient conditions for strong sign controllability of basic components, such as path, cycle, and tree. Next, we propose a merging process to extend the basic componenets to a larger graph based on the conditions of the strong sign controllability. Furthermore, we develop an algorithm of polynomial complexity to find the minimum number of external input nodes while maintaining the strong sign controllability of a network.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2022-05
issn 2331-8422
language eng
recordid cdi_proquest_journals_2663125400
source Free E- Journals
subjects Algorithms
Controllability
Polynomials
title Strong Sign Controllability of Diffusively-Coupled Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T05%3A40%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Strong%20Sign%20Controllability%20of%20Diffusively-Coupled%20Networks&rft.jtitle=arXiv.org&rft.au=Nam-Jin,%20Park&rft.date=2022-05-11&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2663125400%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2663125400&rft_id=info:pmid/&rfr_iscdi=true