{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:42:29Z","timestamp":1762101749613,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"name":"KTH Strategic Research Area\u2013The Next Generation"},{"name":"National ICT Australia Ltd."},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP-110100538","DP-130103610"],"award-info":[{"award-number":["DP-110100538","DP-130103610"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/tit.2015.2468584","type":"journal-article","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T11:07:10Z","timestamp":1439550430000},"page":"5690-5707","source":"Crossref","is-referenced-by-count":24,"title":["Consensus Over Random Graph Processes: Network Borel\u2013Cantelli Lemmas for Almost Sure Convergence"],"prefix":"10.1109","volume":"61","author":[{"given":"Guodong","family":"Shi","sequence":"first","affiliation":[]},{"given":"Brian D. O.","family":"Anderson","sequence":"additional","affiliation":[]},{"given":"Karl Henrik","family":"Johansson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"ref38","first-page":"17","article-title":"On the evolution of random graphs","author":"erd?s","year":"1960","journal-title":"Publ Math Inst Hungar Acad Sci"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","author":"godsil","year":"2001","journal-title":"Algebraic Graph Theory"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719734"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2034054"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050940"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851725"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"journal-title":"Probability Theory and Examples","year":"2005","author":"durrett","key":"ref35"},{"journal-title":"Programming Games and Transportation Networks","year":"1965","author":"berge","key":"ref34"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2041998"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2036046"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4738888"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.812781"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034777"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2006.878783"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.858670"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/060676866"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080506"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2014812"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.917743"},{"journal-title":"Non-Negative Matrices and Markov Chains","year":"1973","author":"seneta","key":"ref50"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2010.01.005"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6161319"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/18.52474"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834433"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.841888"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/060657005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100033399"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2307\/2034984"},{"article-title":"Problems in decentralized decision making and computation","year":"1984","author":"tsitsiklis","key":"ref18"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1137\/S0036144503423264","article-title":"Fastest mixing Markov chain on a graph","volume":"46","author":"boyd","year":"2004","journal-title":"SIAM Rev"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883539"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924648"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(99)00018-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000092"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.846556"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2007.384124"},{"journal-title":"Real and Complex Analysis","year":"1987","author":"rudin","key":"ref49"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/2285509"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535293"},{"key":"ref45","doi-asserted-by":"crossref","DOI":"10.1109\/TNET.2015.2484345","article-title":"Finite-time convergent gossiping","author":"shi","year":"2015"},{"key":"ref48","first-page":"2394","article-title":"Agreeing under randomized network dynamics","author":"shi","year":"2012","journal-title":"Proc Amer Control Conf"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1214\/154957805100000104","article-title":"Basic properties of strong mixing conditions. A survey and some open questions","volume":"2","author":"bradley","year":"2005","journal-title":"Probab Surv"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2181331"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"2289","DOI":"10.1109\/TIT.2006.874384","article-title":"On the $\\theta $ -coverage and connectivity of large random networks","volume":"52","author":"xue","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"key":"ref44","first-page":"474","article-title":"When do gossip algorithms converge in finite time?","author":"shi","year":"2014","journal-title":"Proc Int Symp Math Theory Netw Syst (MTNS)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2031203"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7258415\/07194804.pdf?arnumber=7194804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:31Z","timestamp":1641987991000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7194804\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":50,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2468584","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}