{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T00:44:58Z","timestamp":1791074698750,"version":"4.1.0"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"16","license":[{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T00:00:00Z","timestamp":1375315200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/tsp.2013.2264056","type":"journal-article","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T18:42:03Z","timestamp":1369075323000},"page":"3959-3971","source":"Crossref","is-referenced-by-count":43,"title":["Broadcast Gossip Algorithms for Consensus on Strongly Connected Digraphs"],"prefix":"10.1109","volume":"61","author":[{"given":"Shaochuan","family":"Wu","sequence":"first","affiliation":[{"name":"Department of Electrical and Information Engineering, Harbin Institute of Technology, Harbin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael G.","family":"Rabbat","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, McGill University, Montreal, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2011.2123078"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2079650"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2010.2064295"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6160386"},{"key":"ref14","author":"cai","year":"2012","journal-title":"Average consensus on general strongly connected digraphs"},{"key":"ref15","author":"meyer","year":"2001","journal-title":"Matrix Analysis and Applied Linear Algebra"},{"key":"ref16","author":"seyranian","year":"2004","journal-title":"Multiparameter Stability Theory with Mechanical Applications"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-32792-4","author":"seneta","year":"1981","journal-title":"Non-Negative Matrices and Markov Chains"},{"key":"ref18","article-title":"Broadcast gossip algorithms for consensus on stongly connected digraphs (extended version)","author":"shaochuan","year":"2012"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.02.022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2008.4578682"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400835355","author":"mesbahi","year":"2010","journal-title":"Graph Theoretic Methods in Multiagent Networks"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016247"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4739315"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref7","first-page":"66","article-title":"Consensus on the average on arbitrary strongly connected digraphs based on broadcast gossip algorithms","author":"franceschelli","year":"2009","journal-title":"Proc 1st IFAC Workshop on Estimation and Control of Netw Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887293"},{"key":"ref9","author":"bertsekas","year":"1997","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2052531"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"ref22","author":"stewart","year":"1990","journal-title":"Matrix Perturbation Theory"},{"key":"ref21","author":"bhatia","year":"1996","journal-title":"Matrix Analysis"},{"key":"ref24","first-page":"1106","article-title":"Critical power for asymptotic connectivity in wireless networks","author":"gupta","year":"1998","journal-title":"Proc Stochastic Anal Control Optim Appl"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(99)00264-5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/6558519\/06517485.pdf?arnumber=6517485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T17:43:50Z","timestamp":1745343830000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6517485\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":25,"journal-issue":{"issue":"16"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2013.2264056","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}