Noisy consensus dynamics in windmill-type graphs
In the present study, two types of consensus algorithms, including the leaderless coherence and the leader–follower coherence quantified by the Laplacian spectrum, are applied to noisy windmill graphs. Based on the graph construction, exact solutions are obtained for the leader–follower coherence wi...
Gespeichert in:
| Veröffentlicht in: | Chaos (Woodbury, N.Y.) N.Y.), 2020-12, Vol.30 (12), p.123131-123131 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 123131 |
|---|---|
| container_issue | 12 |
| container_start_page | 123131 |
| container_title | Chaos (Woodbury, N.Y.) |
| container_volume | 30 |
| creator | Sun, Weigang Li, Yifan Liu, Suyu |
| description | In the present study, two types of consensus algorithms, including the leaderless coherence and the leader–follower coherence quantified by the Laplacian spectrum, are applied to noisy windmill graphs. Based on the graph construction, exact solutions are obtained for the leader–follower coherence with freely assigned leaders. In order to compare consensus dynamics of two nonisomorphic graphs with the same number of nodes and edges, two generalized windmill graphs are selected as the network models and then explicit expressions of the network coherence are obtained. Then, coherences of models are compared. The obtained results reveal distinct coherence behaviors originating from intrinsic structures of models. Finally, the robustness of the coherence is analyzed. Accordingly, it is found that graph parameters and the number of leaders have a profound impact on the studied consensus algorithms. |
| doi_str_mv | 10.1063/5.0020696 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_scita</sourceid><recordid>TN_cdi_scitation_primary_10_1063_5_0020696</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2469876066</sourcerecordid><originalsourceid>FETCH-LOGICAL-c383t-b6b8184be1c10cf8aa93969e1b97477d97e17f19be8903a5226eda7c435385f83</originalsourceid><addsrcrecordid>eNp90EtLxDAUBeAgijOOLvwDUnCjQsebpnktZfAFg250XdI01QxtUptW6b-3w4wKgq7uXXwcDgehYwxzDIxc0jlAAkyyHTTFIGTMmUh21z9NY0wBJugghBUA4ITQfTQhhAgAlk4RPHgbhkh7F4wLfYiKwana6hBZF31YV9S2quJuaEz00qrmNRyivVJVwRxt7ww931w_Le7i5ePt_eJqGWsiSBfnLBdYpLnBGoMuhVKSSCYNziVPOS8kN5iXWOZGSCCKJgkzheI6JZQIWgoyQ2eb3Kb1b70JXVbboE1VKWd8H7Ik5WkqBed8pKe_6Mr3rRvbjYqNhgFjozrfKN36EFpTZk1ra9UOGYZsPWNGs-2Moz3ZJvZ5bYpv-bXbCC42IGjbqc5692_an_jdtz8wa4qSfAKrrIZm</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2469876066</pqid></control><display><type>article</type><title>Noisy consensus dynamics in windmill-type graphs</title><source>AIP Journals Complete</source><source>Alma/SFX Local Collection</source><creator>Sun, Weigang ; Li, Yifan ; Liu, Suyu</creator><creatorcontrib>Sun, Weigang ; Li, Yifan ; Liu, Suyu</creatorcontrib><description>In the present study, two types of consensus algorithms, including the leaderless coherence and the leader–follower coherence quantified by the Laplacian spectrum, are applied to noisy windmill graphs. Based on the graph construction, exact solutions are obtained for the leader–follower coherence with freely assigned leaders. In order to compare consensus dynamics of two nonisomorphic graphs with the same number of nodes and edges, two generalized windmill graphs are selected as the network models and then explicit expressions of the network coherence are obtained. Then, coherences of models are compared. The obtained results reveal distinct coherence behaviors originating from intrinsic structures of models. Finally, the robustness of the coherence is analyzed. Accordingly, it is found that graph parameters and the number of leaders have a profound impact on the studied consensus algorithms.</description><identifier>ISSN: 1054-1500</identifier><identifier>EISSN: 1089-7682</identifier><identifier>DOI: 10.1063/5.0020696</identifier><identifier>PMID: 33380064</identifier><identifier>CODEN: CHAOEH</identifier><language>eng</language><publisher>United States: American Institute of Physics</publisher><subject>Algorithms ; Coherence ; Exact solutions ; Graphs</subject><ispartof>Chaos (Woodbury, N.Y.), 2020-12, Vol.30 (12), p.123131-123131</ispartof><rights>Author(s)</rights><rights>2020 Author(s). Published under license by AIP Publishing.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c383t-b6b8184be1c10cf8aa93969e1b97477d97e17f19be8903a5226eda7c435385f83</citedby><cites>FETCH-LOGICAL-c383t-b6b8184be1c10cf8aa93969e1b97477d97e17f19be8903a5226eda7c435385f83</cites><orcidid>0000-0001-8699-5392 ; 0000000186995392</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,794,4512,27924,27925</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/33380064$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Sun, Weigang</creatorcontrib><creatorcontrib>Li, Yifan</creatorcontrib><creatorcontrib>Liu, Suyu</creatorcontrib><title>Noisy consensus dynamics in windmill-type graphs</title><title>Chaos (Woodbury, N.Y.)</title><addtitle>Chaos</addtitle><description>In the present study, two types of consensus algorithms, including the leaderless coherence and the leader–follower coherence quantified by the Laplacian spectrum, are applied to noisy windmill graphs. Based on the graph construction, exact solutions are obtained for the leader–follower coherence with freely assigned leaders. In order to compare consensus dynamics of two nonisomorphic graphs with the same number of nodes and edges, two generalized windmill graphs are selected as the network models and then explicit expressions of the network coherence are obtained. Then, coherences of models are compared. The obtained results reveal distinct coherence behaviors originating from intrinsic structures of models. Finally, the robustness of the coherence is analyzed. Accordingly, it is found that graph parameters and the number of leaders have a profound impact on the studied consensus algorithms.</description><subject>Algorithms</subject><subject>Coherence</subject><subject>Exact solutions</subject><subject>Graphs</subject><issn>1054-1500</issn><issn>1089-7682</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp90EtLxDAUBeAgijOOLvwDUnCjQsebpnktZfAFg250XdI01QxtUptW6b-3w4wKgq7uXXwcDgehYwxzDIxc0jlAAkyyHTTFIGTMmUh21z9NY0wBJugghBUA4ITQfTQhhAgAlk4RPHgbhkh7F4wLfYiKwana6hBZF31YV9S2quJuaEz00qrmNRyivVJVwRxt7ww931w_Le7i5ePt_eJqGWsiSBfnLBdYpLnBGoMuhVKSSCYNziVPOS8kN5iXWOZGSCCKJgkzheI6JZQIWgoyQ2eb3Kb1b70JXVbboE1VKWd8H7Ik5WkqBed8pKe_6Mr3rRvbjYqNhgFjozrfKN36EFpTZk1ra9UOGYZsPWNGs-2Moz3ZJvZ5bYpv-bXbCC42IGjbqc5692_an_jdtz8wa4qSfAKrrIZm</recordid><startdate>202012</startdate><enddate>202012</enddate><creator>Sun, Weigang</creator><creator>Li, Yifan</creator><creator>Liu, Suyu</creator><general>American Institute of Physics</general><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>H8D</scope><scope>L7M</scope><scope>7X8</scope><orcidid>https://orcid.org/0000-0001-8699-5392</orcidid><orcidid>https://orcid.org/0000000186995392</orcidid></search><sort><creationdate>202012</creationdate><title>Noisy consensus dynamics in windmill-type graphs</title><author>Sun, Weigang ; Li, Yifan ; Liu, Suyu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c383t-b6b8184be1c10cf8aa93969e1b97477d97e17f19be8903a5226eda7c435385f83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Coherence</topic><topic>Exact solutions</topic><topic>Graphs</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sun, Weigang</creatorcontrib><creatorcontrib>Li, Yifan</creatorcontrib><creatorcontrib>Liu, Suyu</creatorcontrib><collection>PubMed</collection><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>MEDLINE - Academic</collection><jtitle>Chaos (Woodbury, N.Y.)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sun, Weigang</au><au>Li, Yifan</au><au>Liu, Suyu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Noisy consensus dynamics in windmill-type graphs</atitle><jtitle>Chaos (Woodbury, N.Y.)</jtitle><addtitle>Chaos</addtitle><date>2020-12</date><risdate>2020</risdate><volume>30</volume><issue>12</issue><spage>123131</spage><epage>123131</epage><pages>123131-123131</pages><issn>1054-1500</issn><eissn>1089-7682</eissn><coden>CHAOEH</coden><abstract>In the present study, two types of consensus algorithms, including the leaderless coherence and the leader–follower coherence quantified by the Laplacian spectrum, are applied to noisy windmill graphs. Based on the graph construction, exact solutions are obtained for the leader–follower coherence with freely assigned leaders. In order to compare consensus dynamics of two nonisomorphic graphs with the same number of nodes and edges, two generalized windmill graphs are selected as the network models and then explicit expressions of the network coherence are obtained. Then, coherences of models are compared. The obtained results reveal distinct coherence behaviors originating from intrinsic structures of models. Finally, the robustness of the coherence is analyzed. Accordingly, it is found that graph parameters and the number of leaders have a profound impact on the studied consensus algorithms.</abstract><cop>United States</cop><pub>American Institute of Physics</pub><pmid>33380064</pmid><doi>10.1063/5.0020696</doi><tpages>9</tpages><orcidid>https://orcid.org/0000-0001-8699-5392</orcidid><orcidid>https://orcid.org/0000000186995392</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1054-1500 |
| ispartof | Chaos (Woodbury, N.Y.), 2020-12, Vol.30 (12), p.123131-123131 |
| issn | 1054-1500 1089-7682 |
| language | eng |
| recordid | cdi_scitation_primary_10_1063_5_0020696 |
| source | AIP Journals Complete; Alma/SFX Local Collection |
| subjects | Algorithms Coherence Exact solutions Graphs |
| title | Noisy consensus dynamics in windmill-type graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T03%3A21%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_scita&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Noisy%20consensus%20dynamics%20in%20windmill-type%20graphs&rft.jtitle=Chaos%20(Woodbury,%20N.Y.)&rft.au=Sun,%20Weigang&rft.date=2020-12&rft.volume=30&rft.issue=12&rft.spage=123131&rft.epage=123131&rft.pages=123131-123131&rft.issn=1054-1500&rft.eissn=1089-7682&rft.coden=CHAOEH&rft_id=info:doi/10.1063/5.0020696&rft_dat=%3Cproquest_scita%3E2469876066%3C/proquest_scita%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2469876066&rft_id=info:pmid/33380064&rfr_iscdi=true |