{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:33Z","timestamp":1773377673607,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849210","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1482-1486","source":"Crossref","is-referenced-by-count":3,"title":["On the Connectivity of Inhomogeneous Random K-out Graphs"],"prefix":"10.1109","author":[{"given":"Rashad","family":"Eletreby","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering and CyLab, Carnegie Mellon University, Pittsburgh, PA, 15213, USA"}]},{"given":"Osman","family":"Ya\u011fan","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering and CyLab, Carnegie Mellon University, Pittsburgh, PA, 15213, USA"}]}],"member":"263","reference":[{"key":"ref31","article-title":"Random graphs. 2000","author":"janson","year":"2000","journal-title":"Wiley–Intersci Ser Discrete Math Optim"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619814"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.03.042"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1341731.1341734"},{"key":"ref12","first-page":"313","article-title":"Random key graphs – can they be small worlds?","author":"ya?an","year":"2009","journal-title":"2009 First International Conference on Networks & Communications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/586115.586117"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2265694"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579431"},{"key":"ref17","article-title":"Random key predistribution schemes for sensor networks","author":"chan","year":"0","journal-title":"Proc of IEEE S&P 2003"},{"key":"ref18","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":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3219617.3219620"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498318"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs, I","volume":"6","author":"erd?s","year":"1959","journal-title":"Publicationes Mathematicae (Debrecen)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72360-8_7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.012582999"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849210"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090902"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1784-8_33"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/2200000005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2181331"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20490"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20168"},{"key":"ref24","article-title":"Connectivity of wireless sensor networks secured by heterogeneous key predistribution under an on\/off channel model","author":"eletreby","year":"2018","journal-title":"IEEE Transactions on Control of Network Systems"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2574742"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1109\/TWC.2008.060603","article-title":"A framework for a distributed key management scheme in heterogeneous wireless sensor networks","volume":"7","author":"lu","year":"2008","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2892029"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849210.pdf?arnumber=8849210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:50Z","timestamp":1773347690000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849210\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849210","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}