{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T05:46:31Z","timestamp":1720244791572},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"am","delay-in-days":676,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000148","name":"National Science Foundation Division of Electrical Communications and Cyber Systems","doi-asserted-by":"publisher","award":["ECCS-1809076","ECCS-1809315"],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-20-1-0076","FA9550-20-1-0333"],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-21-2-0098"],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Automatica"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1016\/j.automatica.2021.110088","type":"journal-article","created":{"date-parts":[[2021,12,9]],"date-time":"2021-12-09T18:15:25Z","timestamp":1639073725000},"page":"110088","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Gossip over holonomic graphs"],"prefix":"10.1016","volume":"136","author":[{"given":"Xudong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Mohamed-Ali","family":"Belabbas","sequence":"additional","affiliation":[]},{"given":"Ji","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.automatica.2021.110088_b1","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.laa.2021.02.016","article-title":"Triangulated Laman graphs, local stochastic matrices, and limits of their products","volume":"619","author":"Belabbas","year":"2021","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/j.automatica.2021.110088_b2","doi-asserted-by":"crossref","unstructured":"B\u00e9n\u00e9zit, F., Blondel, V., Thiran, P., Tsitsiklis, J., & Vetterli, M. (2010). Weighted gossip: Distributed averaging using non-doubly stochastic matrices. In Proceedings of the 2010 IEEE international symposium on information theory (1753\u20131757).","DOI":"10.1109\/ISIT.2010.5513273"},{"issue":"5","key":"10.1016\/j.automatica.2021.110088_b3","doi-asserted-by":"crossref","first-page":"2707","DOI":"10.1137\/12086594X","article-title":"How to decide consensus? A combinatorial necessary and sufficient condition and a proof that consensus is decidable but NP-hard","volume":"52","author":"Blondel","year":"2014","journal-title":"SIAM Journal on Control and Optimization"},{"issue":"6","key":"10.1016\/j.automatica.2021.110088_b4","doi-asserted-by":"crossref","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","article-title":"Randomized gossip algorithms","volume":"52","author":"Boyd","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"10.1016\/j.automatica.2021.110088_b5","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/060657005","article-title":"Reaching a consensus in a dynamically changing environment: a graphical approach","volume":"47","author":"Cao","year":"2008","journal-title":"SIAM Journal on Control and Optimization"},{"issue":"2","key":"10.1016\/j.automatica.2021.110088_b6","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/060657029","article-title":"Reaching a consensus in a dynamically changing environment: convergence rates, measurement delays and asynchronous events","volume":"47","author":"Cao","year":"2008","journal-title":"SIAM Journal on Control and Optimization"},{"key":"10.1016\/j.automatica.2021.110088_b7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.2307\/3213262","article-title":"Towards consensus: Some convergence theorems on repeated averaging","author":"Chatterjee","year":"1977","journal-title":"Journal of Applied Probability"},{"key":"10.1016\/j.automatica.2021.110088_b8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.automatica.2016.03.023","article-title":"Distributed averaging with linear objective maps","volume":"70","author":"Chen","year":"2016","journal-title":"Automatica"},{"issue":"6","key":"10.1016\/j.automatica.2021.110088_b9","doi-asserted-by":"crossref","first-page":"3869","DOI":"10.1137\/16M1070876","article-title":"Cluster consensus with point group symmetries","volume":"55","author":"Chen","year":"2017","journal-title":"SIAM Journal on Control and Optimization"},{"issue":"345","key":"10.1016\/j.automatica.2021.110088_b10","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1080\/01621459.1974.10480137","article-title":"Reaching a consensus","volume":"69","author":"DeGroot","year":"1974","journal-title":"Journal of the American Statistical Association"},{"key":"10.1016\/j.automatica.2021.110088_b11","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1017\/S0305004100033399","article-title":"Weak ergodicity in non-homogeneous Markov chains","volume":"54","author":"Hajnal","year":"1958","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"10.1016\/j.automatica.2021.110088_b12","doi-asserted-by":"crossref","unstructured":"Hendrickx, J. M., & Tsitsiklis, J. N. (2011). A new condition for convergence in continuous-time consensus seeking systems. In Proceedings of the 50th IEEE conference on decision and control (pp. 5070\u20135075).","DOI":"10.1109\/CDC.2011.6160231"},{"key":"10.1016\/j.automatica.2021.110088_b13","series-title":"Matrix analysis","author":"Horn","year":"1985"},{"issue":"6","key":"10.1016\/j.automatica.2021.110088_b14","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1109\/TAC.2003.812781","article-title":"Coordination of groups of mobile autonomous agents using nearest neighbor rules","volume":"48","author":"Jadbabaie","year":"2003","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/j.automatica.2021.110088_b15","doi-asserted-by":"crossref","unstructured":"Kempe, D., Dobra, A., & Gehrke, J. (2003). Gossip-based computation of aggregate information. In Proceedings of the 44th annual IEEE symposium on foundations of computer science (pp. 1\u201310).","DOI":"10.1109\/SFCS.2003.1238221"},{"issue":"9","key":"10.1016\/j.automatica.2021.110088_b16","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1109\/JPROC.2011.2159689","article-title":"Deterministic gossiping","volume":"99","author":"Liu","year":"2011","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"10.1016\/j.automatica.2021.110088_b17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1109\/TAC.2004.841888","article-title":"Stability of multi-agent systems with time-dependent communication links","volume":"50","author":"Moreau","year":"2005","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"2","key":"10.1016\/j.automatica.2021.110088_b18","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1109\/TAC.2016.2572004","article-title":"On convergence rate of weighted-averaging dynamics for consensus problems","volume":"62","author":"Nedi\u0107","year":"2017","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"9","key":"10.1016\/j.automatica.2021.110088_b19","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1109\/TAC.2004.834113","article-title":"Consensus problems in networks of agents with switching topology and time-delays","volume":"49","author":"Olfati-Saber","year":"2004","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"5","key":"10.1016\/j.automatica.2021.110088_b20","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1109\/TAC.2005.846556","article-title":"Consensus seeking in multiagent systems under dynamically changing interaction topologies","volume":"50","author":"Ren","year":"2005","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/j.automatica.2021.110088_b21","series-title":"Non-negative matrices and Markov chains","author":"Seneta","year":"2006"},{"issue":"2","key":"10.1016\/j.automatica.2021.110088_b22","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/TAC.2013.2283750","article-title":"Product of random stochastic matrices","volume":"59","author":"Touri","year":"2014","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/j.automatica.2021.110088_b23","series-title":"Problems in decentralized decision making and computation","author":"Tsitsiklis","year":"1984"},{"issue":"5","key":"10.1016\/j.automatica.2021.110088_b24","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1090\/S0002-9939-1963-0154756-3","article-title":"Products of indecomposable, aperiodic, stochastic matrices","volume":"15","author":"Wolfowitz","year":"1963","journal-title":"Proceedings of the Americal Mathematical Society"},{"issue":"8","key":"10.1016\/j.automatica.2021.110088_b25","doi-asserted-by":"crossref","first-page":"4282","DOI":"10.1109\/TAC.2017.2688278","article-title":"Distributed averaging using periodic gossiping","volume":"62","author":"Yu","year":"2017","journal-title":"IEEE Transactions on Automatic Control"}],"container-title":["Automatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0005109821006178?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0005109821006178?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T02:32:19Z","timestamp":1671676339000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0005109821006178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":25,"alternative-id":["S0005109821006178"],"URL":"https:\/\/doi.org\/10.1016\/j.automatica.2021.110088","relation":{},"ISSN":["0005-1098"],"issn-type":[{"value":"0005-1098","type":"print"}],"subject":[],"published":{"date-parts":[[2022,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Gossip over holonomic graphs","name":"articletitle","label":"Article Title"},{"value":"Automatica","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.automatica.2021.110088","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"110088"}}