{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T20:03:13Z","timestamp":1730232193035,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"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":[],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/icc42927.2021.9500694","type":"proceedings-article","created":{"date-parts":[[2021,8,6]],"date-time":"2021-08-06T20:49:21Z","timestamp":1628282961000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["Tight Bounds for the Probability of Connectivity in Random K-out Graphs"],"prefix":"10.1109","author":[{"given":"Mansi","family":"Sood","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,Department of Electrical and Computer Engineering and CyLab,Pittsburgh,PA,USA,15213"}]},{"given":"Osman","family":"Yagan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Department of Electrical and Computer Engineering and CyLab,Pittsburgh,PA,USA,15213"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/2308012"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176995765"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3224424"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.01.059"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2017.2694844"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/586115.586117"},{"key":"ref14","article-title":"Random graph modeling of key distribution schemes in wireless sensor networks","author":"ya?an","year":"2011","journal-title":"Ph D Dissertation"},{"key":"ref15","article-title":"Random key predistribution schemes for sensor networks","author":"chan","year":"2003","journal-title":"Proc of IEEE S&P 2003"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2007.04.009"},{"article-title":"Hiding in the crowd: A massively distributed algorithm for private averaging with malicious adversaries","year":"2018","author":"dellenbach","key":"ref17"},{"article-title":"The bitcoin lightning network: Scalable off-chain instant payments","year":"2016","author":"poon","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619814"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.peva.2013.03.001","article-title":"On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes","volume":"70","author":"ya?an","year":"2013","journal-title":"Performance Evaluation"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICIEEIMT.2017.8116858"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2634422"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.016128"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579431"},{"article-title":"Tight bounds for connectivity of random k-out graphs","year":"0","author":"sood","key":"ref29"},{"article-title":"Advances and open problems in federated learning","year":"2019","author":"k","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2265694"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.012582999"},{"article-title":"Distributed differentially private averaging with improved utility and robustness to malicious parties","year":"2020","author":"sabater","key":"ref9"},{"journal-title":"Network Science","year":"2016","author":"barab\u00e1si","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9013888"},{"key":"ref22","article-title":"On the size of the giant component in inhomogeneous random k-out graphs","author":"sood","year":"2020","journal-title":"IEEE 59th Conference on Decision and Control (CDC) to appear"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174528"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"2983","DOI":"10.1109\/TIT.2011.2181331","article-title":"Zero–one laws for connectivity in random key graphs","volume":"58","author":"ya?an","year":"2012","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref23","first-page":"261","article-title":"On the strength of connectedness of random graphs","author":"erd?s","year":"1961","journal-title":"Acta Math Acad Sci Hungar"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.52474"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"}],"event":{"name":"ICC 2021 - IEEE International Conference on Communications","start":{"date-parts":[[2021,6,14]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2021,6,23]]}},"container-title":["ICC 2021 - IEEE International Conference on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9500243\/9500244\/09500694.pdf?arnumber=9500694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T00:08:50Z","timestamp":1659485330000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9500694\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/icc42927.2021.9500694","relation":{},"subject":[],"published":{"date-parts":[[2021,6]]}}}