{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T09:08:13Z","timestamp":1777626493426,"version":"3.51.4"},"reference-count":38,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,12,16]],"date-time":"2018-12-16T00:00:00Z","timestamp":1544918400000},"content-version":"vor","delay-in-days":349,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61873136"],"award-info":[{"award-number":["61873136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61374062"],"award-info":[{"award-number":["61374062"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61603288"],"award-info":[{"award-number":["61603288"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>It is well known that all agents in a multiagent system can asymptotically converge to a common value based on consensus protocols. Besides, the associated convergence rate depends on the magnitude of the smallest nonzero eigenvalue of Laplacian matrix <jats:italic>L<\/jats:italic>. In this paper, we introduce a superposition system to superpose to the original system and study how to change the convergence rate without destroying the connectivity of undirected communication graphs. And we find the result if the eigenvector <jats:italic>x<\/jats:italic> of eigenvalue <jats:italic>\u03bb<\/jats:italic> has two identical entries <jats:italic>x<\/jats:italic><jats:sub><jats:italic>i<\/jats:italic><\/jats:sub> = <jats:italic>x<\/jats:italic><jats:sub><jats:italic>j<\/jats:italic><\/jats:sub>, then the weight and existence of the edge <jats:italic>e<\/jats:italic><jats:sub><jats:italic>i<\/jats:italic><jats:italic>j<\/jats:italic><\/jats:sub> do not affect the magnitude of <jats:italic>\u03bb<\/jats:italic>, which is the argument of this paper. By taking advantage of the inequality of eigenvalues, conditions are derived to achieve the largest convergence rate with the largest delay margin, and, at the same time, the corresponding topology structure is characterized in detail. In addition, a method of constructing invalid algebraic connectivity weights is proposed to keep the convergence rate unchanged. Finally, simulations are given to demonstrate the effectiveness of the results.<\/jats:p>","DOI":"10.1155\/2018\/7831317","type":"journal-article","created":{"date-parts":[[2018,12,16]],"date-time":"2018-12-16T23:30:55Z","timestamp":1545003055000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":82,"title":["Fast Consensus Seeking on Networks with Antagonistic Interactions"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6248-4491","authenticated-orcid":false,"given":"Jijun","family":"Qu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9666-2572","authenticated-orcid":false,"given":"Zhijian","family":"Ji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7888-303X","authenticated-orcid":false,"given":"Chong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5250-7386","authenticated-orcid":false,"given":"Haisheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,12,16]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.812781"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/4978613"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2616020"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2016.07.021"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2651402"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.12.106"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2808942"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.846556"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9533-3"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1973.101168"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.4051"},{"key":"e_1_2_10_13_2","doi-asserted-by":"crossref","unstructured":"XiaoL.andBoydS. Fast linear iterations for distributed averaging Proceedings of the 42nd IEEE International Conference on Decision and Control Maui HI USA 4997\u20135002 https:\/\/doi.org\/10.1109\/CDC.2003.1272421.","DOI":"10.1109\/CDC.2003.1272421"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2572004"},{"key":"e_1_2_10_15_2","doi-asserted-by":"crossref","unstructured":"JinZ.andMurrayR. M. Multi-hop relay protocols for fast consensus seeking Proceedings of the 45th IEEE Conference on Decision and Control (CDC \u203206) December 2006 San Diego Calif USA 1001\u20131006 https:\/\/doi.org\/10.1109\/CDC.2006.377298 2-s2.0-39549109527.","DOI":"10.1109\/CDC.2006.377298"},{"key":"e_1_2_10_16_2","doi-asserted-by":"crossref","unstructured":"Olfati-SaberR. Ultrafast consensus in small-world networks Proceedings of the 2005 American Control Conference 2005. Portland OR USA 2371\u20132378 https:\/\/doi.org\/10.1109\/ACC.2005.1470321.","DOI":"10.1109\/ACC.2005.1470321"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2017.03.012"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2012.12.002"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2008.04.016"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2107051"},{"key":"e_1_2_10_21_2","doi-asserted-by":"crossref","unstructured":"WangH.andVan MieghemP. Algebraic connectivity optimization via link addition Proceedings of the 3d International ICST Conference on Bio-Inspired Models of Network Information and Computing Systems November 2008 Hyogo Japan https:\/\/doi.org\/10.4108\/ICST.BIONETICS2008.4691.","DOI":"10.4108\/ICST.BIONETICS2008.4691"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.11.002"},{"key":"e_1_2_10_23_2","unstructured":"OgiwaraK.andTakahashiN. On topology of networked multi-agent systems for fast consensus Proceedings of the Int. Symp. Non. Theory Appl. 2011 Kobe Japan 56\u201359."},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2503561"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2017.10.012"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.01.018"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.isatra.2018.01.007"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.3819"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2014.2335971"},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2631903"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/tac.2017.2756860"},{"key":"e_1_2_10_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-017-6273-7"},{"key":"e_1_2_10_33_2","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.3798"},{"key":"e_1_2_10_34_2","doi-asserted-by":"publisher","DOI":"10.1093\/imamci\/dnw013"},{"key":"e_1_2_10_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2549034"},{"key":"e_1_2_10_36_2","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.3870"},{"key":"e_1_2_10_37_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207179.2015.1063165"},{"key":"e_1_2_10_38_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/7831317.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/7831317.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/7831317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T22:11:20Z","timestamp":1723155080000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/7831317"}},"subtitle":[],"editor":[{"given":"Hiroki","family":"Sayama","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/7831317"],"URL":"https:\/\/doi.org\/10.1155\/2018\/7831317","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-10-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"7831317"}}